./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b09214ba8bbbbd71aa3d66dba50977f3edce53135be39821a74d1a850689d4e
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 11:28:39,722 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 11:28:39,724 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 11:28:39,749 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 11:28:39,750 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 11:28:39,750 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 11:28:39,751 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 11:28:39,752 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 11:28:39,753 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 11:28:39,754 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 11:28:39,755 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 11:28:39,756 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 11:28:39,756 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 11:28:39,757 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 11:28:39,758 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 11:28:39,758 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 11:28:39,759 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 11:28:39,760 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 11:28:39,761 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 11:28:39,762 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 11:28:39,763 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 11:28:39,764 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 11:28:39,765 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 11:28:39,766 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 11:28:39,768 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 11:28:39,769 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 11:28:39,769 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 11:28:39,769 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 11:28:39,770 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 11:28:39,770 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 11:28:39,771 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 11:28:39,771 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 11:28:39,772 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 11:28:39,772 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 11:28:39,773 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 11:28:39,773 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 11:28:39,774 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 11:28:39,774 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 11:28:39,774 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 11:28:39,774 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 11:28:39,775 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 11:28:39,776 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 11:28:39,803 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 11:28:39,803 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 11:28:39,804 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 11:28:39,804 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 11:28:39,806 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 11:28:39,806 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 11:28:39,807 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 11:28:39,807 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 11:28:39,807 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 11:28:39,808 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 11:28:39,808 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 11:28:39,808 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 11:28:39,809 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 11:28:39,809 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 11:28:39,809 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 11:28:39,809 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 11:28:39,810 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 11:28:39,810 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 11:28:39,810 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 11:28:39,810 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 11:28:39,811 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 11:28:39,811 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 11:28:39,811 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 11:28:39,811 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 11:28:39,812 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 11:28:39,812 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 11:28:39,813 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 11:28:39,813 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 11:28:39,813 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 11:28:39,813 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 11:28:39,813 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 11:28:39,813 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b09214ba8bbbbd71aa3d66dba50977f3edce53135be39821a74d1a850689d4e
[2023-11-03 11:28:39,998 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 11:28:40,023 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 11:28:40,026 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 11:28:40,027 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 11:28:40,028 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 11:28:40,029 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2023-11-03 11:28:41,112 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 11:28:41,301 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 11:28:41,301 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2023-11-03 11:28:41,314 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/3c983c580/91cbe5ef79734b6cb0a717b16b8a989c/FLAG2a3839f33
[2023-11-03 11:28:41,662 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/3c983c580/91cbe5ef79734b6cb0a717b16b8a989c
[2023-11-03 11:28:41,664 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 11:28:41,665 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 11:28:41,666 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 11:28:41,666 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 11:28:41,671 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 11:28:41,671 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:28:41" (1/1) ...
[2023-11-03 11:28:41,672 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d47e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:41, skipping insertion in model container
[2023-11-03 11:28:41,672 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:28:41" (1/1) ...
[2023-11-03 11:28:41,683 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 11:28:41,721 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 11:28:41,841 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 11:28:41,969 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 11:28:41,976 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 11:28:41,991 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 11:28:42,016 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 11:28:42,053 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 11:28:42,054 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42 WrapperNode
[2023-11-03 11:28:42,054 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 11:28:42,055 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 11:28:42,055 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 11:28:42,055 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 11:28:42,062 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,081 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,101 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-11-03 11:28:42,101 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 11:28:42,102 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 11:28:42,102 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 11:28:42,102 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 11:28:42,111 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,111 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,115 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,115 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,122 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,125 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,126 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,127 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,129 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 11:28:42,130 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 11:28:42,130 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 11:28:42,130 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 11:28:42,131 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (1/1) ...
[2023-11-03 11:28:42,137 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 11:28:42,147 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:28:42,162 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 11:28:42,166 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 11:28:42,192 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 11:28:42,192 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 11:28:42,192 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 11:28:42,192 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 11:28:42,193 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 11:28:42,193 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 11:28:42,193 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 11:28:42,193 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 11:28:42,193 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 11:28:42,193 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 11:28:42,193 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 11:28:42,194 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 11:28:42,300 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 11:28:42,302 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 11:28:42,534 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 11:28:42,540 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 11:28:42,540 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 11:28:42,542 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:28:42 BoogieIcfgContainer
[2023-11-03 11:28:42,542 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 11:28:42,544 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 11:28:42,544 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 11:28:42,546 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 11:28:42,547 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 11:28:41" (1/3) ...
[2023-11-03 11:28:42,547 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92e538f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:28:42, skipping insertion in model container
[2023-11-03 11:28:42,547 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:28:42" (2/3) ...
[2023-11-03 11:28:42,548 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92e538f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:28:42, skipping insertion in model container
[2023-11-03 11:28:42,548 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:28:42" (3/3) ...
[2023-11-03 11:28:42,549 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2023-11-03 11:28:42,555 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 11:28:42,564 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 11:28:42,564 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-11-03 11:28:42,564 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 11:28:42,617 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 11:28:42,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2023-11-03 11:28:42,733 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2023-11-03 11:28:42,733 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 11:28:42,746 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-11-03 11:28:42,746 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 240 flow
[2023-11-03 11:28:42,750 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 240 flow
[2023-11-03 11:28:42,753 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:28:42,761 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 116 transitions, 240 flow
[2023-11-03 11:28:42,763 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 116 transitions, 240 flow
[2023-11-03 11:28:42,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2023-11-03 11:28:42,792 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2023-11-03 11:28:42,792 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 11:28:42,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-11-03 11:28:42,794 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2166
[2023-11-03 11:28:44,919 INFO  L134        LiptonReduction]: Checked pairs total: 11903
[2023-11-03 11:28:44,919 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-11-03 11:28:44,932 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:28:44,937 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ad9fae7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:28:44,937 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-03 11:28:44,939 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-11-03 11:28:44,939 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:28:44,939 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:44,939 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 11:28:44,940 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:28:44,944 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:44,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 384, now seen corresponding path program 1 times
[2023-11-03 11:28:44,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:44,951 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639148178]
[2023-11-03 11:28:44,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:44,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:45,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:45,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:45,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:45,036 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639148178]
[2023-11-03 11:28:45,036 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639148178] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:45,037 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:45,037 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 11:28:45,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131420380]
[2023-11-03 11:28:45,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:45,045 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 11:28:45,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:45,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 11:28:45,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 11:28:45,062 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194
[2023-11-03 11:28:45,064 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,065 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:45,065 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194
[2023-11-03 11:28:45,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:45,134 INFO  L130       PetriNetUnfolder]: 29/222 cut-off events.
[2023-11-03 11:28:45,135 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2023-11-03 11:28:45,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 222 events. 29/222 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1154 event pairs, 28 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 249. Up to 78 conditions per place. 
[2023-11-03 11:28:45,137 INFO  L137   encePairwiseOnDemand]: 193/194 looper letters, 15 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-11-03 11:28:45,137 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 136 flow
[2023-11-03 11:28:45,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 11:28:45,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 11:28:45,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions.
[2023-11-03 11:28:45,148 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6134020618556701
[2023-11-03 11:28:45,148 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 238 transitions.
[2023-11-03 11:28:45,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions.
[2023-11-03 11:28:45,150 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:45,151 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions.
[2023-11-03 11:28:45,154 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,158 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,158 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,160 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 238 transitions.
[2023-11-03 11:28:45,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 136 flow
[2023-11-03 11:28:45,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:45,164 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-11-03 11:28:45,165 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2023-11-03 11:28:45,168 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-11-03 11:28:45,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-11-03 11:28:45,169 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,169 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:45,169 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:45,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 11:28:45,169 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:28:45,170 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:45,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667475177, now seen corresponding path program 1 times
[2023-11-03 11:28:45,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:45,170 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562980698]
[2023-11-03 11:28:45,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:45,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:45,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:45,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:45,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:45,513 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562980698]
[2023-11-03 11:28:45,513 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562980698] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:45,513 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:45,513 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:28:45,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741297915]
[2023-11-03 11:28:45,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:45,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:28:45,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:45,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:28:45,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:28:45,716 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194
[2023-11-03 11:28:45,717 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,717 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:45,718 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194
[2023-11-03 11:28:45,718 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:45,977 INFO  L130       PetriNetUnfolder]: 212/632 cut-off events.
[2023-11-03 11:28:45,977 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2023-11-03 11:28:45,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 632 events. 212/632 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3642 event pairs, 63 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 1154. Up to 276 conditions per place. 
[2023-11-03 11:28:45,984 INFO  L137   encePairwiseOnDemand]: 171/194 looper letters, 57 selfloop transitions, 29 changer transitions 0/100 dead transitions.
[2023-11-03 11:28:45,984 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 383 flow
[2023-11-03 11:28:45,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:28:45,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:28:45,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions.
[2023-11-03 11:28:45,989 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5197594501718213
[2023-11-03 11:28:45,989 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 605 transitions.
[2023-11-03 11:28:45,989 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions.
[2023-11-03 11:28:45,990 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:45,990 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions.
[2023-11-03 11:28:45,993 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,996 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,996 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:45,996 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 605 transitions.
[2023-11-03 11:28:45,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 383 flow
[2023-11-03 11:28:45,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:45,999 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-11-03 11:28:45,999 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2023-11-03 11:28:46,000 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-11-03 11:28:46,000 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-11-03 11:28:46,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,001 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:46,001 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:46,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 11:28:46,001 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:28:46,002 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:46,002 INFO  L85        PathProgramCache]: Analyzing trace with hash -946268794, now seen corresponding path program 1 times
[2023-11-03 11:28:46,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:46,002 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622503600]
[2023-11-03 11:28:46,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:46,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:46,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:46,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:46,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:46,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622503600]
[2023-11-03 11:28:46,032 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622503600] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:46,033 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:46,033 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 11:28:46,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210069211]
[2023-11-03 11:28:46,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:46,034 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 11:28:46,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:46,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 11:28:46,035 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 11:28:46,048 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 194
[2023-11-03 11:28:46,048 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,048 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:46,049 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 194
[2023-11-03 11:28:46,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:46,133 INFO  L130       PetriNetUnfolder]: 128/491 cut-off events.
[2023-11-03 11:28:46,133 INFO  L131       PetriNetUnfolder]: For 115/126 co-relation queries the response was YES.
[2023-11-03 11:28:46,136 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 491 events. 128/491 cut-off events. For 115/126 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2713 event pairs, 10 based on Foata normal form. 14/475 useless extension candidates. Maximal degree in co-relation 1102. Up to 142 conditions per place. 
[2023-11-03 11:28:46,138 INFO  L137   encePairwiseOnDemand]: 190/194 looper letters, 26 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-11-03 11:28:46,139 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 396 flow
[2023-11-03 11:28:46,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 11:28:46,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 11:28:46,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions.
[2023-11-03 11:28:46,141 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5824742268041238
[2023-11-03 11:28:46,141 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 339 transitions.
[2023-11-03 11:28:46,141 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions.
[2023-11-03 11:28:46,141 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:46,141 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions.
[2023-11-03 11:28:46,142 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,144 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,144 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,144 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 339 transitions.
[2023-11-03 11:28:46,144 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 396 flow
[2023-11-03 11:28:46,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:46,149 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-11-03 11:28:46,149 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2023-11-03 11:28:46,150 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-11-03 11:28:46,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-11-03 11:28:46,151 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,151 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:46,151 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:46,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 11:28:46,151 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:28:46,152 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:46,152 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190871734, now seen corresponding path program 1 times
[2023-11-03 11:28:46,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:46,152 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883398712]
[2023-11-03 11:28:46,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:46,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:46,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:46,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:46,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:46,385 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883398712]
[2023-11-03 11:28:46,385 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883398712] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:46,386 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:46,386 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:28:46,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428462910]
[2023-11-03 11:28:46,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:46,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:28:46,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:46,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:28:46,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:28:46,665 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 194
[2023-11-03 11:28:46,666 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,666 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:46,666 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 194
[2023-11-03 11:28:46,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:46,884 INFO  L130       PetriNetUnfolder]: 209/640 cut-off events.
[2023-11-03 11:28:46,884 INFO  L131       PetriNetUnfolder]: For 285/289 co-relation queries the response was YES.
[2023-11-03 11:28:46,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 640 events. 209/640 cut-off events. For 285/289 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3496 event pairs, 45 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 1636. Up to 328 conditions per place. 
[2023-11-03 11:28:46,887 INFO  L137   encePairwiseOnDemand]: 183/194 looper letters, 45 selfloop transitions, 33 changer transitions 8/124 dead transitions.
[2023-11-03 11:28:46,887 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 703 flow
[2023-11-03 11:28:46,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:28:46,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:28:46,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-11-03 11:28:46,889 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5455326460481099
[2023-11-03 11:28:46,890 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-11-03 11:28:46,890 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-11-03 11:28:46,890 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:46,890 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-11-03 11:28:46,891 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,893 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,894 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,894 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-11-03 11:28:46,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 703 flow
[2023-11-03 11:28:46,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 703 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:46,898 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-11-03 11:28:46,898 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2023-11-03 11:28:46,899 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-11-03 11:28:46,899 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-11-03 11:28:46,899 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:46,900 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:46,900 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:46,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 11:28:46,900 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:28:46,900 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:46,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -277895401, now seen corresponding path program 1 times
[2023-11-03 11:28:46,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:46,901 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457348675]
[2023-11-03 11:28:46,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:46,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:46,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:47,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:47,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:47,158 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457348675]
[2023-11-03 11:28:47,158 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457348675] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:47,158 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:47,158 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:28:47,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786518313]
[2023-11-03 11:28:47,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:47,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:28:47,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:47,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:28:47,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:28:47,268 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 194
[2023-11-03 11:28:47,269 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:47,269 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:47,269 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 194
[2023-11-03 11:28:47,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:47,715 INFO  L130       PetriNetUnfolder]: 361/945 cut-off events.
[2023-11-03 11:28:47,715 INFO  L131       PetriNetUnfolder]: For 732/740 co-relation queries the response was YES.
[2023-11-03 11:28:47,717 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 945 events. 361/945 cut-off events. For 732/740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5703 event pairs, 74 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 3070. Up to 656 conditions per place. 
[2023-11-03 11:28:47,722 INFO  L137   encePairwiseOnDemand]: 172/194 looper letters, 103 selfloop transitions, 76 changer transitions 20/214 dead transitions.
[2023-11-03 11:28:47,722 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 214 transitions, 1493 flow
[2023-11-03 11:28:47,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:28:47,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:28:47,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions.
[2023-11-03 11:28:47,725 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5395189003436426
[2023-11-03 11:28:47,725 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 628 transitions.
[2023-11-03 11:28:47,725 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions.
[2023-11-03 11:28:47,725 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:47,725 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions.
[2023-11-03 11:28:47,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:47,728 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:47,729 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:47,729 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 628 transitions.
[2023-11-03 11:28:47,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 214 transitions, 1493 flow
[2023-11-03 11:28:47,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 214 transitions, 1493 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:47,736 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-11-03 11:28:47,737 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2023-11-03 11:28:47,737 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-11-03 11:28:47,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-11-03 11:28:47,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:47,738 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:47,738 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 11:28:47,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 11:28:47,738 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:28:47,738 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:47,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529204463, now seen corresponding path program 1 times
[2023-11-03 11:28:47,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:47,739 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610325157]
[2023-11-03 11:28:47,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:47,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:47,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:28:47,760 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 11:28:47,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:28:47,787 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 11:28:47,787 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 11:28:47,788 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-03 11:28:47,789 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-03 11:28:47,790 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-03 11:28:47,791 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-03 11:28:47,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 11:28:47,791 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:47,793 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 11:28:47,793 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 11:28:47,812 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 11:28:47,815 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2023-11-03 11:28:47,832 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2023-11-03 11:28:47,832 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 11:28:47,832 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2023-11-03 11:28:47,832 INFO  L82        GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 292 flow
[2023-11-03 11:28:47,833 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 292 flow
[2023-11-03 11:28:47,833 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:28:47,834 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 137 transitions, 292 flow
[2023-11-03 11:28:47,834 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 137 transitions, 292 flow
[2023-11-03 11:28:47,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2023-11-03 11:28:47,849 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2023-11-03 11:28:47,849 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 11:28:47,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2023-11-03 11:28:47,853 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5548
[2023-11-03 11:28:50,232 INFO  L134        LiptonReduction]: Checked pairs total: 29998
[2023-11-03 11:28:50,232 INFO  L136        LiptonReduction]: Total number of compositions: 86
[2023-11-03 11:28:50,234 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:28:50,235 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ad9fae7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:28:50,236 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-03 11:28:50,236 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 11:28:50,236 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:28:50,236 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:50,236 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 11:28:50,236 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:28:50,237 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:50,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 627, now seen corresponding path program 1 times
[2023-11-03 11:28:50,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:50,237 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540663182]
[2023-11-03 11:28:50,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:50,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:50,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:50,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:50,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:50,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540663182]
[2023-11-03 11:28:50,241 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540663182] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:50,241 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:50,241 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 11:28:50,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471608943]
[2023-11-03 11:28:50,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:50,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 11:28:50,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:50,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 11:28:50,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 11:28:50,242 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 223
[2023-11-03 11:28:50,242 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:50,242 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:50,243 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 223
[2023-11-03 11:28:50,243 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:50,343 INFO  L130       PetriNetUnfolder]: 363/1129 cut-off events.
[2023-11-03 11:28:50,343 INFO  L131       PetriNetUnfolder]: For 94/181 co-relation queries the response was YES.
[2023-11-03 11:28:50,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1129 events. 363/1129 cut-off events. For 94/181 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7294 event pairs, 356 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1476. Up to 647 conditions per place. 
[2023-11-03 11:28:50,348 INFO  L137   encePairwiseOnDemand]: 222/223 looper letters, 21 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-11-03 11:28:50,348 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 186 flow
[2023-11-03 11:28:50,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 11:28:50,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 11:28:50,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions.
[2023-11-03 11:28:50,349 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6322869955156951
[2023-11-03 11:28:50,349 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 282 transitions.
[2023-11-03 11:28:50,349 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions.
[2023-11-03 11:28:50,350 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:50,350 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions.
[2023-11-03 11:28:50,350 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:50,351 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:50,351 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:50,351 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 282 transitions.
[2023-11-03 11:28:50,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 186 flow
[2023-11-03 11:28:50,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:50,352 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-11-03 11:28:50,353 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2023-11-03 11:28:50,353 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-11-03 11:28:50,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-11-03 11:28:50,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:50,354 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:50,354 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:50,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 11:28:50,354 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:28:50,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:50,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1479847002, now seen corresponding path program 1 times
[2023-11-03 11:28:50,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:50,354 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745391574]
[2023-11-03 11:28:50,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:50,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:50,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:50,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:50,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:50,492 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745391574]
[2023-11-03 11:28:50,492 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745391574] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:50,492 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:50,492 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:28:50,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910311385]
[2023-11-03 11:28:50,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:50,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:28:50,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:50,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:28:50,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:28:50,627 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 223
[2023-11-03 11:28:50,628 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:50,628 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:50,628 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 223
[2023-11-03 11:28:50,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:51,563 INFO  L130       PetriNetUnfolder]: 5489/10606 cut-off events.
[2023-11-03 11:28:51,563 INFO  L131       PetriNetUnfolder]: For 254/289 co-relation queries the response was YES.
[2023-11-03 11:28:51,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19874 conditions, 10606 events. 5489/10606 cut-off events. For 254/289 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80178 event pairs, 1459 based on Foata normal form. 16/9949 useless extension candidates. Maximal degree in co-relation 19869. Up to 5638 conditions per place. 
[2023-11-03 11:28:51,605 INFO  L137   encePairwiseOnDemand]: 196/223 looper letters, 91 selfloop transitions, 48 changer transitions 0/157 dead transitions.
[2023-11-03 11:28:51,605 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 157 transitions, 621 flow
[2023-11-03 11:28:51,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:28:51,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:28:51,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions.
[2023-11-03 11:28:51,607 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5590433482810164
[2023-11-03 11:28:51,607 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 748 transitions.
[2023-11-03 11:28:51,607 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions.
[2023-11-03 11:28:51,608 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:51,608 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions.
[2023-11-03 11:28:51,609 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:51,611 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:51,611 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:51,611 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 748 transitions.
[2023-11-03 11:28:51,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 157 transitions, 621 flow
[2023-11-03 11:28:51,612 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 157 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:51,614 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-11-03 11:28:51,614 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-11-03 11:28:51,614 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-11-03 11:28:51,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-11-03 11:28:51,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:51,615 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:51,615 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:51,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 11:28:51,615 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:28:51,615 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:51,615 INFO  L85        PathProgramCache]: Analyzing trace with hash -576895935, now seen corresponding path program 1 times
[2023-11-03 11:28:51,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:51,616 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174053168]
[2023-11-03 11:28:51,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:51,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:51,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:51,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:51,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:51,635 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174053168]
[2023-11-03 11:28:51,635 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174053168] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:51,635 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:51,635 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 11:28:51,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994863269]
[2023-11-03 11:28:51,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:51,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 11:28:51,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:51,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 11:28:51,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 11:28:51,650 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2023-11-03 11:28:51,650 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:51,650 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:51,650 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2023-11-03 11:28:51,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:52,066 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_37 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65 1))) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_65)) |v_threadThread1of2ForFork0_#t~nondet4_28|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_65))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65)))))  InVars {#race=|v_#race_73|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_28|, ~datas~0.offset=v_~datas~0.offset_65}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_15|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, ~datas~0.offset=v_~datas~0.offset_65}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [51#threadEXITtrue, 140#true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 157#(= |#race~datas~0| 0), threadThread1of2ForFork0InUse, 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 102#L1017-4true, threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2023-11-03 11:28:52,066 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,068 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L1017-4-->L1017-6: Formula: (= (store |v_#race_66| v_~datas~0.base_65 (store (select |v_#race_66| v_~datas~0.base_65) (+ (* v_threadThread2of2ForFork0_~i~0_33 4) v_~datas~0.offset_57) |v_threadThread2of2ForFork0_#t~nondet4_23|)) |v_#race_65|)  InVars {#race=|v_#race_66|, ~datas~0.base=v_~datas~0.base_65, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  OutVars{#race=|v_#race_65|, ~datas~0.base=v_~datas~0.base_65, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_23|, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [140#true, 20#L1017-9true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 28#L1017-6true, 157#(= |#race~datas~0| 0), 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2023-11-03 11:28:52,068 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:28:52,146 INFO  L130       PetriNetUnfolder]: 2751/6464 cut-off events.
[2023-11-03 11:28:52,146 INFO  L131       PetriNetUnfolder]: For 2006/2564 co-relation queries the response was YES.
[2023-11-03 11:28:52,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 6464 events. 2751/6464 cut-off events. For 2006/2564 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53340 event pairs, 950 based on Foata normal form. 125/6165 useless extension candidates. Maximal degree in co-relation 14852. Up to 2371 conditions per place. 
[2023-11-03 11:28:52,176 INFO  L137   encePairwiseOnDemand]: 217/223 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-11-03 11:28:52,176 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-11-03 11:28:52,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 11:28:52,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 11:28:52,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2023-11-03 11:28:52,178 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5919282511210763
[2023-11-03 11:28:52,178 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2023-11-03 11:28:52,178 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2023-11-03 11:28:52,179 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:52,179 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2023-11-03 11:28:52,179 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:52,180 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:52,180 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:52,181 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 396 transitions.
[2023-11-03 11:28:52,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-11-03 11:28:52,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:52,192 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-11-03 11:28:52,192 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-11-03 11:28:52,193 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-11-03 11:28:52,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-11-03 11:28:52,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:52,193 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:52,193 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:52,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 11:28:52,193 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:28:52,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:52,194 INFO  L85        PathProgramCache]: Analyzing trace with hash 594333784, now seen corresponding path program 1 times
[2023-11-03 11:28:52,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:52,194 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189401252]
[2023-11-03 11:28:52,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:52,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:52,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:52,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:52,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:52,344 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189401252]
[2023-11-03 11:28:52,345 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189401252] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:52,345 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:52,345 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:28:52,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485733404]
[2023-11-03 11:28:52,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:52,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:28:52,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:52,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:28:52,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:28:52,565 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 223
[2023-11-03 11:28:52,565 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:52,565 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:52,565 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 223
[2023-11-03 11:28:52,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:53,725 INFO  L130       PetriNetUnfolder]: 5567/10624 cut-off events.
[2023-11-03 11:28:53,725 INFO  L131       PetriNetUnfolder]: For 6462/6560 co-relation queries the response was YES.
[2023-11-03 11:28:53,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28208 conditions, 10624 events. 5567/10624 cut-off events. For 6462/6560 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 79146 event pairs, 1759 based on Foata normal form. 0/10089 useless extension candidates. Maximal degree in co-relation 28197. Up to 6791 conditions per place. 
[2023-11-03 11:28:53,775 INFO  L137   encePairwiseOnDemand]: 208/223 looper letters, 108 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-11-03 11:28:53,775 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1309 flow
[2023-11-03 11:28:53,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:28:53,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:28:53,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-11-03 11:28:53,777 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5747384155455905
[2023-11-03 11:28:53,778 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-11-03 11:28:53,778 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-11-03 11:28:53,778 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:53,778 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-11-03 11:28:53,779 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:53,781 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:53,781 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:53,782 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 769 transitions.
[2023-11-03 11:28:53,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1309 flow
[2023-11-03 11:28:53,790 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1309 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:53,792 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-11-03 11:28:53,793 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2023-11-03 11:28:53,793 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-11-03 11:28:53,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-11-03 11:28:53,794 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:53,794 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:53,794 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:53,794 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 11:28:53,794 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:28:53,795 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:53,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171520631, now seen corresponding path program 1 times
[2023-11-03 11:28:53,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:53,796 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809424101]
[2023-11-03 11:28:53,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:53,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:53,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:54,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:28:54,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:54,005 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809424101]
[2023-11-03 11:28:54,005 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809424101] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:54,005 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:54,005 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:28:54,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024560231]
[2023-11-03 11:28:54,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:54,005 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:28:54,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:54,006 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:28:54,006 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:28:54,192 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2023-11-03 11:28:54,193 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:54,193 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:54,193 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2023-11-03 11:28:54,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:28:56,685 INFO  L130       PetriNetUnfolder]: 11107/19827 cut-off events.
[2023-11-03 11:28:56,686 INFO  L131       PetriNetUnfolder]: For 18082/18251 co-relation queries the response was YES.
[2023-11-03 11:28:56,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62978 conditions, 19827 events. 11107/19827 cut-off events. For 18082/18251 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 151288 event pairs, 3140 based on Foata normal form. 8/18548 useless extension candidates. Maximal degree in co-relation 62962. Up to 13610 conditions per place. 
[2023-11-03 11:28:56,814 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 233 selfloop transitions, 132 changer transitions 0/385 dead transitions.
[2023-11-03 11:28:56,814 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 385 transitions, 2911 flow
[2023-11-03 11:28:56,815 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:28:56,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:28:56,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2023-11-03 11:28:56,817 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2023-11-03 11:28:56,817 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2023-11-03 11:28:56,817 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2023-11-03 11:28:56,817 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:28:56,817 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2023-11-03 11:28:56,819 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:56,821 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:56,821 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:56,821 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 779 transitions.
[2023-11-03 11:28:56,821 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 385 transitions, 2911 flow
[2023-11-03 11:28:56,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 385 transitions, 2911 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:56,857 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-11-03 11:28:56,857 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2023-11-03 11:28:56,858 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-11-03 11:28:56,858 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-11-03 11:28:56,858 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:56,858 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:56,858 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:56,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 11:28:56,859 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:28:56,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:56,859 INFO  L85        PathProgramCache]: Analyzing trace with hash -485975421, now seen corresponding path program 1 times
[2023-11-03 11:28:56,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:56,859 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904536486]
[2023-11-03 11:28:56,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:56,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:56,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:57,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:28:57,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:57,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904536486]
[2023-11-03 11:28:57,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904536486] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:28:57,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009788530]
[2023-11-03 11:28:57,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:57,164 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:28:57,165 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:28:57,167 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:28:57,168 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 11:28:57,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:57,273 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-11-03 11:28:57,277 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:28:57,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:28:57,472 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,474 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 11:28:57,530 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,531 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,533 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:28:57,585 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,587 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,588 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:28:57,665 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:28:57,666 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 11:28:57,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:28:57,705 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:28:57,740 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-11-03 11:28:57,780 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-11-03 11:28:57,816 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-11-03 11:28:57,958 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:28:57,958 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-11-03 11:28:57,968 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:28:57,968 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-11-03 11:28:57,972 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-11-03 11:28:57,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-11-03 11:28:58,000 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009788530] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:28:58,000 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:28:58,000 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-11-03 11:28:58,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337572377]
[2023-11-03 11:28:58,000 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:28:58,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-11-03 11:28:58,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:58,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-11-03 11:28:58,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=131, Unknown=10, NotChecked=84, Total=306
[2023-11-03 11:28:58,162 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 223
[2023-11-03 11:28:58,164 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:58,164 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:58,164 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 223
[2023-11-03 11:28:58,164 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:01,080 INFO  L130       PetriNetUnfolder]: 13643/23034 cut-off events.
[2023-11-03 11:29:01,080 INFO  L131       PetriNetUnfolder]: For 42400/42404 co-relation queries the response was YES.
[2023-11-03 11:29:01,133 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89032 conditions, 23034 events. 13643/23034 cut-off events. For 42400/42404 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 165617 event pairs, 5631 based on Foata normal form. 498/22055 useless extension candidates. Maximal degree in co-relation 89011. Up to 21318 conditions per place. 
[2023-11-03 11:29:01,207 INFO  L137   encePairwiseOnDemand]: 206/223 looper letters, 323 selfloop transitions, 7 changer transitions 11/350 dead transitions.
[2023-11-03 11:29:01,207 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 350 transitions, 3329 flow
[2023-11-03 11:29:01,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 11:29:01,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 11:29:01,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions.
[2023-11-03 11:29:01,210 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41832158872517616
[2023-11-03 11:29:01,210 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 653 transitions.
[2023-11-03 11:29:01,210 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions.
[2023-11-03 11:29:01,210 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:01,210 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions.
[2023-11-03 11:29:01,211 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:01,213 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:01,213 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:01,213 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 653 transitions.
[2023-11-03 11:29:01,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 350 transitions, 3329 flow
[2023-11-03 11:29:01,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 350 transitions, 3233 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-11-03 11:29:01,571 INFO  L231             Difference]: Finished difference. Result has 103 places, 303 transitions, 2290 flow
[2023-11-03 11:29:01,571 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2290, PETRI_PLACES=103, PETRI_TRANSITIONS=303}
[2023-11-03 11:29:01,572 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 36 predicate places.
[2023-11-03 11:29:01,572 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 303 transitions, 2290 flow
[2023-11-03 11:29:01,573 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:01,573 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:01,573 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:01,584 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 11:29:01,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-11-03 11:29:01,775 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:29:01,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:01,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -834187754, now seen corresponding path program 1 times
[2023-11-03 11:29:01,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:01,776 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579800411]
[2023-11-03 11:29:01,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:01,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:01,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:02,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:29:02,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:02,069 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579800411]
[2023-11-03 11:29:02,069 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579800411] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:29:02,069 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:29:02,069 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 11:29:02,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025809751]
[2023-11-03 11:29:02,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:29:02,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 11:29:02,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:02,070 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 11:29:02,070 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 11:29:02,363 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 223
[2023-11-03 11:29:02,364 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 303 transitions, 2290 flow. Second operand  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:02,364 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:02,364 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 223
[2023-11-03 11:29:02,364 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:05,546 INFO  L130       PetriNetUnfolder]: 13295/23434 cut-off events.
[2023-11-03 11:29:05,546 INFO  L131       PetriNetUnfolder]: For 42124/42205 co-relation queries the response was YES.
[2023-11-03 11:29:05,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92527 conditions, 23434 events. 13295/23434 cut-off events. For 42124/42205 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 181808 event pairs, 3483 based on Foata normal form. 350/23302 useless extension candidates. Maximal degree in co-relation 92501. Up to 11062 conditions per place. 
[2023-11-03 11:29:05,676 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 448 selfloop transitions, 166 changer transitions 1/632 dead transitions.
[2023-11-03 11:29:05,676 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 632 transitions, 5697 flow
[2023-11-03 11:29:05,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 11:29:05,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 11:29:05,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions.
[2023-11-03 11:29:05,679 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.547085201793722
[2023-11-03 11:29:05,679 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 976 transitions.
[2023-11-03 11:29:05,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 976 transitions.
[2023-11-03 11:29:05,679 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:05,679 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 976 transitions.
[2023-11-03 11:29:05,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:05,683 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:05,683 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:05,683 INFO  L175             Difference]: Start difference. First operand has 103 places, 303 transitions, 2290 flow. Second operand 8 states and 976 transitions.
[2023-11-03 11:29:05,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 632 transitions, 5697 flow
[2023-11-03 11:29:05,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 632 transitions, 5613 flow, removed 31 selfloop flow, removed 2 redundant places.
[2023-11-03 11:29:05,978 INFO  L231             Difference]: Finished difference. Result has 114 places, 420 transitions, 3916 flow
[2023-11-03 11:29:05,978 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=114, PETRI_TRANSITIONS=420}
[2023-11-03 11:29:05,978 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 47 predicate places.
[2023-11-03 11:29:05,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 420 transitions, 3916 flow
[2023-11-03 11:29:05,979 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:05,979 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:05,979 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:05,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 11:29:05,979 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:29:05,979 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:05,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 779781685, now seen corresponding path program 1 times
[2023-11-03 11:29:05,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:05,980 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547433089]
[2023-11-03 11:29:05,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:05,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:05,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:06,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 11:29:06,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:06,149 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547433089]
[2023-11-03 11:29:06,149 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547433089] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:29:06,149 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:29:06,150 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:29:06,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938953653]
[2023-11-03 11:29:06,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:29:06,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:29:06,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:06,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:29:06,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:29:06,286 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2023-11-03 11:29:06,287 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 420 transitions, 3916 flow. Second operand  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:06,287 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:06,287 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2023-11-03 11:29:06,287 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:10,635 INFO  L130       PetriNetUnfolder]: 17483/30558 cut-off events.
[2023-11-03 11:29:10,635 INFO  L131       PetriNetUnfolder]: For 117297/117885 co-relation queries the response was YES.
[2023-11-03 11:29:10,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141844 conditions, 30558 events. 17483/30558 cut-off events. For 117297/117885 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 244225 event pairs, 3898 based on Foata normal form. 68/28478 useless extension candidates. Maximal degree in co-relation 141812. Up to 23106 conditions per place. 
[2023-11-03 11:29:10,921 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 440 selfloop transitions, 164 changer transitions 1/622 dead transitions.
[2023-11-03 11:29:10,921 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 622 transitions, 6656 flow
[2023-11-03 11:29:10,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:29:10,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:29:10,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2023-11-03 11:29:10,924 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2023-11-03 11:29:10,924 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2023-11-03 11:29:10,924 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2023-11-03 11:29:10,925 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:10,925 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2023-11-03 11:29:10,926 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:10,928 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:10,928 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:10,928 INFO  L175             Difference]: Start difference. First operand has 114 places, 420 transitions, 3916 flow. Second operand 6 states and 779 transitions.
[2023-11-03 11:29:10,928 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 622 transitions, 6656 flow
[2023-11-03 11:29:11,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 622 transitions, 6618 flow, removed 19 selfloop flow, removed 0 redundant places.
[2023-11-03 11:29:11,452 INFO  L231             Difference]: Finished difference. Result has 123 places, 535 transitions, 5508 flow
[2023-11-03 11:29:11,453 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5508, PETRI_PLACES=123, PETRI_TRANSITIONS=535}
[2023-11-03 11:29:11,453 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 56 predicate places.
[2023-11-03 11:29:11,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 535 transitions, 5508 flow
[2023-11-03 11:29:11,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:11,454 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:11,454 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:11,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 11:29:11,454 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:29:11,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:11,455 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664645135, now seen corresponding path program 1 times
[2023-11-03 11:29:11,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:11,455 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253670779]
[2023-11-03 11:29:11,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:11,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:11,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:11,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:29:11,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:11,797 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253670779]
[2023-11-03 11:29:11,797 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253670779] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:29:11,797 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72400292]
[2023-11-03 11:29:11,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:11,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:29:11,797 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:29:11,799 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:29:11,801 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 11:29:11,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:11,922 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core
[2023-11-03 11:29:11,929 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:29:11,942 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118
[2023-11-03 11:29:12,034 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:29:12,034 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-03 11:29:12,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:29:12,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:29:12,095 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:29:12,110 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:29:12,111 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:29:12,130 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:29:12,130 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:29:12,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:29:12,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:29:12,165 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:29:12,165 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [72400292] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:29:12,165 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:29:12,165 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-11-03 11:29:12,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831689391]
[2023-11-03 11:29:12,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:29:12,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 11:29:12,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:12,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 11:29:12,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-11-03 11:29:12,554 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 223
[2023-11-03 11:29:12,555 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 535 transitions, 5508 flow. Second operand  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:12,555 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:12,555 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 223
[2023-11-03 11:29:12,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:19,087 INFO  L130       PetriNetUnfolder]: 25611/44258 cut-off events.
[2023-11-03 11:29:19,088 INFO  L131       PetriNetUnfolder]: For 222841/223413 co-relation queries the response was YES.
[2023-11-03 11:29:19,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 233478 conditions, 44258 events. 25611/44258 cut-off events. For 222841/223413 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 372009 event pairs, 3108 based on Foata normal form. 243/43813 useless extension candidates. Maximal degree in co-relation 233441. Up to 27629 conditions per place. 
[2023-11-03 11:29:19,517 INFO  L137   encePairwiseOnDemand]: 200/223 looper letters, 968 selfloop transitions, 231 changer transitions 3/1216 dead transitions.
[2023-11-03 11:29:19,517 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 1216 transitions, 14879 flow
[2023-11-03 11:29:19,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-03 11:29:19,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-03 11:29:19,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1171 transitions.
[2023-11-03 11:29:19,520 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4773746432939258
[2023-11-03 11:29:19,520 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1171 transitions.
[2023-11-03 11:29:19,520 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1171 transitions.
[2023-11-03 11:29:19,521 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:19,521 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1171 transitions.
[2023-11-03 11:29:19,523 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.45454545454545) internal successors, (1171), 11 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:19,525 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:19,525 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:19,526 INFO  L175             Difference]: Start difference. First operand has 123 places, 535 transitions, 5508 flow. Second operand 11 states and 1171 transitions.
[2023-11-03 11:29:19,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 1216 transitions, 14879 flow
[2023-11-03 11:29:22,653 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 1216 transitions, 14563 flow, removed 158 selfloop flow, removed 0 redundant places.
[2023-11-03 11:29:22,666 INFO  L231             Difference]: Finished difference. Result has 142 places, 776 transitions, 9317 flow
[2023-11-03 11:29:22,666 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=5318, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9317, PETRI_PLACES=142, PETRI_TRANSITIONS=776}
[2023-11-03 11:29:22,667 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 75 predicate places.
[2023-11-03 11:29:22,667 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 776 transitions, 9317 flow
[2023-11-03 11:29:22,667 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:22,667 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:22,667 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:22,675 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 11:29:22,868 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:29:22,869 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:29:22,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:22,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -1315530165, now seen corresponding path program 2 times
[2023-11-03 11:29:22,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:22,870 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971433329]
[2023-11-03 11:29:22,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:22,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:22,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:23,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:29:23,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:23,372 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971433329]
[2023-11-03 11:29:23,372 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971433329] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:29:23,372 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434521813]
[2023-11-03 11:29:23,372 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 11:29:23,372 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:29:23,372 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:29:23,373 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:29:23,375 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 11:29:23,533 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 11:29:23,533 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:29:23,535 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-11-03 11:29:23,541 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:29:23,550 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 11:29:23,550 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2023-11-03 11:29:23,644 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:29:23,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-11-03 11:29:23,690 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-03 11:29:23,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:29:23,781 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:29:23,823 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:29:23,824 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:29:23,881 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:29:23,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:29:23,932 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:29:23,974 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:29:23,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:29:23,989 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:29:23,989 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434521813] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:29:23,989 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:29:23,989 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2023-11-03 11:29:23,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844658135]
[2023-11-03 11:29:23,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:29:23,989 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-03 11:29:23,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:23,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-03 11:29:23,990 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306
[2023-11-03 11:29:24,422 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-11-03 11:29:24,423 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 776 transitions, 9317 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:24,423 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:24,423 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-11-03 11:29:24,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:34,422 INFO  L130       PetriNetUnfolder]: 29386/50627 cut-off events.
[2023-11-03 11:29:34,422 INFO  L131       PetriNetUnfolder]: For 353311/353968 co-relation queries the response was YES.
[2023-11-03 11:29:34,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292679 conditions, 50627 events. 29386/50627 cut-off events. For 353311/353968 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 431721 event pairs, 4048 based on Foata normal form. 477/50824 useless extension candidates. Maximal degree in co-relation 292632. Up to 18515 conditions per place. 
[2023-11-03 11:29:34,926 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 1087 selfloop transitions, 522 changer transitions 35/1658 dead transitions.
[2023-11-03 11:29:34,926 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1658 transitions, 23195 flow
[2023-11-03 11:29:34,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-03 11:29:34,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-03 11:29:34,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1180 transitions.
[2023-11-03 11:29:34,932 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48104362005707296
[2023-11-03 11:29:34,932 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1180 transitions.
[2023-11-03 11:29:34,933 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1180 transitions.
[2023-11-03 11:29:34,933 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:34,934 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1180 transitions.
[2023-11-03 11:29:34,936 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.27272727272727) internal successors, (1180), 11 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:34,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:34,941 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:34,941 INFO  L175             Difference]: Start difference. First operand has 142 places, 776 transitions, 9317 flow. Second operand 11 states and 1180 transitions.
[2023-11-03 11:29:34,941 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1658 transitions, 23195 flow
[2023-11-03 11:29:37,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 1658 transitions, 23153 flow, removed 21 selfloop flow, removed 0 redundant places.
[2023-11-03 11:29:38,010 INFO  L231             Difference]: Finished difference. Result has 159 places, 1061 transitions, 15637 flow
[2023-11-03 11:29:38,011 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=9275, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15637, PETRI_PLACES=159, PETRI_TRANSITIONS=1061}
[2023-11-03 11:29:38,011 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 92 predicate places.
[2023-11-03 11:29:38,011 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 1061 transitions, 15637 flow
[2023-11-03 11:29:38,012 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:38,012 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:38,012 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:38,020 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 11:29:38,212 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-11-03 11:29:38,213 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:29:38,213 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:38,213 INFO  L85        PathProgramCache]: Analyzing trace with hash -952832063, now seen corresponding path program 1 times
[2023-11-03 11:29:38,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:38,214 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625187464]
[2023-11-03 11:29:38,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:38,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:38,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:38,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:29:38,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:38,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625187464]
[2023-11-03 11:29:38,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625187464] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:29:38,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900795048]
[2023-11-03 11:29:38,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:38,558 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:29:38,558 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:29:38,559 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:29:38,561 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 11:29:38,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:38,663 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 11:29:38,666 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:29:38,680 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 11:29:38,681 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56
[2023-11-03 11:29:38,787 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:29:38,788 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-11-03 11:29:38,824 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-03 11:29:38,840 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:29:38,847 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:29:38,867 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:29:38,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:29:38,883 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:29:38,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:29:38,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:29:38,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:29:38,917 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:29:38,917 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900795048] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:29:38,917 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:29:38,917 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-11-03 11:29:38,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7293708]
[2023-11-03 11:29:38,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:29:38,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 11:29:38,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:38,918 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 11:29:38,918 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-11-03 11:29:39,550 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 223
[2023-11-03 11:29:39,551 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1061 transitions, 15637 flow. Second operand  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:39,551 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:39,551 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 223
[2023-11-03 11:29:39,551 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:50,082 INFO  L130       PetriNetUnfolder]: 25293/45566 cut-off events.
[2023-11-03 11:29:50,082 INFO  L131       PetriNetUnfolder]: For 466512/469194 co-relation queries the response was YES.
[2023-11-03 11:29:50,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290394 conditions, 45566 events. 25293/45566 cut-off events. For 466512/469194 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 407756 event pairs, 1755 based on Foata normal form. 1039/45816 useless extension candidates. Maximal degree in co-relation 290339. Up to 17989 conditions per place. 
[2023-11-03 11:29:50,606 INFO  L137   encePairwiseOnDemand]: 212/223 looper letters, 1629 selfloop transitions, 83 changer transitions 0/1876 dead transitions.
[2023-11-03 11:29:50,606 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1876 transitions, 31384 flow
[2023-11-03 11:29:50,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-03 11:29:50,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-03 11:29:50,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions.
[2023-11-03 11:29:50,609 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5366218236173393
[2023-11-03 11:29:50,609 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions.
[2023-11-03 11:29:50,609 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions.
[2023-11-03 11:29:50,610 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:50,610 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions.
[2023-11-03 11:29:50,611 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:50,613 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:50,614 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:50,614 INFO  L175             Difference]: Start difference. First operand has 159 places, 1061 transitions, 15637 flow. Second operand 9 states and 1077 transitions.
[2023-11-03 11:29:50,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1876 transitions, 31384 flow
[2023-11-03 11:29:55,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1876 transitions, 31144 flow, removed 114 selfloop flow, removed 3 redundant places.
[2023-11-03 11:29:55,043 INFO  L231             Difference]: Finished difference. Result has 160 places, 1060 transitions, 15663 flow
[2023-11-03 11:29:55,044 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15497, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15663, PETRI_PLACES=160, PETRI_TRANSITIONS=1060}
[2023-11-03 11:29:55,044 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 93 predicate places.
[2023-11-03 11:29:55,044 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 1060 transitions, 15663 flow
[2023-11-03 11:29:55,045 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:55,045 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:55,045 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:55,054 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 11:29:55,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:29:55,247 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:29:55,247 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:55,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473696100, now seen corresponding path program 1 times
[2023-11-03 11:29:55,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:55,248 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710424842]
[2023-11-03 11:29:55,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:55,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:55,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:55,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:29:55,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:55,323 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710424842]
[2023-11-03 11:29:55,323 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710424842] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:29:55,323 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943561103]
[2023-11-03 11:29:55,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:55,323 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:29:55,324 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:29:55,325 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:29:55,327 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-03 11:29:55,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:55,440 INFO  L263         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 11:29:55,442 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:29:55,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:29:55,483 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:29:55,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:29:55,524 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943561103] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:29:55,524 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:29:55,524 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 11:29:55,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071840380]
[2023-11-03 11:29:55,524 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:29:55,525 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 11:29:55,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:55,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 11:29:55,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 11:29:55,659 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2023-11-03 11:29:55,661 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 1060 transitions, 15663 flow. Second operand  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:55,661 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:55,661 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2023-11-03 11:29:55,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:30:01,718 INFO  L130       PetriNetUnfolder]: 15396/31719 cut-off events.
[2023-11-03 11:30:01,718 INFO  L131       PetriNetUnfolder]: For 305768/309415 co-relation queries the response was YES.
[2023-11-03 11:30:01,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193046 conditions, 31719 events. 15396/31719 cut-off events. For 305768/309415 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 305458 event pairs, 668 based on Foata normal form. 629/31810 useless extension candidates. Maximal degree in co-relation 192993. Up to 13355 conditions per place. 
[2023-11-03 11:30:02,044 INFO  L137   encePairwiseOnDemand]: 216/223 looper letters, 356 selfloop transitions, 7 changer transitions 31/1129 dead transitions.
[2023-11-03 11:30:02,044 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1129 transitions, 17228 flow
[2023-11-03 11:30:02,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 11:30:02,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 11:30:02,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions.
[2023-11-03 11:30:02,046 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667040358744395
[2023-11-03 11:30:02,046 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions.
[2023-11-03 11:30:02,046 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions.
[2023-11-03 11:30:02,047 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:30:02,047 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions.
[2023-11-03 11:30:02,049 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:02,050 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:02,050 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:02,050 INFO  L175             Difference]: Start difference. First operand has 160 places, 1060 transitions, 15663 flow. Second operand 8 states and 1011 transitions.
[2023-11-03 11:30:02,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1129 transitions, 17228 flow
[2023-11-03 11:30:03,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1129 transitions, 17054 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-11-03 11:30:03,995 INFO  L231             Difference]: Finished difference. Result has 163 places, 1017 transitions, 15096 flow
[2023-11-03 11:30:03,995 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15177, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15096, PETRI_PLACES=163, PETRI_TRANSITIONS=1017}
[2023-11-03 11:30:03,996 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-11-03 11:30:03,996 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 1017 transitions, 15096 flow
[2023-11-03 11:30:03,996 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:03,996 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:30:03,996 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:30:04,003 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-03 11:30:04,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-11-03 11:30:04,198 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:30:04,198 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:30:04,198 INFO  L85        PathProgramCache]: Analyzing trace with hash -985146553, now seen corresponding path program 3 times
[2023-11-03 11:30:04,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:30:04,199 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267504032]
[2023-11-03 11:30:04,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:30:04,199 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:30:04,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:30:04,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:30:04,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:30:04,640 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267504032]
[2023-11-03 11:30:04,640 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267504032] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:30:04,640 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779522261]
[2023-11-03 11:30:04,640 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 11:30:04,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:30:04,640 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:30:04,641 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:30:04,643 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-03 11:30:04,767 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 11:30:04,768 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:30:04,769 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core
[2023-11-03 11:30:04,774 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:30:04,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 11:30:04,895 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:30:04,896 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 11:30:04,931 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:30:04,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:30:04,983 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:30:05,023 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:30:05,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:30:05,080 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:30:05,120 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:30:05,145 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:30:05,145 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:30:05,192 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:05,208 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:05,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:05,293 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:05,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:30:05,307 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:30:05,307 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [779522261] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:30:05,308 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:30:05,308 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-11-03 11:30:05,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776230430]
[2023-11-03 11:30:05,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:30:05,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-03 11:30:05,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:30:05,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-03 11:30:05,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-11-03 11:30:05,918 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-11-03 11:30:05,919 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 1017 transitions, 15096 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:05,919 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:30:05,919 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-11-03 11:30:05,919 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:30:18,833 INFO  L130       PetriNetUnfolder]: 26004/45151 cut-off events.
[2023-11-03 11:30:18,834 INFO  L131       PetriNetUnfolder]: For 444696/445207 co-relation queries the response was YES.
[2023-11-03 11:30:19,148 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289287 conditions, 45151 events. 26004/45151 cut-off events. For 444696/445207 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 376100 event pairs, 3055 based on Foata normal form. 404/45231 useless extension candidates. Maximal degree in co-relation 289230. Up to 23580 conditions per place. 
[2023-11-03 11:30:19,337 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1030 selfloop transitions, 602 changer transitions 38/1682 dead transitions.
[2023-11-03 11:30:19,337 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1682 transitions, 26046 flow
[2023-11-03 11:30:19,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-11-03 11:30:19,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-11-03 11:30:19,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1660 transitions.
[2023-11-03 11:30:19,340 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4962630792227205
[2023-11-03 11:30:19,341 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1660 transitions.
[2023-11-03 11:30:19,341 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1660 transitions.
[2023-11-03 11:30:19,341 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:30:19,341 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1660 transitions.
[2023-11-03 11:30:19,343 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.66666666666667) internal successors, (1660), 15 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:19,345 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:19,346 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:19,346 INFO  L175             Difference]: Start difference. First operand has 163 places, 1017 transitions, 15096 flow. Second operand 15 states and 1660 transitions.
[2023-11-03 11:30:19,346 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 1682 transitions, 26046 flow
[2023-11-03 11:30:22,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1682 transitions, 25696 flow, removed 50 selfloop flow, removed 3 redundant places.
[2023-11-03 11:30:22,305 INFO  L231             Difference]: Finished difference. Result has 179 places, 1268 transitions, 20571 flow
[2023-11-03 11:30:22,306 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=14897, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20571, PETRI_PLACES=179, PETRI_TRANSITIONS=1268}
[2023-11-03 11:30:22,306 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 112 predicate places.
[2023-11-03 11:30:22,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 1268 transitions, 20571 flow
[2023-11-03 11:30:22,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:22,307 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:30:22,307 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:30:22,315 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-03 11:30:22,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:30:22,509 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:30:22,509 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:30:22,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 541897883, now seen corresponding path program 4 times
[2023-11-03 11:30:22,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:30:22,510 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733596451]
[2023-11-03 11:30:22,510 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:30:22,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:30:22,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:30:23,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:30:23,039 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:30:23,040 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733596451]
[2023-11-03 11:30:23,040 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733596451] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:30:23,040 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074358789]
[2023-11-03 11:30:23,040 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-03 11:30:23,040 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:30:23,041 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:30:23,042 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:30:23,043 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-03 11:30:23,303 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-03 11:30:23,303 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:30:23,305 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-11-03 11:30:23,320 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:30:23,329 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 11:30:23,435 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:30:23,435 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 11:30:23,488 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:30:23,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:30:23,539 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:30:23,578 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:30:23,620 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:30:23,620 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:30:23,669 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:30:23,669 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:30:23,733 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:23,755 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:23,784 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:23,809 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:23,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:23,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:30:23,869 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:30:23,869 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074358789] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:30:23,869 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:30:23,869 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-11-03 11:30:23,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047209545]
[2023-11-03 11:30:23,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:30:23,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-03 11:30:23,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:30:23,870 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-03 11:30:23,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2023-11-03 11:30:24,471 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-11-03 11:30:24,472 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1268 transitions, 20571 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:24,472 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:30:24,472 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-11-03 11:30:24,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:30:39,691 INFO  L130       PetriNetUnfolder]: 28505/49623 cut-off events.
[2023-11-03 11:30:39,691 INFO  L131       PetriNetUnfolder]: For 612494/613077 co-relation queries the response was YES.
[2023-11-03 11:30:40,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 345311 conditions, 49623 events. 28505/49623 cut-off events. For 612494/613077 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 419890 event pairs, 3217 based on Foata normal form. 356/49614 useless extension candidates. Maximal degree in co-relation 345249. Up to 23695 conditions per place. 
[2023-11-03 11:30:40,289 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1364 selfloop transitions, 532 changer transitions 35/1943 dead transitions.
[2023-11-03 11:30:40,290 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1943 transitions, 33856 flow
[2023-11-03 11:30:40,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-11-03 11:30:40,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-11-03 11:30:40,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions.
[2023-11-03 11:30:40,292 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48654708520179374
[2023-11-03 11:30:40,292 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions.
[2023-11-03 11:30:40,292 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions.
[2023-11-03 11:30:40,292 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:30:40,292 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions.
[2023-11-03 11:30:40,294 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:40,295 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:40,296 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:40,296 INFO  L175             Difference]: Start difference. First operand has 179 places, 1268 transitions, 20571 flow. Second operand 12 states and 1302 transitions.
[2023-11-03 11:30:40,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1943 transitions, 33856 flow
[2023-11-03 11:30:46,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1943 transitions, 33063 flow, removed 388 selfloop flow, removed 2 redundant places.
[2023-11-03 11:30:46,870 INFO  L231             Difference]: Finished difference. Result has 194 places, 1519 transitions, 26205 flow
[2023-11-03 11:30:46,871 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=19795, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26205, PETRI_PLACES=194, PETRI_TRANSITIONS=1519}
[2023-11-03 11:30:46,872 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 127 predicate places.
[2023-11-03 11:30:46,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 1519 transitions, 26205 flow
[2023-11-03 11:30:46,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:46,872 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:30:46,872 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:30:46,882 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-03 11:30:47,073 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:30:47,074 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:30:47,074 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:30:47,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331203745, now seen corresponding path program 5 times
[2023-11-03 11:30:47,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:30:47,075 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227672280]
[2023-11-03 11:30:47,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:30:47,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:30:47,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:30:47,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:30:47,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:30:47,523 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227672280]
[2023-11-03 11:30:47,524 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227672280] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:30:47,524 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956186080]
[2023-11-03 11:30:47,524 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-03 11:30:47,524 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:30:47,524 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:30:47,526 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:30:47,554 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-03 11:30:47,690 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 11:30:47,690 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:30:47,692 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-11-03 11:30:47,696 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:30:47,710 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:30:47,713 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-11-03 11:30:47,808 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:30:47,808 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-03 11:30:47,865 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:30:47,866 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:30:47,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:30:47,921 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:30:47,967 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:30:48,010 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:30:48,010 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:30:48,063 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:30:48,063 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:30:48,082 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:30:48,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:30:48,109 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:30:48,110 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:30:48,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:30:48,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:30:48,159 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:30:48,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:30:48,186 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:30:48,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:30:48,198 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:30:48,198 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956186080] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:30:48,198 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:30:48,198 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2023-11-03 11:30:48,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824339383]
[2023-11-03 11:30:48,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:30:48,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-03 11:30:48,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:30:48,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-03 11:30:48,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306
[2023-11-03 11:30:48,885 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2023-11-03 11:30:48,886 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1519 transitions, 26205 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:48,886 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:30:48,886 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2023-11-03 11:30:48,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:31:06,938 INFO  L130       PetriNetUnfolder]: 29302/51201 cut-off events.
[2023-11-03 11:31:06,938 INFO  L131       PetriNetUnfolder]: For 792739/793363 co-relation queries the response was YES.
[2023-11-03 11:31:07,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 380440 conditions, 51201 events. 29302/51201 cut-off events. For 792739/793363 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 436333 event pairs, 3287 based on Foata normal form. 454/51290 useless extension candidates. Maximal degree in co-relation 380372. Up to 26464 conditions per place. 
[2023-11-03 11:31:07,652 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1356 selfloop transitions, 638 changer transitions 30/2036 dead transitions.
[2023-11-03 11:31:07,653 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 2036 transitions, 37326 flow
[2023-11-03 11:31:07,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-03 11:31:07,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-03 11:31:07,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1419 transitions.
[2023-11-03 11:31:07,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4894791307347361
[2023-11-03 11:31:07,655 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1419 transitions.
[2023-11-03 11:31:07,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1419 transitions.
[2023-11-03 11:31:07,656 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:31:07,656 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1419 transitions.
[2023-11-03 11:31:07,657 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 109.15384615384616) internal successors, (1419), 13 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:07,659 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:07,660 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:07,660 INFO  L175             Difference]: Start difference. First operand has 194 places, 1519 transitions, 26205 flow. Second operand 13 states and 1419 transitions.
[2023-11-03 11:31:07,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 2036 transitions, 37326 flow
[2023-11-03 11:31:17,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 2036 transitions, 36322 flow, removed 433 selfloop flow, removed 5 redundant places.
[2023-11-03 11:31:17,605 INFO  L231             Difference]: Finished difference. Result has 206 places, 1644 transitions, 29953 flow
[2023-11-03 11:31:17,606 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=25312, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=29953, PETRI_PLACES=206, PETRI_TRANSITIONS=1644}
[2023-11-03 11:31:17,606 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 139 predicate places.
[2023-11-03 11:31:17,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 1644 transitions, 29953 flow
[2023-11-03 11:31:17,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:17,607 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:17,607 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-11-03 11:31:17,619 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2023-11-03 11:31:17,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-11-03 11:31:17,809 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:31:17,810 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:17,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -1301331673, now seen corresponding path program 1 times
[2023-11-03 11:31:17,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:17,810 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228383737]
[2023-11-03 11:31:17,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:17,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:17,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:31:17,837 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 11:31:17,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:31:17,851 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 11:31:17,851 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 11:31:17,851 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-11-03 11:31:17,852 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-11-03 11:31:17,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 11:31:17,853 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:31:17,853 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 11:31:17,853 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 11:31:17,868 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-03 11:31:17,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2023-11-03 11:31:17,899 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2023-11-03 11:31:17,899 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 11:31:17,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2023-11-03 11:31:17,899 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 158 transitions, 346 flow
[2023-11-03 11:31:17,901 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 346 flow
[2023-11-03 11:31:17,901 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:31:17,901 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 158 transitions, 346 flow
[2023-11-03 11:31:17,901 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 158 transitions, 346 flow
[2023-11-03 11:31:17,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2023-11-03 11:31:17,931 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2023-11-03 11:31:17,931 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 11:31:17,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2023-11-03 11:31:17,939 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9576
[2023-11-03 11:31:20,514 INFO  L134        LiptonReduction]: Checked pairs total: 53700
[2023-11-03 11:31:20,514 INFO  L136        LiptonReduction]: Total number of compositions: 94
[2023-11-03 11:31:20,516 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:31:20,516 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ad9fae7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:31:20,517 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-11-03 11:31:20,517 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 11:31:20,517 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:31:20,517 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:20,517 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 11:31:20,517 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:31:20,518 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:20,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times
[2023-11-03 11:31:20,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:20,518 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690785731]
[2023-11-03 11:31:20,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:20,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:20,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:20,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:31:20,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:31:20,523 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690785731]
[2023-11-03 11:31:20,523 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690785731] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:31:20,523 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:31:20,523 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 11:31:20,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114538057]
[2023-11-03 11:31:20,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:31:20,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 11:31:20,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:31:20,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 11:31:20,524 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 11:31:20,524 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 252
[2023-11-03 11:31:20,525 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:20,525 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:31:20,525 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 252
[2023-11-03 11:31:20,525 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:31:21,020 INFO  L130       PetriNetUnfolder]: 3248/7585 cut-off events.
[2023-11-03 11:31:21,020 INFO  L131       PetriNetUnfolder]: For 647/1494 co-relation queries the response was YES.
[2023-11-03 11:31:21,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12704 conditions, 7585 events. 3248/7585 cut-off events. For 647/1494 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 64204 event pairs, 3205 based on Foata normal form. 0/6863 useless extension candidates. Maximal degree in co-relation 10479. Up to 4887 conditions per place. 
[2023-11-03 11:31:21,045 INFO  L137   encePairwiseOnDemand]: 251/252 looper letters, 27 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-11-03 11:31:21,045 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 234 flow
[2023-11-03 11:31:21,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 11:31:21,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 11:31:21,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions.
[2023-11-03 11:31:21,047 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6468253968253969
[2023-11-03 11:31:21,047 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 326 transitions.
[2023-11-03 11:31:21,047 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 326 transitions.
[2023-11-03 11:31:21,047 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:31:21,047 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 326 transitions.
[2023-11-03 11:31:21,047 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:21,048 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:21,048 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:21,048 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 326 transitions.
[2023-11-03 11:31:21,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 234 flow
[2023-11-03 11:31:21,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:31:21,050 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-11-03 11:31:21,050 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2023-11-03 11:31:21,050 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-11-03 11:31:21,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-11-03 11:31:21,050 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:21,050 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:21,050 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:31:21,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-03 11:31:21,051 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:31:21,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:21,051 INFO  L85        PathProgramCache]: Analyzing trace with hash -164949161, now seen corresponding path program 1 times
[2023-11-03 11:31:21,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:21,051 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267957440]
[2023-11-03 11:31:21,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:21,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:21,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:21,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:31:21,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:31:21,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267957440]
[2023-11-03 11:31:21,138 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267957440] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:31:21,138 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:31:21,138 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:31:21,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540863891]
[2023-11-03 11:31:21,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:31:21,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:31:21,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:31:21,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:31:21,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:31:21,345 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 252
[2023-11-03 11:31:21,346 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:21,346 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:31:21,346 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 252
[2023-11-03 11:31:21,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:31:29,041 INFO  L130       PetriNetUnfolder]: 72405/116612 cut-off events.
[2023-11-03 11:31:29,042 INFO  L131       PetriNetUnfolder]: For 3734/4224 co-relation queries the response was YES.
[2023-11-03 11:31:29,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222409 conditions, 116612 events. 72405/116612 cut-off events. For 3734/4224 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 983482 event pairs, 18294 based on Foata normal form. 157/112065 useless extension candidates. Maximal degree in co-relation 222403. Up to 69950 conditions per place. 
[2023-11-03 11:31:29,592 INFO  L137   encePairwiseOnDemand]: 221/252 looper letters, 109 selfloop transitions, 64 changer transitions 0/195 dead transitions.
[2023-11-03 11:31:29,592 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 787 flow
[2023-11-03 11:31:29,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:31:29,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:31:29,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions.
[2023-11-03 11:31:29,594 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5767195767195767
[2023-11-03 11:31:29,594 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 872 transitions.
[2023-11-03 11:31:29,594 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 872 transitions.
[2023-11-03 11:31:29,594 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:31:29,595 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 872 transitions.
[2023-11-03 11:31:29,596 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:29,597 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:29,597 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:29,597 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 872 transitions.
[2023-11-03 11:31:29,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 787 flow
[2023-11-03 11:31:29,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 195 transitions, 787 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:31:29,605 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-11-03 11:31:29,605 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2023-11-03 11:31:29,605 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-11-03 11:31:29,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-11-03 11:31:29,606 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:29,606 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:29,606 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:31:29,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-03 11:31:29,606 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:31:29,606 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:29,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831077822, now seen corresponding path program 1 times
[2023-11-03 11:31:29,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:29,607 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127624034]
[2023-11-03 11:31:29,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:29,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:29,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:29,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:31:29,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:31:29,628 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127624034]
[2023-11-03 11:31:29,628 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127624034] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:31:29,628 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:31:29,628 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 11:31:29,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873443566]
[2023-11-03 11:31:29,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:31:29,629 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 11:31:29,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:31:29,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 11:31:29,629 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 11:31:29,647 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 252
[2023-11-03 11:31:29,647 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:29,647 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:31:29,647 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 252
[2023-11-03 11:31:29,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:31:30,445 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2023-11-03 11:31:30,445 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,446 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,446 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,446 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,446 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2023-11-03 11:31:30,446 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,446 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,446 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:31:30,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:31:32,698 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,698 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,699 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 139#L1017-1true, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,699 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,699 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,700 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,700 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,700 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,700 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,700 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,700 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:31:32,958 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,958 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,958 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,958 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,958 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,958 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,959 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,959 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,959 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,960 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 139#L1017-1true, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:32,960 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:32,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:31:33,191 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:33,191 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,191 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,191 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,191 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,192 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:33,192 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,193 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:33,193 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:31:33,403 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2023-11-03 11:31:33,403 INFO  L383   tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event
[2023-11-03 11:31:33,403 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 11:31:33,403 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 11:31:33,403 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 36#L1029-1true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2023-11-03 11:31:35,216 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 100#L1031true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2023-11-03 11:31:35,216 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:31:35,384 INFO  L130       PetriNetUnfolder]: 39413/75193 cut-off events.
[2023-11-03 11:31:35,385 INFO  L131       PetriNetUnfolder]: For 40753/48755 co-relation queries the response was YES.
[2023-11-03 11:31:35,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 180406 conditions, 75193 events. 39413/75193 cut-off events. For 40753/48755 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 755451 event pairs, 17234 based on Foata normal form. 1078/70433 useless extension candidates. Maximal degree in co-relation 180395. Up to 34821 conditions per place. 
[2023-11-03 11:31:35,959 INFO  L137   encePairwiseOnDemand]: 244/252 looper letters, 51 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-11-03 11:31:35,960 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 766 flow
[2023-11-03 11:31:35,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 11:31:35,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 11:31:35,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions.
[2023-11-03 11:31:35,961 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5992063492063492
[2023-11-03 11:31:35,962 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 453 transitions.
[2023-11-03 11:31:35,962 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions.
[2023-11-03 11:31:35,962 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:31:35,962 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions.
[2023-11-03 11:31:35,962 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:35,963 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:35,963 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:35,963 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 453 transitions.
[2023-11-03 11:31:35,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 766 flow
[2023-11-03 11:31:36,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 766 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:31:36,560 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-11-03 11:31:36,560 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2023-11-03 11:31:36,560 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-11-03 11:31:36,561 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-11-03 11:31:36,561 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:36,561 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:36,561 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:31:36,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-03 11:31:36,561 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:31:36,561 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:36,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -214994823, now seen corresponding path program 1 times
[2023-11-03 11:31:36,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:36,561 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115642580]
[2023-11-03 11:31:36,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:36,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:36,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:36,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:31:36,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:31:36,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115642580]
[2023-11-03 11:31:36,678 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115642580] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:31:36,678 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:31:36,678 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:31:36,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573510033]
[2023-11-03 11:31:36,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:31:36,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:31:36,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:31:36,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:31:36,679 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:31:36,952 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 252
[2023-11-03 11:31:36,952 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:36,952 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:31:36,952 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 252
[2023-11-03 11:31:36,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:31:46,502 INFO  L130       PetriNetUnfolder]: 77040/122336 cut-off events.
[2023-11-03 11:31:46,502 INFO  L131       PetriNetUnfolder]: For 92792/93950 co-relation queries the response was YES.
[2023-11-03 11:31:46,785 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 335803 conditions, 122336 events. 77040/122336 cut-off events. For 92792/93950 co-relation queries the response was YES. Maximal size of possible extension queue 2947. Compared 1014085 event pairs, 25862 based on Foata normal form. 0/116443 useless extension candidates. Maximal degree in co-relation 335791. Up to 86387 conditions per place. 
[2023-11-03 11:31:47,219 INFO  L137   encePairwiseOnDemand]: 233/252 looper letters, 146 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-11-03 11:31:47,220 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1803 flow
[2023-11-03 11:31:47,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:31:47,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:31:47,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions.
[2023-11-03 11:31:47,221 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58994708994709
[2023-11-03 11:31:47,222 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 892 transitions.
[2023-11-03 11:31:47,222 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions.
[2023-11-03 11:31:47,222 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:31:47,222 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions.
[2023-11-03 11:31:47,223 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:47,224 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:47,224 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:47,224 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 892 transitions.
[2023-11-03 11:31:47,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1803 flow
[2023-11-03 11:31:47,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1803 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:31:47,332 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-11-03 11:31:47,333 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2023-11-03 11:31:47,333 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-11-03 11:31:47,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-11-03 11:31:47,334 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:47,334 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:47,334 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:31:47,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-03 11:31:47,334 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:31:47,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:47,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 135492018, now seen corresponding path program 1 times
[2023-11-03 11:31:47,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:47,335 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473163510]
[2023-11-03 11:31:47,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:47,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:47,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:47,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:31:47,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:31:47,484 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473163510]
[2023-11-03 11:31:47,484 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473163510] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:31:47,484 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:31:47,485 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:31:47,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791280256]
[2023-11-03 11:31:47,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:31:47,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:31:47,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:31:47,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:31:47,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:31:47,735 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252
[2023-11-03 11:31:47,736 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:47,736 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:31:47,736 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252
[2023-11-03 11:31:47,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:32:10,650 INFO  L130       PetriNetUnfolder]: 162624/249129 cut-off events.
[2023-11-03 11:32:10,651 INFO  L131       PetriNetUnfolder]: For 278364/281003 co-relation queries the response was YES.
[2023-11-03 11:32:11,453 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 804273 conditions, 249129 events. 162624/249129 cut-off events. For 278364/281003 co-relation queries the response was YES. Maximal size of possible extension queue 5466. Compared 2101517 event pairs, 45865 based on Foata normal form. 0/234625 useless extension candidates. Maximal degree in co-relation 804256. Up to 163056 conditions per place. 
[2023-11-03 11:32:12,599 INFO  L137   encePairwiseOnDemand]: 222/252 looper letters, 328 selfloop transitions, 162 changer transitions 0/513 dead transitions.
[2023-11-03 11:32:12,599 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 513 transitions, 4050 flow
[2023-11-03 11:32:12,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:32:12,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:32:12,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 913 transitions.
[2023-11-03 11:32:12,601 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6038359788359788
[2023-11-03 11:32:12,601 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 913 transitions.
[2023-11-03 11:32:12,601 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 913 transitions.
[2023-11-03 11:32:12,601 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:32:12,602 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 913 transitions.
[2023-11-03 11:32:12,603 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:12,604 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:12,604 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:12,604 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 913 transitions.
[2023-11-03 11:32:12,604 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 513 transitions, 4050 flow
[2023-11-03 11:32:14,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 513 transitions, 4050 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:32:14,237 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-11-03 11:32:14,237 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2023-11-03 11:32:14,237 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-11-03 11:32:14,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-11-03 11:32:14,238 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:14,238 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:32:14,238 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:32:14,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-11-03 11:32:14,238 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:32:14,239 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:32:14,239 INFO  L85        PathProgramCache]: Analyzing trace with hash -728071784, now seen corresponding path program 1 times
[2023-11-03 11:32:14,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:32:14,239 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332711495]
[2023-11-03 11:32:14,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:32:14,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:32:14,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:32:14,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:32:14,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:32:14,442 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332711495]
[2023-11-03 11:32:14,442 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332711495] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:32:14,443 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703694428]
[2023-11-03 11:32:14,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:32:14,443 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:32:14,443 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:32:14,445 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:32:14,447 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-03 11:32:14,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:32:14,596 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-11-03 11:32:14,599 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:32:14,668 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:32:14,691 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 11:32:14,727 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,729 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:32:14,761 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:32:14,819 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:32:14,820 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 11:32:14,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:32:14,847 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:32:14,868 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-11-03 11:32:14,898 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2023-11-03 11:32:14,917 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-11-03 11:32:14,938 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-11-03 11:32:14,956 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:32:14,956 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-11-03 11:32:14,962 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:32:14,962 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-11-03 11:32:14,965 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-11-03 11:32:14,977 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:32:14,977 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 11:32:14,984 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:32:14,984 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 11:32:14,989 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:32:14,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 11:32:15,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2023-11-03 11:32:15,010 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703694428] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:32:15,010 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:32:15,011 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-11-03 11:32:15,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764335236]
[2023-11-03 11:32:15,011 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:32:15,011 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-11-03 11:32:15,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:32:15,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-11-03 11:32:15,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2023-11-03 11:32:15,056 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 252
[2023-11-03 11:32:15,058 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:15,058 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:32:15,058 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 252
[2023-11-03 11:32:15,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:32:54,957 INFO  L130       PetriNetUnfolder]: 262228/374403 cut-off events.
[2023-11-03 11:32:54,958 INFO  L131       PetriNetUnfolder]: For 829035/829091 co-relation queries the response was YES.
[2023-11-03 11:32:56,326 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1442117 conditions, 374403 events. 262228/374403 cut-off events. For 829035/829091 co-relation queries the response was YES. Maximal size of possible extension queue 6768. Compared 2851851 event pairs, 128518 based on Foata normal form. 6294/351963 useless extension candidates. Maximal degree in co-relation 1442095. Up to 356440 conditions per place. 
[2023-11-03 11:32:57,933 INFO  L137   encePairwiseOnDemand]: 235/252 looper letters, 436 selfloop transitions, 7 changer transitions 11/463 dead transitions.
[2023-11-03 11:32:57,933 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 463 transitions, 4540 flow
[2023-11-03 11:32:57,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 11:32:57,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 11:32:57,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 757 transitions.
[2023-11-03 11:32:57,935 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.42913832199546487
[2023-11-03 11:32:57,935 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 757 transitions.
[2023-11-03 11:32:57,935 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 757 transitions.
[2023-11-03 11:32:57,936 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:32:57,936 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 757 transitions.
[2023-11-03 11:32:57,937 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:57,938 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:57,938 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:32:57,938 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 757 transitions.
[2023-11-03 11:32:57,938 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 463 transitions, 4540 flow
[2023-11-03 11:33:30,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 463 transitions, 4444 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-11-03 11:33:30,052 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2023-11-03 11:33:30,052 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3125, PETRI_PLACES=115, PETRI_TRANSITIONS=396}
[2023-11-03 11:33:30,052 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2023-11-03 11:33:30,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2023-11-03 11:33:30,053 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:33:30,053 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:33:30,053 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:33:30,060 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2023-11-03 11:33:30,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2023-11-03 11:33:30,255 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:33:30,255 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:33:30,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 1193830377, now seen corresponding path program 1 times
[2023-11-03 11:33:30,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:33:30,256 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011228760]
[2023-11-03 11:33:30,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:33:30,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:33:30,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:33:30,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:33:30,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:33:30,466 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011228760]
[2023-11-03 11:33:30,466 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011228760] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:33:30,467 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:33:30,467 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 11:33:30,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818817443]
[2023-11-03 11:33:30,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:33:30,467 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 11:33:30,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:33:30,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 11:33:30,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 11:33:30,801 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252
[2023-11-03 11:33:30,802 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:33:30,802 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:33:30,802 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252
[2023-11-03 11:33:30,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:34:08,373 INFO  L130       PetriNetUnfolder]: 222065/335664 cut-off events.
[2023-11-03 11:34:08,374 INFO  L131       PetriNetUnfolder]: For 726711/727955 co-relation queries the response was YES.
[2023-11-03 11:34:09,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1327528 conditions, 335664 events. 222065/335664 cut-off events. For 726711/727955 co-relation queries the response was YES. Maximal size of possible extension queue 8010. Compared 2871299 event pairs, 57849 based on Foata normal form. 3082/332170 useless extension candidates. Maximal degree in co-relation 1327501. Up to 154534 conditions per place. 
[2023-11-03 11:34:11,333 INFO  L137   encePairwiseOnDemand]: 232/252 looper letters, 587 selfloop transitions, 254 changer transitions 0/861 dead transitions.
[2023-11-03 11:34:11,334 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 861 transitions, 7973 flow
[2023-11-03 11:34:11,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 11:34:11,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 11:34:11,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1153 transitions.
[2023-11-03 11:34:11,336 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5719246031746031
[2023-11-03 11:34:11,336 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1153 transitions.
[2023-11-03 11:34:11,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1153 transitions.
[2023-11-03 11:34:11,337 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:34:11,337 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1153 transitions.
[2023-11-03 11:34:11,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 144.125) internal successors, (1153), 8 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:34:11,340 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:34:11,340 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 252.0) internal successors, (2268), 9 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:34:11,340 INFO  L175             Difference]: Start difference. First operand has 115 places, 396 transitions, 3125 flow. Second operand 8 states and 1153 transitions.
[2023-11-03 11:34:11,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 861 transitions, 7973 flow
[2023-11-03 11:34:49,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 861 transitions, 7889 flow, removed 31 selfloop flow, removed 2 redundant places.
[2023-11-03 11:34:49,255 INFO  L231             Difference]: Finished difference. Result has 126 places, 588 transitions, 5772 flow
[2023-11-03 11:34:49,255 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5772, PETRI_PLACES=126, PETRI_TRANSITIONS=588}
[2023-11-03 11:34:49,255 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 46 predicate places.
[2023-11-03 11:34:49,256 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 588 transitions, 5772 flow
[2023-11-03 11:34:49,256 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:34:49,256 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:34:49,256 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:34:49,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-11-03 11:34:49,256 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:34:49,257 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:34:49,257 INFO  L85        PathProgramCache]: Analyzing trace with hash 626509173, now seen corresponding path program 1 times
[2023-11-03 11:34:49,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:34:49,257 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121515685]
[2023-11-03 11:34:49,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:34:49,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:34:49,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:34:49,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 11:34:49,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:34:49,414 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121515685]
[2023-11-03 11:34:49,414 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121515685] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:34:49,414 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:34:49,414 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:34:49,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299945373]
[2023-11-03 11:34:49,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:34:49,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:34:49,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:34:49,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:34:49,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:34:49,608 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252
[2023-11-03 11:34:49,609 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 588 transitions, 5772 flow. Second operand  has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:34:49,610 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:34:49,610 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252
[2023-11-03 11:34:49,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:35:50,141 INFO  L130       PetriNetUnfolder]: 300033/455155 cut-off events.
[2023-11-03 11:35:50,142 INFO  L131       PetriNetUnfolder]: For 2000728/2012929 co-relation queries the response was YES.
[2023-11-03 11:35:52,865 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2118946 conditions, 455155 events. 300033/455155 cut-off events. For 2000728/2012929 co-relation queries the response was YES. Maximal size of possible extension queue 10488. Compared 4048517 event pairs, 82033 based on Foata normal form. 885/425367 useless extension candidates. Maximal degree in co-relation 2118913. Up to 343288 conditions per place. 
[2023-11-03 11:35:55,245 INFO  L137   encePairwiseOnDemand]: 222/252 looper letters, 641 selfloop transitions, 213 changer transitions 0/874 dead transitions.
[2023-11-03 11:35:55,245 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 874 transitions, 9810 flow
[2023-11-03 11:35:55,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:35:55,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:35:55,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions.
[2023-11-03 11:35:55,247 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6011904761904762
[2023-11-03 11:35:55,247 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 909 transitions.
[2023-11-03 11:35:55,247 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions.
[2023-11-03 11:35:55,247 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:35:55,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions.
[2023-11-03 11:35:55,249 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:35:55,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:35:55,250 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:35:55,250 INFO  L175             Difference]: Start difference. First operand has 126 places, 588 transitions, 5772 flow. Second operand 6 states and 909 transitions.
[2023-11-03 11:35:55,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 874 transitions, 9810 flow
[2023-11-03 11:36:31,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 874 transitions, 9734 flow, removed 38 selfloop flow, removed 0 redundant places.
[2023-11-03 11:36:31,991 INFO  L231             Difference]: Finished difference. Result has 135 places, 756 transitions, 8072 flow
[2023-11-03 11:36:31,991 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=5696, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8072, PETRI_PLACES=135, PETRI_TRANSITIONS=756}
[2023-11-03 11:36:31,991 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 55 predicate places.
[2023-11-03 11:36:31,992 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 756 transitions, 8072 flow
[2023-11-03 11:36:31,992 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:36:31,992 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:36:31,992 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:36:31,992 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2023-11-03 11:36:31,992 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:36:31,993 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:36:31,993 INFO  L85        PathProgramCache]: Analyzing trace with hash -17651420, now seen corresponding path program 1 times
[2023-11-03 11:36:31,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:36:31,993 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312209802]
[2023-11-03 11:36:31,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:36:31,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:36:32,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:36:32,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:36:32,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:36:32,294 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312209802]
[2023-11-03 11:36:32,294 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312209802] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:36:32,294 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418077721]
[2023-11-03 11:36:32,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:36:32,294 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:36:32,295 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:36:32,296 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:36:32,302 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-03 11:36:32,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:36:32,442 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core
[2023-11-03 11:36:32,445 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:36:32,453 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58
[2023-11-03 11:36:32,532 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:36:32,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-03 11:36:32,552 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:36:32,569 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:36:32,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:36:32,606 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:36:32,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:36:32,621 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:36:32,622 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:36:32,639 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:36:32,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:36:32,648 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:36:32,648 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418077721] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:36:32,648 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:36:32,648 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2023-11-03 11:36:32,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583873705]
[2023-11-03 11:36:32,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:36:32,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 11:36:32,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:36:32,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 11:36:32,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2023-11-03 11:36:33,170 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 252
[2023-11-03 11:36:33,171 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 756 transitions, 8072 flow. Second operand  has 10 states, 10 states have (on average 104.4) internal successors, (1044), 10 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:36:33,171 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:36:33,171 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 252
[2023-11-03 11:36:33,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:38:32,048 INFO  L130       PetriNetUnfolder]: 506350/750950 cut-off events.
[2023-11-03 11:38:32,049 INFO  L131       PetriNetUnfolder]: For 4305445/4311944 co-relation queries the response was YES.
[2023-11-03 11:38:36,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3895849 conditions, 750950 events. 506350/750950 cut-off events. For 4305445/4311944 co-relation queries the response was YES. Maximal size of possible extension queue 16794. Compared 6790735 event pairs, 86187 based on Foata normal form. 2077/736748 useless extension candidates. Maximal degree in co-relation 3895811. Up to 500650 conditions per place. 
[2023-11-03 11:38:40,617 INFO  L137   encePairwiseOnDemand]: 224/252 looper letters, 1431 selfloop transitions, 381 changer transitions 0/1827 dead transitions.
[2023-11-03 11:38:40,617 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1827 transitions, 22818 flow
[2023-11-03 11:38:40,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-03 11:38:40,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-03 11:38:40,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1405 transitions.
[2023-11-03 11:38:40,620 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5068542568542569
[2023-11-03 11:38:40,620 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1405 transitions.
[2023-11-03 11:38:40,620 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1405 transitions.
[2023-11-03 11:38:40,620 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:38:40,620 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1405 transitions.
[2023-11-03 11:38:40,622 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 127.72727272727273) internal successors, (1405), 11 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:38:40,624 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:38:40,624 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 252.0) internal successors, (3024), 12 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:38:40,624 INFO  L175             Difference]: Start difference. First operand has 135 places, 756 transitions, 8072 flow. Second operand 11 states and 1405 transitions.
[2023-11-03 11:38:40,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 1827 transitions, 22818 flow
Killed by 15
