./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! data-race) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:45:24,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:45:24,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:45:24,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:45:24,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:45:24,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:45:24,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:45:24,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:45:24,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:45:24,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:45:24,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:45:24,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:45:24,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:45:24,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:45:24,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:45:24,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:45:24,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:45:24,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:45:24,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:45:24,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:45:24,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:45:24,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:45:24,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:45:24,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2024-11-07 15:45:24,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:45:24,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:45:24,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:45:24,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:45:24,376 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:45:24,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-11-07 15:45:25,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:45:25,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:45:25,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2024-11-07 15:45:25,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d79ffaa4e/a12463fd3a344cd497b05284cccaf070/FLAG865fc11ca [2024-11-07 15:45:26,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d79ffaa4e/a12463fd3a344cd497b05284cccaf070 [2024-11-07 15:45:26,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:45:26,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:45:26,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:45:26,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:45:26,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:45:26,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3247b408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26, skipping insertion in model container [2024-11-07 15:45:26,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:45:26,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:45:26,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:45:26,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:45:26,577 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:45:26,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26 WrapperNode [2024-11-07 15:45:26,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:45:26,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:45:26,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:45:26,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:45:26,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,630 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 348 [2024-11-07 15:45:26,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:45:26,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:45:26,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:45:26,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:45:26,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:45:26,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:45:26,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:45:26,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:45:26,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (1/1) ... [2024-11-07 15:45:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:45:26,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:45:26,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:45:26,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:45:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:45:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:45:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:45:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:45:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:45:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 15:45:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 15:45:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:45:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:45:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 15:45:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 15:45:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:45:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:45:26,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:45:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:45:26,762 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:45:26,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:45:26,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:45:27,485 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:45:27,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:45:27,670 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:45:27,670 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-07 15:45:27,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:27 BoogieIcfgContainer [2024-11-07 15:45:27,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:45:27,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:45:27,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:45:27,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:45:27,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:45:26" (1/3) ... [2024-11-07 15:45:27,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb94e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:45:27, skipping insertion in model container [2024-11-07 15:45:27,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:45:26" (2/3) ... [2024-11-07 15:45:27,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb94e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:45:27, skipping insertion in model container [2024-11-07 15:45:27,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:45:27" (3/3) ... [2024-11-07 15:45:27,677 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2024-11-07 15:45:27,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:45:27,688 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-11-07 15:45:27,688 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:45:27,777 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:45:27,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 510 transitions, 1041 flow [2024-11-07 15:45:27,953 INFO L124 PetriNetUnfolderBase]: 27/507 cut-off events. [2024-11-07 15:45:27,954 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:45:27,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 507 events. 27/507 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 632 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 428. Up to 2 conditions per place. [2024-11-07 15:45:27,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 510 transitions, 1041 flow [2024-11-07 15:45:27,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 463 transitions, 944 flow [2024-11-07 15:45:27,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:45:27,977 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@68b9199f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:45:27,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2024-11-07 15:45:27,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:45:27,981 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-07 15:45:27,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:45:27,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:27,981 INFO L204 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] [2024-11-07 15:45:27,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:27,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 64313588, now seen corresponding path program 1 times [2024-11-07 15:45:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:27,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603336457] [2024-11-07 15:45:27,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603336457] [2024-11-07 15:45:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603336457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:28,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:28,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424822278] [2024-11-07 15:45:28,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:28,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:28,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:28,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 510 [2024-11-07 15:45:28,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 463 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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) [2024-11-07 15:45:28,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:28,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 510 [2024-11-07 15:45:28,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:28,415 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2024-11-07 15:45:28,415 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 15:45:28,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6484 event pairs, 51 based on Foata normal form. 12/1018 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2024-11-07 15:45:28,424 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2024-11-07 15:45:28,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2024-11-07 15:45:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2024-11-07 15:45:28,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9235294117647059 [2024-11-07 15:45:28,438 INFO L175 Difference]: Start difference. First operand has 449 places, 463 transitions, 944 flow. Second operand 3 states and 1413 transitions. [2024-11-07 15:45:28,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2024-11-07 15:45:28,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 15:45:28,449 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2024-11-07 15:45:28,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-11-07 15:45:28,453 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2024-11-07 15:45:28,453 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2024-11-07 15:45:28,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 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) [2024-11-07 15:45:28,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:28,454 INFO L204 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, 1] [2024-11-07 15:45:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:45:28,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash -123107398, now seen corresponding path program 1 times [2024-11-07 15:45:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484265414] [2024-11-07 15:45:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:28,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484265414] [2024-11-07 15:45:28,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484265414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:28,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:28,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473276642] [2024-11-07 15:45:28,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:28,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:28,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:28,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:28,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-07 15:45:28,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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) [2024-11-07 15:45:28,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:28,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-07 15:45:28,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:28,680 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2024-11-07 15:45:28,680 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-07 15:45:28,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6518 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2024-11-07 15:45:28,687 INFO L140 encePairwiseOnDemand]: 502/510 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2024-11-07 15:45:28,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2024-11-07 15:45:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2024-11-07 15:45:28,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8947712418300654 [2024-11-07 15:45:28,689 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2024-11-07 15:45:28,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2024-11-07 15:45:28,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:28,695 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2024-11-07 15:45:28,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2024-11-07 15:45:28,696 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2024-11-07 15:45:28,696 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2024-11-07 15:45:28,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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) [2024-11-07 15:45:28,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:28,697 INFO L204 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:28,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:45:28,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:28,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 573243807, now seen corresponding path program 1 times [2024-11-07 15:45:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074972583] [2024-11-07 15:45:28,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074972583] [2024-11-07 15:45:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074972583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:29,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:29,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583486318] [2024-11-07 15:45:29,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:29,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:29,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 510 [2024-11-07 15:45:29,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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) [2024-11-07 15:45:29,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:29,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 510 [2024-11-07 15:45:29,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:29,774 INFO L124 PetriNetUnfolderBase]: 236/1331 cut-off events. [2024-11-07 15:45:29,775 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 15:45:29,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 1331 events. 236/1331 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7716 event pairs, 188 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1775. Up to 406 conditions per place. [2024-11-07 15:45:29,782 INFO L140 encePairwiseOnDemand]: 492/510 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2024-11-07 15:45:29,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2024-11-07 15:45:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2024-11-07 15:45:29,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7996732026143791 [2024-11-07 15:45:29,786 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2024-11-07 15:45:29,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2024-11-07 15:45:29,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:29,791 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2024-11-07 15:45:29,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2024-11-07 15:45:29,792 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2024-11-07 15:45:29,792 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2024-11-07 15:45:29,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 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) [2024-11-07 15:45:29,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:29,794 INFO L204 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:29,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:45:29,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1149357642, now seen corresponding path program 1 times [2024-11-07 15:45:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672530192] [2024-11-07 15:45:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672530192] [2024-11-07 15:45:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672530192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241682315] [2024-11-07 15:45:29,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:29,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:29,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-11-07 15:45:29,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-11-07 15:45:29,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:29,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-11-07 15:45:29,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:29,954 INFO L124 PetriNetUnfolderBase]: 55/587 cut-off events. [2024-11-07 15:45:29,954 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:45:29,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 587 events. 55/587 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1808 event pairs, 34 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 661. Up to 77 conditions per place. [2024-11-07 15:45:29,956 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-07 15:45:29,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2024-11-07 15:45:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-11-07 15:45:29,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-07 15:45:29,959 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2024-11-07 15:45:29,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2024-11-07 15:45:29,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:45:29,963 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2024-11-07 15:45:29,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2024-11-07 15:45:29,965 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2024-11-07 15:45:29,965 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2024-11-07 15:45:29,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-11-07 15:45:29,966 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:29,966 INFO L204 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:29,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:45:29,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:29,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1852644211, now seen corresponding path program 1 times [2024-11-07 15:45:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:29,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975144068] [2024-11-07 15:45:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:29,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975144068] [2024-11-07 15:45:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975144068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:30,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:30,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276298657] [2024-11-07 15:45:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:30,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:30,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 510 [2024-11-07 15:45:30,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-11-07 15:45:30,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:30,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 510 [2024-11-07 15:45:30,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:30,109 INFO L124 PetriNetUnfolderBase]: 55/586 cut-off events. [2024-11-07 15:45:30,109 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:45:30,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 586 events. 55/586 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1712 event pairs, 34 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 647. Up to 77 conditions per place. [2024-11-07 15:45:30,112 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2024-11-07 15:45:30,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2024-11-07 15:45:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2024-11-07 15:45:30,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-07 15:45:30,114 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2024-11-07 15:45:30,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2024-11-07 15:45:30,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:30,119 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2024-11-07 15:45:30,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-11-07 15:45:30,120 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2024-11-07 15:45:30,120 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2024-11-07 15:45:30,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 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) [2024-11-07 15:45:30,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:30,121 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:30,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:45:30,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:30,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1332480732, now seen corresponding path program 1 times [2024-11-07 15:45:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268160152] [2024-11-07 15:45:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268160152] [2024-11-07 15:45:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268160152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877242501] [2024-11-07 15:45:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:30,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:30,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:30,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-11-07 15:45:30,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-11-07 15:45:30,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:30,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-11-07 15:45:30,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:30,244 INFO L124 PetriNetUnfolderBase]: 23/449 cut-off events. [2024-11-07 15:45:30,244 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:45:30,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 449 events. 23/449 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 757 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 462. Up to 35 conditions per place. [2024-11-07 15:45:30,246 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2024-11-07 15:45:30,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2024-11-07 15:45:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-07 15:45:30,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-07 15:45:30,251 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2024-11-07 15:45:30,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2024-11-07 15:45:30,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:30,255 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2024-11-07 15:45:30,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2024-11-07 15:45:30,256 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-11-07 15:45:30,256 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2024-11-07 15:45:30,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-11-07 15:45:30,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:30,257 INFO L204 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, 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, 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, 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, 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, 1] [2024-11-07 15:45:30,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:45:30,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:30,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1889059969, now seen corresponding path program 1 times [2024-11-07 15:45:30,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:30,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852807548] [2024-11-07 15:45:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852807548] [2024-11-07 15:45:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852807548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:30,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107835845] [2024-11-07 15:45:30,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:30,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 510 [2024-11-07 15:45:30,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-11-07 15:45:30,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:30,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 510 [2024-11-07 15:45:30,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:30,372 INFO L124 PetriNetUnfolderBase]: 23/448 cut-off events. [2024-11-07 15:45:30,373 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:45:30,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 448 events. 23/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 759 event pairs, 12 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 461. Up to 35 conditions per place. [2024-11-07 15:45:30,375 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-11-07 15:45:30,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2024-11-07 15:45:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-07 15:45:30,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-07 15:45:30,378 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2024-11-07 15:45:30,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2024-11-07 15:45:30,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:30,382 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2024-11-07 15:45:30,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2024-11-07 15:45:30,383 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-11-07 15:45:30,383 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2024-11-07 15:45:30,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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) [2024-11-07 15:45:30,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:30,384 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1] [2024-11-07 15:45:30,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:45:30,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash 30063585, now seen corresponding path program 1 times [2024-11-07 15:45:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:30,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631418126] [2024-11-07 15:45:30,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631418126] [2024-11-07 15:45:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631418126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:30,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:30,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:30,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929228471] [2024-11-07 15:45:30,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:30,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:30,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-11-07 15:45:30,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-11-07 15:45:30,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:30,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-11-07 15:45:30,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:30,542 INFO L124 PetriNetUnfolderBase]: 109/1164 cut-off events. [2024-11-07 15:45:30,542 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-11-07 15:45:30,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1164 events. 109/1164 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5661 event pairs, 56 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 1290. Up to 135 conditions per place. [2024-11-07 15:45:30,547 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2024-11-07 15:45:30,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2024-11-07 15:45:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-11-07 15:45:30,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-11-07 15:45:30,550 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2024-11-07 15:45:30,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2024-11-07 15:45:30,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:30,554 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2024-11-07 15:45:30,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2024-11-07 15:45:30,555 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-11-07 15:45:30,555 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2024-11-07 15:45:30,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-11-07 15:45:30,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:30,556 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:30,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:45:30,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:30,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 360475418, now seen corresponding path program 1 times [2024-11-07 15:45:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540018772] [2024-11-07 15:45:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540018772] [2024-11-07 15:45:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540018772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:31,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:31,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436350998] [2024-11-07 15:45:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:31,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:31,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:31,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:31,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-11-07 15:45:31,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-11-07 15:45:31,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:31,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-11-07 15:45:31,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:31,634 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2024-11-07 15:45:31,634 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-07 15:45:31,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1132 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2024-11-07 15:45:31,637 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2024-11-07 15:45:31,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2024-11-07 15:45:31,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-11-07 15:45:31,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-11-07 15:45:31,642 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2024-11-07 15:45:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2024-11-07 15:45:31,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:31,648 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2024-11-07 15:45:31,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2024-11-07 15:45:31,650 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2024-11-07 15:45:31,650 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2024-11-07 15:45:31,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-11-07 15:45:31,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:31,651 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:31,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:45:31,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -555120169, now seen corresponding path program 1 times [2024-11-07 15:45:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735976772] [2024-11-07 15:45:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:31,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735976772] [2024-11-07 15:45:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735976772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:31,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327972704] [2024-11-07 15:45:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:31,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:31,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-11-07 15:45:31,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-11-07 15:45:31,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:31,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-11-07 15:45:31,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:31,894 INFO L124 PetriNetUnfolderBase]: 69/627 cut-off events. [2024-11-07 15:45:31,895 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-07 15:45:31,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 627 events. 69/627 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1973 event pairs, 36 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 757. Up to 98 conditions per place. [2024-11-07 15:45:31,897 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-11-07 15:45:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2024-11-07 15:45:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-11-07 15:45:31,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-11-07 15:45:31,900 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2024-11-07 15:45:31,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2024-11-07 15:45:31,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 15:45:31,904 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2024-11-07 15:45:31,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2024-11-07 15:45:31,906 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2024-11-07 15:45:31,906 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2024-11-07 15:45:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-11-07 15:45:31,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:31,907 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:45:31,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -620784319, now seen corresponding path program 1 times [2024-11-07 15:45:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287661813] [2024-11-07 15:45:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:31,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287661813] [2024-11-07 15:45:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287661813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124279774] [2024-11-07 15:45:31,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:31,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:31,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 510 [2024-11-07 15:45:31,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-11-07 15:45:31,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:31,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 510 [2024-11-07 15:45:31,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:32,107 INFO L124 PetriNetUnfolderBase]: 125/1187 cut-off events. [2024-11-07 15:45:32,108 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 15:45:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1187 events. 125/1187 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5853 event pairs, 58 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1384. Up to 158 conditions per place. [2024-11-07 15:45:32,114 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2024-11-07 15:45:32,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2024-11-07 15:45:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-11-07 15:45:32,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065359477124183 [2024-11-07 15:45:32,117 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2024-11-07 15:45:32,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2024-11-07 15:45:32,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:32,122 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2024-11-07 15:45:32,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2024-11-07 15:45:32,126 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2024-11-07 15:45:32,126 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2024-11-07 15:45:32,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 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) [2024-11-07 15:45:32,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:32,126 INFO L204 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:32,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:45:32,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:32,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1135693127, now seen corresponding path program 1 times [2024-11-07 15:45:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526029981] [2024-11-07 15:45:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526029981] [2024-11-07 15:45:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526029981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728342038] [2024-11-07 15:45:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:32,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:32,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:32,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:32,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 510 [2024-11-07 15:45:32,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-11-07 15:45:32,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:32,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 510 [2024-11-07 15:45:32,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:33,118 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2024-11-07 15:45:33,118 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-07 15:45:33,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1107 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-11-07 15:45:33,121 INFO L140 encePairwiseOnDemand]: 503/510 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2024-11-07 15:45:33,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2024-11-07 15:45:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2024-11-07 15:45:33,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8803921568627451 [2024-11-07 15:45:33,125 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2024-11-07 15:45:33,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2024-11-07 15:45:33,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:33,129 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2024-11-07 15:45:33,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2024-11-07 15:45:33,130 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2024-11-07 15:45:33,130 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2024-11-07 15:45:33,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 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) [2024-11-07 15:45:33,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:33,131 INFO L204 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, 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, 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, 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, 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, 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] [2024-11-07 15:45:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:45:33,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:33,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1178971585, now seen corresponding path program 1 times [2024-11-07 15:45:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299847223] [2024-11-07 15:45:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:33,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299847223] [2024-11-07 15:45:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299847223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:33,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:33,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272760108] [2024-11-07 15:45:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:33,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:33,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:33,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:33,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 510 [2024-11-07 15:45:33,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-11-07 15:45:33,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:33,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 510 [2024-11-07 15:45:33,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:33,260 INFO L124 PetriNetUnfolderBase]: 69/620 cut-off events. [2024-11-07 15:45:33,260 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-11-07 15:45:33,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 620 events. 69/620 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1912 event pairs, 36 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 752. Up to 98 conditions per place. [2024-11-07 15:45:33,263 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-07 15:45:33,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2024-11-07 15:45:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-11-07 15:45:33,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098039215686274 [2024-11-07 15:45:33,266 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2024-11-07 15:45:33,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2024-11-07 15:45:33,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:45:33,270 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2024-11-07 15:45:33,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2024-11-07 15:45:33,271 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2024-11-07 15:45:33,271 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2024-11-07 15:45:33,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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) [2024-11-07 15:45:33,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:33,272 INFO L204 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:33,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:45:33,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1081886323, now seen corresponding path program 1 times [2024-11-07 15:45:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:33,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577186937] [2024-11-07 15:45:33,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:33,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577186937] [2024-11-07 15:45:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577186937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842404830] [2024-11-07 15:45:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:33,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:33,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-07 15:45:33,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-11-07 15:45:33,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:33,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-07 15:45:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:33,411 INFO L124 PetriNetUnfolderBase]: 31/461 cut-off events. [2024-11-07 15:45:33,412 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-07 15:45:33,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 461 events. 31/461 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 843 event pairs, 14 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 506. Up to 50 conditions per place. [2024-11-07 15:45:33,414 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-11-07 15:45:33,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2024-11-07 15:45:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-11-07 15:45:33,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9124183006535947 [2024-11-07 15:45:33,416 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2024-11-07 15:45:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2024-11-07 15:45:33,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:33,420 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2024-11-07 15:45:33,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2024-11-07 15:45:33,421 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2024-11-07 15:45:33,421 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2024-11-07 15:45:33,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-11-07 15:45:33,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:33,422 INFO L204 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1] [2024-11-07 15:45:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:45:33,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:33,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 688744348, now seen corresponding path program 1 times [2024-11-07 15:45:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840711165] [2024-11-07 15:45:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840711165] [2024-11-07 15:45:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840711165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840814657] [2024-11-07 15:45:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:33,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:33,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-07 15:45:33,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-11-07 15:45:33,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:33,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-07 15:45:33,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:33,659 INFO L124 PetriNetUnfolderBase]: 113/1198 cut-off events. [2024-11-07 15:45:33,659 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-07 15:45:33,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1198 events. 113/1198 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6615 event pairs, 25 based on Foata normal form. 0/1089 useless extension candidates. Maximal degree in co-relation 1392. Up to 91 conditions per place. [2024-11-07 15:45:33,666 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2024-11-07 15:45:33,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2024-11-07 15:45:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2024-11-07 15:45:33,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9196078431372549 [2024-11-07 15:45:33,668 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2024-11-07 15:45:33,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2024-11-07 15:45:33,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:45:33,673 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2024-11-07 15:45:33,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2024-11-07 15:45:33,674 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2024-11-07 15:45:33,674 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2024-11-07 15:45:33,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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) [2024-11-07 15:45:33,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:33,674 INFO L204 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:33,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:45:33,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:33,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1410606142, now seen corresponding path program 1 times [2024-11-07 15:45:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:33,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441970822] [2024-11-07 15:45:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441970822] [2024-11-07 15:45:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441970822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 15:45:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052621465] [2024-11-07 15:45:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:33,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 15:45:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 15:45:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:45:34,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 510 [2024-11-07 15:45:34,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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) [2024-11-07 15:45:34,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:34,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 510 [2024-11-07 15:45:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:34,633 INFO L124 PetriNetUnfolderBase]: 256/1901 cut-off events. [2024-11-07 15:45:34,634 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-07 15:45:34,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1901 events. 256/1901 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9860 event pairs, 122 based on Foata normal form. 9/1758 useless extension candidates. Maximal degree in co-relation 2446. Up to 245 conditions per place. [2024-11-07 15:45:34,644 INFO L140 encePairwiseOnDemand]: 481/510 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2024-11-07 15:45:34,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2024-11-07 15:45:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 15:45:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 15:45:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2024-11-07 15:45:34,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8709803921568627 [2024-11-07 15:45:34,652 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2024-11-07 15:45:34,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2024-11-07 15:45:34,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:34,658 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2024-11-07 15:45:34,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2024-11-07 15:45:34,659 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2024-11-07 15:45:34,659 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2024-11-07 15:45:34,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 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) [2024-11-07 15:45:34,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:34,662 INFO L204 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:34,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:45:34,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:34,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1577782458, now seen corresponding path program 1 times [2024-11-07 15:45:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:34,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656351830] [2024-11-07 15:45:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656351830] [2024-11-07 15:45:34,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656351830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:34,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:34,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220062184] [2024-11-07 15:45:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:34,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:34,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:34,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 510 [2024-11-07 15:45:34,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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) [2024-11-07 15:45:34,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:34,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 510 [2024-11-07 15:45:34,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:34,888 INFO L124 PetriNetUnfolderBase]: 87/956 cut-off events. [2024-11-07 15:45:34,889 INFO L125 PetriNetUnfolderBase]: For 68/80 co-relation queries the response was YES. [2024-11-07 15:45:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 956 events. 87/956 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2739 event pairs, 39 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1202. Up to 125 conditions per place. [2024-11-07 15:45:34,894 INFO L140 encePairwiseOnDemand]: 508/510 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-11-07 15:45:34,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2024-11-07 15:45:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2024-11-07 15:45:34,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9183006535947712 [2024-11-07 15:45:34,898 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2024-11-07 15:45:34,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2024-11-07 15:45:34,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:45:34,904 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2024-11-07 15:45:34,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2024-11-07 15:45:34,905 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-11-07 15:45:34,905 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2024-11-07 15:45:34,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 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) [2024-11-07 15:45:34,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:34,906 INFO L204 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:34,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:45:34,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:34,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1541076308, now seen corresponding path program 1 times [2024-11-07 15:45:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:34,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270962199] [2024-11-07 15:45:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:45:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270962199] [2024-11-07 15:45:34,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270962199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:34,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:45:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805405750] [2024-11-07 15:45:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:34,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:45:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:34,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:45:34,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:45:34,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-07 15:45:34,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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) [2024-11-07 15:45:34,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:34,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-07 15:45:34,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:35,308 INFO L124 PetriNetUnfolderBase]: 238/2127 cut-off events. [2024-11-07 15:45:35,309 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-07 15:45:35,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 2127 events. 238/2127 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12968 event pairs, 61 based on Foata normal form. 4/1994 useless extension candidates. Maximal degree in co-relation 2737. Up to 176 conditions per place. [2024-11-07 15:45:35,318 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2024-11-07 15:45:35,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2024-11-07 15:45:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:45:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:45:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2024-11-07 15:45:35,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.918954248366013 [2024-11-07 15:45:35,321 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2024-11-07 15:45:35,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2024-11-07 15:45:35,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:45:35,326 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2024-11-07 15:45:35,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2024-11-07 15:45:35,327 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2024-11-07 15:45:35,327 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2024-11-07 15:45:35,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 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) [2024-11-07 15:45:35,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:35,327 INFO L204 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, 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, 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, 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, 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, 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, 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, 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, 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, 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] [2024-11-07 15:45:35,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:45:35,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:35,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1969656587, now seen corresponding path program 1 times [2024-11-07 15:45:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705741833] [2024-11-07 15:45:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:45:35,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705741833] [2024-11-07 15:45:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705741833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:45:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909904732] [2024-11-07 15:45:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:35,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:45:35,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:45:35,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:45:35,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 15:45:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:35,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 15:45:35,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:45:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:45:36,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:45:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:45:36,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909904732] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:45:36,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:45:36,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-07 15:45:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649393429] [2024-11-07 15:45:36,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:45:36,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 15:45:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 15:45:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-07 15:45:37,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 510 [2024-11-07 15:45:37,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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) [2024-11-07 15:45:37,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:37,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 510 [2024-11-07 15:45:37,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:38,332 INFO L124 PetriNetUnfolderBase]: 491/2909 cut-off events. [2024-11-07 15:45:38,332 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-11-07 15:45:38,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2909 events. 491/2909 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18077 event pairs, 201 based on Foata normal form. 9/2686 useless extension candidates. Maximal degree in co-relation 4164. Up to 437 conditions per place. [2024-11-07 15:45:38,348 INFO L140 encePairwiseOnDemand]: 471/510 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2024-11-07 15:45:38,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2024-11-07 15:45:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 15:45:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-07 15:45:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2024-11-07 15:45:38,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8479876160990713 [2024-11-07 15:45:38,428 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2024-11-07 15:45:38,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2024-11-07 15:45:38,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-11-07 15:45:38,434 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2024-11-07 15:45:38,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2024-11-07 15:45:38,435 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2024-11-07 15:45:38,435 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2024-11-07 15:45:38,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 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) [2024-11-07 15:45:38,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:38,441 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:38,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 15:45:38,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:45:38,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash -562157278, now seen corresponding path program 2 times [2024-11-07 15:45:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267405054] [2024-11-07 15:45:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:45:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267405054] [2024-11-07 15:45:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267405054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423933806] [2024-11-07 15:45:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:39,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:39,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:39,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-11-07 15:45:39,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-11-07 15:45:39,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:39,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-11-07 15:45:39,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:40,491 INFO L124 PetriNetUnfolderBase]: 653/3303 cut-off events. [2024-11-07 15:45:40,491 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-11-07 15:45:40,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5006 conditions, 3303 events. 653/3303 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25168 event pairs, 130 based on Foata normal form. 0/3059 useless extension candidates. Maximal degree in co-relation 4956. Up to 607 conditions per place. [2024-11-07 15:45:40,504 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2024-11-07 15:45:40,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2024-11-07 15:45:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:45:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:45:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-11-07 15:45:40,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-11-07 15:45:40,509 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2024-11-07 15:45:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2024-11-07 15:45:40,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-07 15:45:40,514 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2024-11-07 15:45:40,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2024-11-07 15:45:40,515 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2024-11-07 15:45:40,515 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2024-11-07 15:45:40,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-11-07 15:45:40,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:40,516 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:40,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 15:45:40,516 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:40,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 592738246, now seen corresponding path program 1 times [2024-11-07 15:45:40,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:40,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976667500] [2024-11-07 15:45:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:45:41,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:41,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976667500] [2024-11-07 15:45:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976667500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:41,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:41,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 15:45:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470485295] [2024-11-07 15:45:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:41,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 15:45:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 15:45:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-07 15:45:46,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-11-07 15:45:46,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-11-07 15:45:46,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:46,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-11-07 15:45:46,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:48,282 INFO L124 PetriNetUnfolderBase]: 1671/7904 cut-off events. [2024-11-07 15:45:48,283 INFO L125 PetriNetUnfolderBase]: For 3160/3664 co-relation queries the response was YES. [2024-11-07 15:45:48,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13758 conditions, 7904 events. 1671/7904 cut-off events. For 3160/3664 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 81514 event pairs, 448 based on Foata normal form. 180/7364 useless extension candidates. Maximal degree in co-relation 13710. Up to 1419 conditions per place. [2024-11-07 15:45:48,348 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 82 selfloop transitions, 44 changer transitions 0/468 dead transitions. [2024-11-07 15:45:48,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 468 transitions, 1579 flow [2024-11-07 15:45:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 15:45:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-07 15:45:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13254 transitions. [2024-11-07 15:45:48,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8121323529411765 [2024-11-07 15:45:48,364 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 32 states and 13254 transitions. [2024-11-07 15:45:48,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 468 transitions, 1579 flow [2024-11-07 15:45:48,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 468 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:45:48,378 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1330 flow [2024-11-07 15:45:48,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1330, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2024-11-07 15:45:48,379 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -9 predicate places. [2024-11-07 15:45:48,379 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1330 flow [2024-11-07 15:45:48,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-11-07 15:45:48,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:48,381 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:48,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:45:48,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:48,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1817904910, now seen corresponding path program 2 times [2024-11-07 15:45:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:48,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525031878] [2024-11-07 15:45:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:45:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525031878] [2024-11-07 15:45:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525031878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 15:45:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146788465] [2024-11-07 15:45:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 15:45:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 15:45:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-07 15:45:53,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 510 [2024-11-07 15:45:53,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1330 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-11-07 15:45:53,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:53,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 510 [2024-11-07 15:45:53,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:45:56,448 INFO L124 PetriNetUnfolderBase]: 2275/11656 cut-off events. [2024-11-07 15:45:56,449 INFO L125 PetriNetUnfolderBase]: For 10570/12098 co-relation queries the response was YES. [2024-11-07 15:45:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22460 conditions, 11656 events. 2275/11656 cut-off events. For 10570/12098 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 128633 event pairs, 608 based on Foata normal form. 196/10671 useless extension candidates. Maximal degree in co-relation 22407. Up to 1914 conditions per place. [2024-11-07 15:45:56,590 INFO L140 encePairwiseOnDemand]: 475/510 looper letters, 101 selfloop transitions, 50 changer transitions 0/493 dead transitions. [2024-11-07 15:45:56,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 493 transitions, 1971 flow [2024-11-07 15:45:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 15:45:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-07 15:45:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13253 transitions. [2024-11-07 15:45:56,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8120710784313725 [2024-11-07 15:45:56,605 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1330 flow. Second operand 32 states and 13253 transitions. [2024-11-07 15:45:56,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 493 transitions, 1971 flow [2024-11-07 15:45:56,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 493 transitions, 1920 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-11-07 15:45:56,624 INFO L231 Difference]: Finished difference. Result has 449 places, 451 transitions, 1578 flow [2024-11-07 15:45:56,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1578, PETRI_PLACES=449, PETRI_TRANSITIONS=451} [2024-11-07 15:45:56,625 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 0 predicate places. [2024-11-07 15:45:56,625 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 451 transitions, 1578 flow [2024-11-07 15:45:56,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 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) [2024-11-07 15:45:56,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:45:56,627 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:45:56,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:45:56,627 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:45:56,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:45:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1116933197, now seen corresponding path program 1 times [2024-11-07 15:45:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:45:56,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569188015] [2024-11-07 15:45:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:45:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:45:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:45:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:45:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:45:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569188015] [2024-11-07 15:45:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569188015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:45:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:45:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:45:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76812710] [2024-11-07 15:45:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:45:57,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:45:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:45:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:45:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:45:57,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 510 [2024-11-07 15:45:57,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 451 transitions, 1578 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-11-07 15:45:57,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:45:57,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 510 [2024-11-07 15:45:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:00,605 INFO L124 PetriNetUnfolderBase]: 4780/18262 cut-off events. [2024-11-07 15:46:00,605 INFO L125 PetriNetUnfolderBase]: For 20740/21095 co-relation queries the response was YES. [2024-11-07 15:46:00,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39090 conditions, 18262 events. 4780/18262 cut-off events. For 20740/21095 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 211141 event pairs, 781 based on Foata normal form. 266/17189 useless extension candidates. Maximal degree in co-relation 39036. Up to 3538 conditions per place. [2024-11-07 15:46:00,756 INFO L140 encePairwiseOnDemand]: 496/510 looper letters, 76 selfloop transitions, 32 changer transitions 0/496 dead transitions. [2024-11-07 15:46:00,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 496 transitions, 2015 flow [2024-11-07 15:46:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:46:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:46:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2024-11-07 15:46:00,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2024-11-07 15:46:00,759 INFO L175 Difference]: Start difference. First operand has 449 places, 451 transitions, 1578 flow. Second operand 6 states and 2703 transitions. [2024-11-07 15:46:00,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 496 transitions, 2015 flow [2024-11-07 15:46:00,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 496 transitions, 1940 flow, removed 12 selfloop flow, removed 26 redundant places. [2024-11-07 15:46:00,789 INFO L231 Difference]: Finished difference. Result has 433 places, 477 transitions, 1844 flow [2024-11-07 15:46:00,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1844, PETRI_PLACES=433, PETRI_TRANSITIONS=477} [2024-11-07 15:46:00,791 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -16 predicate places. [2024-11-07 15:46:00,791 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 477 transitions, 1844 flow [2024-11-07 15:46:00,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 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) [2024-11-07 15:46:00,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:00,792 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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] [2024-11-07 15:46:00,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:46:00,792 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:46:00,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1489406644, now seen corresponding path program 1 times [2024-11-07 15:46:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:00,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485152549] [2024-11-07 15:46:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:00,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:46:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485152549] [2024-11-07 15:46:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485152549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903889865] [2024-11-07 15:46:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:00,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:00,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-07 15:46:00,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 477 transitions, 1844 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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) [2024-11-07 15:46:00,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:00,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-07 15:46:00,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:04,214 INFO L124 PetriNetUnfolderBase]: 3185/14336 cut-off events. [2024-11-07 15:46:04,214 INFO L125 PetriNetUnfolderBase]: For 27853/28469 co-relation queries the response was YES. [2024-11-07 15:46:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32599 conditions, 14336 events. 3185/14336 cut-off events. For 27853/28469 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 165963 event pairs, 917 based on Foata normal form. 131/13054 useless extension candidates. Maximal degree in co-relation 32542. Up to 2701 conditions per place. [2024-11-07 15:46:04,319 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 49 selfloop transitions, 2 changer transitions 0/483 dead transitions. [2024-11-07 15:46:04,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 483 transitions, 1986 flow [2024-11-07 15:46:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-07 15:46:04,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137254901960784 [2024-11-07 15:46:04,321 INFO L175 Difference]: Start difference. First operand has 433 places, 477 transitions, 1844 flow. Second operand 3 states and 1398 transitions. [2024-11-07 15:46:04,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 483 transitions, 1986 flow [2024-11-07 15:46:04,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 483 transitions, 1970 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-07 15:46:04,358 INFO L231 Difference]: Finished difference. Result has 434 places, 476 transitions, 1830 flow [2024-11-07 15:46:04,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1830, PETRI_PLACES=434, PETRI_TRANSITIONS=476} [2024-11-07 15:46:04,359 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, -15 predicate places. [2024-11-07 15:46:04,359 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 476 transitions, 1830 flow [2024-11-07 15:46:04,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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) [2024-11-07 15:46:04,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:04,360 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:04,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 15:46:04,360 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:46:04,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash -851236923, now seen corresponding path program 1 times [2024-11-07 15:46:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:04,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196826420] [2024-11-07 15:46:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 15:46:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196826420] [2024-11-07 15:46:04,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196826420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016560711] [2024-11-07 15:46:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:04,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:04,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:46:04,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 15:46:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:04,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 15:46:04,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 15:46:05,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:46:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 15:46:05,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016560711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:46:05,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:46:05,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-11-07 15:46:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523989579] [2024-11-07 15:46:05,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:46:05,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 15:46:05,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 15:46:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-11-07 15:46:07,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 510 [2024-11-07 15:46:07,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 476 transitions, 1830 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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) [2024-11-07 15:46:07,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:07,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 510 [2024-11-07 15:46:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:13,907 INFO L124 PetriNetUnfolderBase]: 7157/29496 cut-off events. [2024-11-07 15:46:13,908 INFO L125 PetriNetUnfolderBase]: For 45030/51021 co-relation queries the response was YES. [2024-11-07 15:46:14,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66911 conditions, 29496 events. 7157/29496 cut-off events. For 45030/51021 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 359164 event pairs, 2138 based on Foata normal form. 662/28311 useless extension candidates. Maximal degree in co-relation 66851. Up to 6149 conditions per place. [2024-11-07 15:46:14,174 INFO L140 encePairwiseOnDemand]: 468/510 looper letters, 130 selfloop transitions, 115 changer transitions 0/611 dead transitions. [2024-11-07 15:46:14,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 611 transitions, 3025 flow [2024-11-07 15:46:14,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-07 15:46:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-07 15:46:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2024-11-07 15:46:14,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8394463667820069 [2024-11-07 15:46:14,180 INFO L175 Difference]: Start difference. First operand has 434 places, 476 transitions, 1830 flow. Second operand 34 states and 14556 transitions. [2024-11-07 15:46:14,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 611 transitions, 3025 flow [2024-11-07 15:46:14,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 611 transitions, 3021 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:14,239 INFO L231 Difference]: Finished difference. Result has 475 places, 554 transitions, 2560 flow [2024-11-07 15:46:14,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2560, PETRI_PLACES=475, PETRI_TRANSITIONS=554} [2024-11-07 15:46:14,241 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 26 predicate places. [2024-11-07 15:46:14,241 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 554 transitions, 2560 flow [2024-11-07 15:46:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 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) [2024-11-07 15:46:14,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:14,243 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:14,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 15:46:14,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:14,444 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:46:14,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1975076787, now seen corresponding path program 1 times [2024-11-07 15:46:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:14,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798659334] [2024-11-07 15:46:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:46:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798659334] [2024-11-07 15:46:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798659334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:15,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 15:46:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347988986] [2024-11-07 15:46:15,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:15,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 15:46:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:15,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 15:46:15,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:46:17,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-11-07 15:46:17,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 554 transitions, 2560 flow. Second operand has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-11-07 15:46:17,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:17,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-11-07 15:46:17,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:25,122 INFO L124 PetriNetUnfolderBase]: 8444/33360 cut-off events. [2024-11-07 15:46:25,123 INFO L125 PetriNetUnfolderBase]: For 66317/69168 co-relation queries the response was YES. [2024-11-07 15:46:25,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80864 conditions, 33360 events. 8444/33360 cut-off events. For 66317/69168 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 407757 event pairs, 1702 based on Foata normal form. 1014/31465 useless extension candidates. Maximal degree in co-relation 80790. Up to 5335 conditions per place. [2024-11-07 15:46:25,572 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 149 selfloop transitions, 67 changer transitions 0/635 dead transitions. [2024-11-07 15:46:25,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 635 transitions, 3628 flow [2024-11-07 15:46:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 15:46:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-07 15:46:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 10057 transitions. [2024-11-07 15:46:25,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216503267973856 [2024-11-07 15:46:25,583 INFO L175 Difference]: Start difference. First operand has 475 places, 554 transitions, 2560 flow. Second operand 24 states and 10057 transitions. [2024-11-07 15:46:25,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 635 transitions, 3628 flow [2024-11-07 15:46:25,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 635 transitions, 3544 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-11-07 15:46:25,730 INFO L231 Difference]: Finished difference. Result has 498 places, 566 transitions, 2825 flow [2024-11-07 15:46:25,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2825, PETRI_PLACES=498, PETRI_TRANSITIONS=566} [2024-11-07 15:46:25,731 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 49 predicate places. [2024-11-07 15:46:25,731 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 566 transitions, 2825 flow [2024-11-07 15:46:25,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-11-07 15:46:25,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:25,732 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 15:46:25,732 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:46:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -813073543, now seen corresponding path program 2 times [2024-11-07 15:46:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959775916] [2024-11-07 15:46:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:46:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959775916] [2024-11-07 15:46:26,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959775916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:26,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:26,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 15:46:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424889361] [2024-11-07 15:46:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:26,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 15:46:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 15:46:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-07 15:46:28,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 510 [2024-11-07 15:46:28,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 566 transitions, 2825 flow. Second operand has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-11-07 15:46:28,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:28,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 510 [2024-11-07 15:46:28,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:35,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][599], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 14#L50-8true, Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 548#true, 522#(= |#race~A~0| 0), Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, 576#true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:35,333 INFO L294 olderBase$Statistics]: this new event has 427 ancestors and is cut-off event [2024-11-07 15:46:35,333 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-11-07 15:46:35,333 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2024-11-07 15:46:35,333 INFO L297 olderBase$Statistics]: existing Event has 413 ancestors and is cut-off event [2024-11-07 15:46:36,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][608], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 333#L52-5true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:36,127 INFO L294 olderBase$Statistics]: this new event has 439 ancestors and is cut-off event [2024-11-07 15:46:36,127 INFO L297 olderBase$Statistics]: existing Event has 439 ancestors and is cut-off event [2024-11-07 15:46:36,127 INFO L297 olderBase$Statistics]: existing Event has 425 ancestors and is cut-off event [2024-11-07 15:46:36,127 INFO L297 olderBase$Statistics]: existing Event has 432 ancestors and is cut-off event [2024-11-07 15:46:36,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][614], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 254#L52-6true, 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:36,206 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is cut-off event [2024-11-07 15:46:36,207 INFO L297 olderBase$Statistics]: existing Event has 426 ancestors and is cut-off event [2024-11-07 15:46:36,207 INFO L297 olderBase$Statistics]: existing Event has 433 ancestors and is cut-off event [2024-11-07 15:46:36,207 INFO L297 olderBase$Statistics]: existing Event has 440 ancestors and is cut-off event [2024-11-07 15:46:36,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][618], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 328#L52-7true, 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:36,286 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-11-07 15:46:36,287 INFO L297 olderBase$Statistics]: existing Event has 434 ancestors and is cut-off event [2024-11-07 15:46:36,287 INFO L297 olderBase$Statistics]: existing Event has 427 ancestors and is cut-off event [2024-11-07 15:46:36,287 INFO L297 olderBase$Statistics]: existing Event has 441 ancestors and is cut-off event [2024-11-07 15:46:36,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2472#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 4747#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 71#L52-9true, 363#L68true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:36,352 INFO L294 olderBase$Statistics]: this new event has 443 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L297 olderBase$Statistics]: existing Event has 436 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L297 olderBase$Statistics]: existing Event has 429 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L297 olderBase$Statistics]: existing Event has 443 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L52-8-->L52-9: Formula: (let ((.cse0 (select |v_#race_30| v_~B~0.base_7)) (.cse1 (* v_thread1Thread1of1ForFork1_~i~0_49 4))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 v_~B~0.offset_7 1)) 0) (= (select .cse0 (+ .cse1 2 v_~B~0.offset_7)) 0) (= (select .cse0 (+ .cse1 3 v_~B~0.offset_7)) 0))) InVars {#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} OutVars{#race=|v_#race_30|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, ~B~0.base=v_~B~0.base_7, ~B~0.offset=v_~B~0.offset_7} AuxVars[] AssignedVars[][466], [4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2309#true, Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2472#true, 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 576#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 4747#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (not (= ~C~0.base ~B~0.base))), Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 437#L61-6true, 501#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 71#L52-9true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:36,352 INFO L294 olderBase$Statistics]: this new event has 438 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L297 olderBase$Statistics]: existing Event has 438 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-07 15:46:36,352 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is cut-off event [2024-11-07 15:46:36,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] L62-->L65: Formula: (let ((.cse13 (* |v_thread2Thread1of1ForFork2_~i~1#1_15| 4))) (let ((.cse0 (select |v_#race_513| v_~C~0.base_148)) (.cse10 (+ v_~C~0.offset_148 3 .cse13)) (.cse12 (+ .cse13 v_~B~0.offset_96))) (let ((.cse3 (select (select |v_#memory_int_204| v_~B~0.base_96) .cse12)) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483648))) (.cse6 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_5| 2147483647)) (.cse5 (+ v_~C~0.offset_148 .cse13)) (.cse1 (+ v_~C~0.offset_148 2 .cse13)) (.cse4 (+ .cse13 v_~A~0.offset_86)) (.cse9 (+ v_~C~0.offset_148 .cse13 1)) (.cse2 (select .cse0 .cse10))) (and (= (select .cse0 .cse1) .cse2) (= |v_thread2Thread1of1ForFork2_plus_#res#1_5| (+ .cse3 (select (select |v_#memory_int_204| v_~A~0.base_86) .cse4))) (= |v_#race~A~0_67| 0) (= |v_#memory_int_203| (store |v_#memory_int_204| v_~C~0.base_148 (store (select |v_#memory_int_204| v_~C~0.base_148) .cse5 |v_thread2Thread1of1ForFork2_plus_#res#1_5|))) (= v_~p~0_31 (+ |v_thread2Thread1of1ForFork2_~i~1#1_15| 1)) (not (= (ite (or (<= .cse3 0) .cse6) 1 0) 0)) .cse7 (not (= (ite (or (<= 0 .cse3) .cse7) 1 0) 0)) (= |v_#race~B~0_71| 0) (= (select .cse0 .cse5) .cse2) .cse6 (= |v_#race_513| (let ((.cse8 (let ((.cse11 (store |v_#race_514| v_~A~0.base_86 (store (store (store (store (select |v_#race_514| v_~A~0.base_86) .cse4 0) (+ .cse13 v_~A~0.offset_86 1) 0) (+ 2 .cse13 v_~A~0.offset_86) 0) (+ 3 .cse13 v_~A~0.offset_86) 0)))) (store .cse11 v_~B~0.base_96 (store (store (store (store (select .cse11 v_~B~0.base_96) .cse12 0) (+ .cse13 v_~B~0.offset_96 1) 0) (+ 2 .cse13 v_~B~0.offset_96) 0) (+ 3 .cse13 v_~B~0.offset_96) 0))))) (store .cse8 v_~C~0.base_148 (store (store (store (store (select .cse8 v_~C~0.base_148) .cse5 .cse2) .cse9 .cse2) .cse1 .cse2) .cse10 .cse2)))) (= 0 |v_#race~C~0_145|) (= (select .cse0 .cse9) .cse2))))) InVars {#race=|v_#race_514|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, ~C~0.base=v_~C~0.base_148, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_204|, ~B~0.offset=v_~B~0.offset_96} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_11|, ~A~0.base=v_~A~0.base_86, ~B~0.base=v_~B~0.base_96, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_15|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_5|, ~C~0.base=v_~C~0.base_148, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_#t~nondet11#1=|v_thread2Thread1of1ForFork2_#t~nondet11#1_5|, #race~B~0=|v_#race~B~0_71|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_7|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_5|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_96, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_5|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_3|, #race=|v_#race_513|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_5|, ~A~0.offset=v_~A~0.offset_86, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, #race~p~0=|v_#race~p~0_34|, thread2Thread1of1ForFork2_#t~ret10#1=|v_thread2Thread1of1ForFork2_#t~ret10#1_5|, ~C~0.offset=v_~C~0.offset_148, #memory_int=|v_#memory_int_203|, ~p~0=v_~p~0_31, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_67|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, #race, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#t~nondet11#1, #race~B~0, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~ret10#1, #memory_int, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][622], [Black: 2276#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 451#L52-8true, Black: 2280#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2312#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2311#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 4739#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (not (= ~C~0.base ~B~0.base))), Black: 2314#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 2313#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 528#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 4587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post45#1| 1)), Black: 4627#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1)), Black: 4589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 4575#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2495#(<= ~N~0 2), Black: 4591#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 2) (<= ~N~0 2) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 3478#(and (<= 2 |thread2Thread1of1ForFork2_~i~1#1|) (<= ~N~0 2)), Black: 2496#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 2391#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 4625#(and (<= ~N~0 2) (= |thread2Thread1of1ForFork2_#t~post13#1| 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 4583#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2461#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1)), Black: 2463#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2465#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 522#(= |#race~A~0| 0), 548#true, Black: 2474#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 2476#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2475#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 2477#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 85#L82true, Black: 562#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2309#true, 2467#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 576#true, Black: 4686#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 4690#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 2486#true, Black: 4688#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 6)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= (select (select |#race| ~B~0.base) (+ 7 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ 5 ~B~0.offset)) 0) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (not (= ~C~0.base ~B~0.base))), Black: 2389#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), Black: 2387#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), Black: 2385#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread2Thread1of1ForFork2_~i~1#1| 1)), 327#L108-4true, 287#L65true, 501#(= |#race~N~0| 0), 4684#(and (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| ~B~0.base)) (= (select |#valid| ~B~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 1) (not (= ~C~0.base ~B~0.base))), 535#(= |#race~B~0| 0), 2472#true, Black: 2274#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2282#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-07 15:46:36,353 INFO L294 olderBase$Statistics]: this new event has 442 ancestors and is cut-off event [2024-11-07 15:46:36,353 INFO L297 olderBase$Statistics]: existing Event has 442 ancestors and is cut-off event [2024-11-07 15:46:36,353 INFO L297 olderBase$Statistics]: existing Event has 435 ancestors and is cut-off event [2024-11-07 15:46:36,353 INFO L297 olderBase$Statistics]: existing Event has 428 ancestors and is cut-off event [2024-11-07 15:46:37,540 INFO L124 PetriNetUnfolderBase]: 8230/36897 cut-off events. [2024-11-07 15:46:37,541 INFO L125 PetriNetUnfolderBase]: For 87507/90601 co-relation queries the response was YES. [2024-11-07 15:46:37,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93639 conditions, 36897 events. 8230/36897 cut-off events. For 87507/90601 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 472589 event pairs, 1035 based on Foata normal form. 1619/36055 useless extension candidates. Maximal degree in co-relation 93560. Up to 4724 conditions per place. [2024-11-07 15:46:38,099 INFO L140 encePairwiseOnDemand]: 478/510 looper letters, 112 selfloop transitions, 103 changer transitions 0/634 dead transitions. [2024-11-07 15:46:38,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 634 transitions, 3807 flow [2024-11-07 15:46:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 15:46:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-07 15:46:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10477 transitions. [2024-11-07 15:46:38,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8217254901960784 [2024-11-07 15:46:38,111 INFO L175 Difference]: Start difference. First operand has 498 places, 566 transitions, 2825 flow. Second operand 25 states and 10477 transitions. [2024-11-07 15:46:38,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 634 transitions, 3807 flow [2024-11-07 15:46:38,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 634 transitions, 3739 flow, removed 1 selfloop flow, removed 19 redundant places. [2024-11-07 15:46:38,334 INFO L231 Difference]: Finished difference. Result has 506 places, 590 transitions, 3362 flow [2024-11-07 15:46:38,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2749, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3362, PETRI_PLACES=506, PETRI_TRANSITIONS=590} [2024-11-07 15:46:38,336 INFO L277 CegarLoopForPetriNet]: 449 programPoint places, 57 predicate places. [2024-11-07 15:46:38,336 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 590 transitions, 3362 flow [2024-11-07 15:46:38,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 418.2) internal successors, (6273), 15 states have internal predecessors, (6273), 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) [2024-11-07 15:46:38,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:38,337 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 15:46:38,338 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2024-11-07 15:46:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 664047267, now seen corresponding path program 1 times [2024-11-07 15:46:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712851663] [2024-11-07 15:46:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-07 15:46:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712851663] [2024-11-07 15:46:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712851663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:38,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507284068] [2024-11-07 15:46:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:38,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-07 15:46:38,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 590 transitions, 3362 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 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) [2024-11-07 15:46:38,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:38,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-07 15:46:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand