./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:39:15,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:39:16,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:39:16,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:39:16,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:39:16,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:39:16,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:39:16,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:39:16,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:39:16,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:39:16,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:39:16,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:39:16,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:39:16,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:39:16,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:39:16,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:39:16,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:39:16,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:39:16,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:39:16,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:39:16,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:39:16,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:39:16,144 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:39:16,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:39:16,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:39:16,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:39:16,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:39:16,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:39:16,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:39:16,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:39:16,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:39:16,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:16,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:39:16,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:39:16,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:39:16,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:39:16,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:39:16,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:39:16,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:39:16,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:39:16,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:39:16,150 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2024-11-16 23:39:16,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:39:16,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:39:16,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:39:16,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:39:16,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:39:16,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-11-16 23:39:18,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:39:18,413 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:39:18,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-11-16 23:39:18,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3893c9169/507fb119bd254837809c02a8f71d4d29/FLAGa33634616 [2024-11-16 23:39:18,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3893c9169/507fb119bd254837809c02a8f71d4d29 [2024-11-16 23:39:18,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:39:18,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:39:18,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:18,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:39:18,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:39:18,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:18" (1/1) ... [2024-11-16 23:39:18,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc5bb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:18, skipping insertion in model container [2024-11-16 23:39:18,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:18" (1/1) ... [2024-11-16 23:39:18,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:39:19,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:19,418 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:39:19,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:19,551 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:39:19,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19 WrapperNode [2024-11-16 23:39:19,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:19,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:19,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:39:19,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:39:19,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,612 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2024-11-16 23:39:19,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:19,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:39:19,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:39:19,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:39:19,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:39:19,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:39:19,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:39:19,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:39:19,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (1/1) ... [2024-11-16 23:39:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:19,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:39:19,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:39:19,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:39:19,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-16 23:39:19,749 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:39:19,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:39:19,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:39:19,752 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:39:19,983 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:39:19,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:39:20,413 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-16 23:39:20,413 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-16 23:39:20,498 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:39:20,499 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:39:20,542 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:39:20,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:39:20,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:20 BoogieIcfgContainer [2024-11-16 23:39:20,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:39:20,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:39:20,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:39:20,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:39:20,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:18" (1/3) ... [2024-11-16 23:39:20,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d894b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:20, skipping insertion in model container [2024-11-16 23:39:20,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:19" (2/3) ... [2024-11-16 23:39:20,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d894b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:20, skipping insertion in model container [2024-11-16 23:39:20,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:20" (3/3) ... [2024-11-16 23:39:20,552 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2024-11-16 23:39:20,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:39:20,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-16 23:39:20,570 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:39:20,634 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:39:20,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 216 transitions, 439 flow [2024-11-16 23:39:20,892 INFO L124 PetriNetUnfolderBase]: 25/288 cut-off events. [2024-11-16 23:39:20,894 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:39:20,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 288 events. 25/288 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 716 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 158. Up to 6 conditions per place. [2024-11-16 23:39:20,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 216 transitions, 439 flow [2024-11-16 23:39:20,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 216 transitions, 439 flow [2024-11-16 23:39:20,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:20,947 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;@5bfb9f5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:20,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-16 23:39:20,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:20,991 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2024-11-16 23:39:20,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:20,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:20,992 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] [2024-11-16 23:39:20,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2093197408, now seen corresponding path program 1 times [2024-11-16 23:39:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:21,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866415582] [2024-11-16 23:39:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:22,404 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-16 23:39:22,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:22,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866415582] [2024-11-16 23:39:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866415582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:22,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527563599] [2024-11-16 23:39:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:22,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:22,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 216 [2024-11-16 23:39:22,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 216 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 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-16 23:39:22,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:22,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 216 [2024-11-16 23:39:22,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:22,931 INFO L124 PetriNetUnfolderBase]: 121/756 cut-off events. [2024-11-16 23:39:22,931 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:39:22,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 756 events. 121/756 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4157 event pairs, 12 based on Foata normal form. 150/834 useless extension candidates. Maximal degree in co-relation 823. Up to 174 conditions per place. [2024-11-16 23:39:22,944 INFO L140 encePairwiseOnDemand]: 198/216 looper letters, 48 selfloop transitions, 5 changer transitions 0/225 dead transitions. [2024-11-16 23:39:22,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 225 transitions, 563 flow [2024-11-16 23:39:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1128 transitions. [2024-11-16 23:39:22,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2024-11-16 23:39:22,973 INFO L175 Difference]: Start difference. First operand has 203 places, 216 transitions, 439 flow. Second operand 6 states and 1128 transitions. [2024-11-16 23:39:22,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 225 transitions, 563 flow [2024-11-16 23:39:22,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 225 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:22,984 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 419 flow [2024-11-16 23:39:22,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2024-11-16 23:39:22,990 INFO L277 CegarLoopForPetriNet]: 203 programPoint places, 2 predicate places. [2024-11-16 23:39:22,990 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 419 flow [2024-11-16 23:39:22,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 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-16 23:39:22,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:22,992 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] [2024-11-16 23:39:22,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:39:22,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1064869551, now seen corresponding path program 1 times [2024-11-16 23:39:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080829989] [2024-11-16 23:39:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:23,091 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-16 23:39:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080829989] [2024-11-16 23:39:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080829989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:23,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224401821] [2024-11-16 23:39:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:23,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:23,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 216 [2024-11-16 23:39:23,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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-16 23:39:23,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:23,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 216 [2024-11-16 23:39:23,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:23,260 INFO L124 PetriNetUnfolderBase]: 57/661 cut-off events. [2024-11-16 23:39:23,260 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-16 23:39:23,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 661 events. 57/661 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3069 event pairs, 0 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 668. Up to 96 conditions per place. [2024-11-16 23:39:23,264 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 22 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-11-16 23:39:23,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 479 flow [2024-11-16 23:39:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2024-11-16 23:39:23,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2024-11-16 23:39:23,267 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 419 flow. Second operand 3 states and 580 transitions. [2024-11-16 23:39:23,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 479 flow [2024-11-16 23:39:23,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 207 transitions, 469 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:23,273 INFO L231 Difference]: Finished difference. Result has 203 places, 201 transitions, 417 flow [2024-11-16 23:39:23,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=203, PETRI_TRANSITIONS=201} [2024-11-16 23:39:23,274 INFO L277 CegarLoopForPetriNet]: 203 programPoint places, 0 predicate places. [2024-11-16 23:39:23,274 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 201 transitions, 417 flow [2024-11-16 23:39:23,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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-16 23:39:23,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:23,275 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] [2024-11-16 23:39:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:39:23,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -985865672, now seen corresponding path program 1 times [2024-11-16 23:39:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2503811] [2024-11-16 23:39:23,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:23,358 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-16 23:39:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2503811] [2024-11-16 23:39:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2503811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:23,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:23,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708831181] [2024-11-16 23:39:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:23,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:23,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 216 [2024-11-16 23:39:23,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 201 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-16 23:39:23,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:23,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 216 [2024-11-16 23:39:23,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:23,564 INFO L124 PetriNetUnfolderBase]: 134/987 cut-off events. [2024-11-16 23:39:23,564 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-16 23:39:23,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 987 events. 134/987 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5751 event pairs, 24 based on Foata normal form. 0/885 useless extension candidates. Maximal degree in co-relation 1138. Up to 129 conditions per place. [2024-11-16 23:39:23,573 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 30 selfloop transitions, 6 changer transitions 0/214 dead transitions. [2024-11-16 23:39:23,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 214 transitions, 518 flow [2024-11-16 23:39:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2024-11-16 23:39:23,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2024-11-16 23:39:23,576 INFO L175 Difference]: Start difference. First operand has 203 places, 201 transitions, 417 flow. Second operand 3 states and 579 transitions. [2024-11-16 23:39:23,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 214 transitions, 518 flow [2024-11-16 23:39:23,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 214 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:23,583 INFO L231 Difference]: Finished difference. Result has 203 places, 203 transitions, 451 flow [2024-11-16 23:39:23,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=203, PETRI_TRANSITIONS=203} [2024-11-16 23:39:23,585 INFO L277 CegarLoopForPetriNet]: 203 programPoint places, 0 predicate places. [2024-11-16 23:39:23,586 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 203 transitions, 451 flow [2024-11-16 23:39:23,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-16 23:39:23,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:23,587 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] [2024-11-16 23:39:23,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:39:23,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1100144350, now seen corresponding path program 1 times [2024-11-16 23:39:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:23,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187100622] [2024-11-16 23:39:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:23,669 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-16 23:39:23,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187100622] [2024-11-16 23:39:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187100622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:23,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281508433] [2024-11-16 23:39:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:23,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:23,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 216 [2024-11-16 23:39:23,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 203 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 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-16 23:39:23,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:23,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 216 [2024-11-16 23:39:23,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:23,919 INFO L124 PetriNetUnfolderBase]: 139/1033 cut-off events. [2024-11-16 23:39:23,920 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-16 23:39:23,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1033 events. 139/1033 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6303 event pairs, 57 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1281. Up to 220 conditions per place. [2024-11-16 23:39:23,926 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 27 selfloop transitions, 4 changer transitions 0/210 dead transitions. [2024-11-16 23:39:23,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 210 transitions, 531 flow [2024-11-16 23:39:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions. [2024-11-16 23:39:23,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873456790123457 [2024-11-16 23:39:23,929 INFO L175 Difference]: Start difference. First operand has 203 places, 203 transitions, 451 flow. Second operand 3 states and 575 transitions. [2024-11-16 23:39:23,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 210 transitions, 531 flow [2024-11-16 23:39:23,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 210 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:23,935 INFO L231 Difference]: Finished difference. Result has 205 places, 206 transitions, 471 flow [2024-11-16 23:39:23,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=205, PETRI_TRANSITIONS=206} [2024-11-16 23:39:23,937 INFO L277 CegarLoopForPetriNet]: 203 programPoint places, 2 predicate places. [2024-11-16 23:39:23,938 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 206 transitions, 471 flow [2024-11-16 23:39:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 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-16 23:39:23,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:23,941 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:39:23,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:39:23,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:23,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash 698392255, now seen corresponding path program 1 times [2024-11-16 23:39:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695946489] [2024-11-16 23:39:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:23,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:39:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:24,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:39:24,064 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:39:24,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-16 23:39:24,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-16 23:39:24,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-16 23:39:24,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-16 23:39:24,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-16 23:39:24,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-16 23:39:24,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-16 23:39:24,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-16 23:39:24,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-16 23:39:24,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-16 23:39:24,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-16 23:39:24,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-16 23:39:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:39:24,074 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 23:39:24,078 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:39:24,079 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:39:24,112 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:39:24,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 267 transitions, 550 flow [2024-11-16 23:39:24,170 INFO L124 PetriNetUnfolderBase]: 43/440 cut-off events. [2024-11-16 23:39:24,170 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:39:24,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 440 events. 43/440 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1363 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 290. Up to 9 conditions per place. [2024-11-16 23:39:24,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 267 transitions, 550 flow [2024-11-16 23:39:24,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 267 transitions, 550 flow [2024-11-16 23:39:24,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:24,180 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;@5bfb9f5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:24,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-16 23:39:24,190 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:24,191 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2024-11-16 23:39:24,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:24,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:24,191 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] [2024-11-16 23:39:24,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 481650539, now seen corresponding path program 1 times [2024-11-16 23:39:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:24,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957965186] [2024-11-16 23:39:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:24,643 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-16 23:39:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957965186] [2024-11-16 23:39:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957965186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621636166] [2024-11-16 23:39:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:24,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:24,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 267 [2024-11-16 23:39:24,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 267 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 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-16 23:39:24,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:24,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 267 [2024-11-16 23:39:24,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:25,974 INFO L124 PetriNetUnfolderBase]: 1710/6442 cut-off events. [2024-11-16 23:39:25,974 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-16 23:39:25,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9157 conditions, 6442 events. 1710/6442 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 62607 event pairs, 222 based on Foata normal form. 1922/7745 useless extension candidates. Maximal degree in co-relation 1185. Up to 1840 conditions per place. [2024-11-16 23:39:26,028 INFO L140 encePairwiseOnDemand]: 243/267 looper letters, 80 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2024-11-16 23:39:26,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 294 transitions, 774 flow [2024-11-16 23:39:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2024-11-16 23:39:26,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8813982521847691 [2024-11-16 23:39:26,032 INFO L175 Difference]: Start difference. First operand has 249 places, 267 transitions, 550 flow. Second operand 6 states and 1412 transitions. [2024-11-16 23:39:26,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 294 transitions, 774 flow [2024-11-16 23:39:26,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 294 transitions, 774 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:26,040 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 518 flow [2024-11-16 23:39:26,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2024-11-16 23:39:26,043 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, 2 predicate places. [2024-11-16 23:39:26,044 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 518 flow [2024-11-16 23:39:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 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-16 23:39:26,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:26,045 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] [2024-11-16 23:39:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:39:26,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1512944111, now seen corresponding path program 1 times [2024-11-16 23:39:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685484050] [2024-11-16 23:39:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:26,121 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-16 23:39:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:26,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685484050] [2024-11-16 23:39:26,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685484050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:26,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:26,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:26,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934739424] [2024-11-16 23:39:26,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:26,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:26,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:26,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 267 [2024-11-16 23:39:26,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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-16 23:39:26,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:26,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 267 [2024-11-16 23:39:26,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:27,377 INFO L124 PetriNetUnfolderBase]: 973/4979 cut-off events. [2024-11-16 23:39:27,377 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-16 23:39:27,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 4979 events. 973/4979 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 47568 event pairs, 334 based on Foata normal form. 1/4450 useless extension candidates. Maximal degree in co-relation 848. Up to 1404 conditions per place. [2024-11-16 23:39:27,416 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 31 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-11-16 23:39:27,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 253 transitions, 600 flow [2024-11-16 23:39:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-11-16 23:39:27,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8739076154806492 [2024-11-16 23:39:27,420 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 518 flow. Second operand 3 states and 700 transitions. [2024-11-16 23:39:27,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 253 transitions, 600 flow [2024-11-16 23:39:27,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 253 transitions, 588 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:27,426 INFO L231 Difference]: Finished difference. Result has 249 places, 247 transitions, 520 flow [2024-11-16 23:39:27,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2024-11-16 23:39:27,428 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, 0 predicate places. [2024-11-16 23:39:27,429 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 520 flow [2024-11-16 23:39:27,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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-16 23:39:27,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:27,430 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] [2024-11-16 23:39:27,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:39:27,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:27,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2079223122, now seen corresponding path program 1 times [2024-11-16 23:39:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695048328] [2024-11-16 23:39:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:27,497 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-16 23:39:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:27,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695048328] [2024-11-16 23:39:27,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695048328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:27,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757741744] [2024-11-16 23:39:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:27,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:27,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 267 [2024-11-16 23:39:27,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-16 23:39:27,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:27,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 267 [2024-11-16 23:39:27,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:30,221 INFO L124 PetriNetUnfolderBase]: 4720/15863 cut-off events. [2024-11-16 23:39:30,222 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-16 23:39:30,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23170 conditions, 15863 events. 4720/15863 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 177911 event pairs, 1586 based on Foata normal form. 0/14049 useless extension candidates. Maximal degree in co-relation 23058. Up to 3665 conditions per place. [2024-11-16 23:39:30,342 INFO L140 encePairwiseOnDemand]: 248/267 looper letters, 58 selfloop transitions, 14 changer transitions 0/280 dead transitions. [2024-11-16 23:39:30,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 280 transitions, 741 flow [2024-11-16 23:39:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-11-16 23:39:30,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8789013732833958 [2024-11-16 23:39:30,345 INFO L175 Difference]: Start difference. First operand has 249 places, 247 transitions, 520 flow. Second operand 3 states and 704 transitions. [2024-11-16 23:39:30,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 280 transitions, 741 flow [2024-11-16 23:39:30,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 280 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:39:30,351 INFO L231 Difference]: Finished difference. Result has 252 places, 261 transitions, 640 flow [2024-11-16 23:39:30,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=252, PETRI_TRANSITIONS=261} [2024-11-16 23:39:30,352 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, 3 predicate places. [2024-11-16 23:39:30,353 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 261 transitions, 640 flow [2024-11-16 23:39:30,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-16 23:39:30,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:30,354 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] [2024-11-16 23:39:30,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:39:30,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:30,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2125341263, now seen corresponding path program 1 times [2024-11-16 23:39:30,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739272652] [2024-11-16 23:39:30,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:30,415 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-16 23:39:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:30,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739272652] [2024-11-16 23:39:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739272652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:30,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:30,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296379217] [2024-11-16 23:39:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:30,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:30,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:30,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:30,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:30,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2024-11-16 23:39:30,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 261 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-16 23:39:30,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:30,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2024-11-16 23:39:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:33,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][244], [247#true, Black: 260#(= |ULTIMATE.start_main_~i~1#1| 0), 262#true, 249#true, Black: 264#(= |#race~global~0| 0), 174#L952-4true, 267#true]) [2024-11-16 23:39:33,555 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-11-16 23:39:33,555 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-16 23:39:33,559 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:39:33,559 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-16 23:39:33,610 INFO L124 PetriNetUnfolderBase]: 4851/18946 cut-off events. [2024-11-16 23:39:33,615 INFO L125 PetriNetUnfolderBase]: For 4547/4742 co-relation queries the response was YES. [2024-11-16 23:39:33,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30365 conditions, 18946 events. 4851/18946 cut-off events. For 4547/4742 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 230078 event pairs, 2188 based on Foata normal form. 49/16986 useless extension candidates. Maximal degree in co-relation 15267. Up to 6105 conditions per place. [2024-11-16 23:39:33,911 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 52 selfloop transitions, 14 changer transitions 0/285 dead transitions. [2024-11-16 23:39:33,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 285 transitions, 858 flow [2024-11-16 23:39:33,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-11-16 23:39:33,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8714107365792759 [2024-11-16 23:39:33,915 INFO L175 Difference]: Start difference. First operand has 252 places, 261 transitions, 640 flow. Second operand 3 states and 698 transitions. [2024-11-16 23:39:33,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 285 transitions, 858 flow [2024-11-16 23:39:33,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 285 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:33,941 INFO L231 Difference]: Finished difference. Result has 254 places, 273 transitions, 738 flow [2024-11-16 23:39:33,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=254, PETRI_TRANSITIONS=273} [2024-11-16 23:39:33,942 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, 5 predicate places. [2024-11-16 23:39:33,943 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 273 transitions, 738 flow [2024-11-16 23:39:33,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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-16 23:39:33,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:33,945 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:39:33,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:39:33,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1398444852, now seen corresponding path program 1 times [2024-11-16 23:39:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998533820] [2024-11-16 23:39:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998533820] [2024-11-16 23:39:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998533820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:39:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497651352] [2024-11-16 23:39:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:34,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:39:34,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 23:39:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:34,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 23:39:34,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:39:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:39:34,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:39:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497651352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:34,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:39:34,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 23:39:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063703396] [2024-11-16 23:39:34,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:34,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:34,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:34,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:34,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 267 [2024-11-16 23:39:34,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 273 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-16 23:39:34,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:34,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 267 [2024-11-16 23:39:34,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:37,529 INFO L124 PetriNetUnfolderBase]: 5830/27971 cut-off events. [2024-11-16 23:39:37,529 INFO L125 PetriNetUnfolderBase]: For 3220/4319 co-relation queries the response was YES. [2024-11-16 23:39:37,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41901 conditions, 27971 events. 5830/27971 cut-off events. For 3220/4319 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 375492 event pairs, 2495 based on Foata normal form. 129/25330 useless extension candidates. Maximal degree in co-relation 39528. Up to 3424 conditions per place. [2024-11-16 23:39:37,752 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 42 selfloop transitions, 3 changer transitions 0/292 dead transitions. [2024-11-16 23:39:37,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 292 transitions, 872 flow [2024-11-16 23:39:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2024-11-16 23:39:37,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-16 23:39:37,756 INFO L175 Difference]: Start difference. First operand has 254 places, 273 transitions, 738 flow. Second operand 3 states and 712 transitions. [2024-11-16 23:39:37,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 292 transitions, 872 flow [2024-11-16 23:39:37,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 292 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:37,782 INFO L231 Difference]: Finished difference. Result has 256 places, 275 transitions, 732 flow [2024-11-16 23:39:37,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=256, PETRI_TRANSITIONS=275} [2024-11-16 23:39:37,784 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, 7 predicate places. [2024-11-16 23:39:37,784 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 275 transitions, 732 flow [2024-11-16 23:39:37,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-16 23:39:37,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:37,785 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:39:37,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 23:39:37,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 23:39:37,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -959020774, now seen corresponding path program 1 times [2024-11-16 23:39:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115780917] [2024-11-16 23:39:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115780917] [2024-11-16 23:39:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115780917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:39:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294866526] [2024-11-16 23:39:38,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:38,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:38,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:38,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:39:38,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 23:39:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:38,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 23:39:38,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:39:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:39:38,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:39:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294866526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:38,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:39:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 23:39:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683394730] [2024-11-16 23:39:38,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:38,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:38,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:38,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 267 [2024-11-16 23:39:38,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 275 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-16 23:39:38,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:38,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 267 [2024-11-16 23:39:38,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:42,255 INFO L124 PetriNetUnfolderBase]: 6115/30098 cut-off events. [2024-11-16 23:39:42,256 INFO L125 PetriNetUnfolderBase]: For 5734/6222 co-relation queries the response was YES. [2024-11-16 23:39:42,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45996 conditions, 30098 events. 6115/30098 cut-off events. For 5734/6222 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 406391 event pairs, 3054 based on Foata normal form. 135/26968 useless extension candidates. Maximal degree in co-relation 43545. Up to 6042 conditions per place. [2024-11-16 23:39:42,509 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 42 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-11-16 23:39:42,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 291 transitions, 860 flow [2024-11-16 23:39:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-11-16 23:39:42,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.885143570536829 [2024-11-16 23:39:42,513 INFO L175 Difference]: Start difference. First operand has 256 places, 275 transitions, 732 flow. Second operand 3 states and 709 transitions. [2024-11-16 23:39:42,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 291 transitions, 860 flow [2024-11-16 23:39:42,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 291 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:42,539 INFO L231 Difference]: Finished difference. Result has 257 places, 276 transitions, 740 flow [2024-11-16 23:39:42,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=257, PETRI_TRANSITIONS=276} [2024-11-16 23:39:42,540 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, 8 predicate places. [2024-11-16 23:39:42,540 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 276 transitions, 740 flow [2024-11-16 23:39:42,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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-16 23:39:42,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:42,542 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:39:42,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 23:39:42,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 23:39:42,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1362228006, now seen corresponding path program 1 times [2024-11-16 23:39:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:42,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516216397] [2024-11-16 23:39:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516216397] [2024-11-16 23:39:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516216397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:39:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781847022] [2024-11-16 23:39:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:43,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:43,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:43,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:39:43,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 23:39:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:43,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:39:43,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:39:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:43,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:39:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781847022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:39:43,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:39:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 23:39:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841015712] [2024-11-16 23:39:43,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:39:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:39:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:43,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:39:43,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:39:43,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2024-11-16 23:39:43,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 276 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 221.3) internal successors, (2213), 10 states have internal predecessors, (2213), 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-16 23:39:43,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:43,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2024-11-16 23:39:43,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:45,090 INFO L124 PetriNetUnfolderBase]: 788/3961 cut-off events. [2024-11-16 23:39:45,090 INFO L125 PetriNetUnfolderBase]: For 426/441 co-relation queries the response was YES. [2024-11-16 23:39:45,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 3961 events. 788/3961 cut-off events. For 426/441 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 35624 event pairs, 83 based on Foata normal form. 114/3819 useless extension candidates. Maximal degree in co-relation 5938. Up to 514 conditions per place. [2024-11-16 23:39:45,141 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 72 selfloop transitions, 7 changer transitions 0/268 dead transitions. [2024-11-16 23:39:45,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 268 transitions, 820 flow [2024-11-16 23:39:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:39:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:39:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2052 transitions. [2024-11-16 23:39:45,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2024-11-16 23:39:45,160 INFO L175 Difference]: Start difference. First operand has 257 places, 276 transitions, 740 flow. Second operand 9 states and 2052 transitions. [2024-11-16 23:39:45,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 268 transitions, 820 flow [2024-11-16 23:39:45,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 268 transitions, 820 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:45,188 INFO L231 Difference]: Finished difference. Result has 211 places, 212 transitions, 564 flow [2024-11-16 23:39:45,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=564, PETRI_PLACES=211, PETRI_TRANSITIONS=212} [2024-11-16 23:39:45,191 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, -38 predicate places. [2024-11-16 23:39:45,195 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 212 transitions, 564 flow [2024-11-16 23:39:45,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.3) internal successors, (2213), 10 states have internal predecessors, (2213), 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-16 23:39:45,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:45,198 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-16 23:39:45,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 23:39:45,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:45,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 750223486, now seen corresponding path program 1 times [2024-11-16 23:39:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996613932] [2024-11-16 23:39:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:39:45,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996613932] [2024-11-16 23:39:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996613932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:45,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:45,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212121828] [2024-11-16 23:39:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:45,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:45,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:45,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2024-11-16 23:39:45,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 212 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:39:45,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:45,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2024-11-16 23:39:45,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:46,037 INFO L124 PetriNetUnfolderBase]: 260/1387 cut-off events. [2024-11-16 23:39:46,038 INFO L125 PetriNetUnfolderBase]: For 459/480 co-relation queries the response was YES. [2024-11-16 23:39:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1387 events. 260/1387 cut-off events. For 459/480 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8988 event pairs, 132 based on Foata normal form. 7/1300 useless extension candidates. Maximal degree in co-relation 2424. Up to 459 conditions per place. [2024-11-16 23:39:46,053 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 42 selfloop transitions, 12 changer transitions 0/226 dead transitions. [2024-11-16 23:39:46,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 226 transitions, 716 flow [2024-11-16 23:39:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 684 transitions. [2024-11-16 23:39:46,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2024-11-16 23:39:46,057 INFO L175 Difference]: Start difference. First operand has 211 places, 212 transitions, 564 flow. Second operand 3 states and 684 transitions. [2024-11-16 23:39:46,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 226 transitions, 716 flow [2024-11-16 23:39:46,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 226 transitions, 701 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:46,063 INFO L231 Difference]: Finished difference. Result has 210 places, 220 transitions, 647 flow [2024-11-16 23:39:46,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=210, PETRI_TRANSITIONS=220} [2024-11-16 23:39:46,064 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, -39 predicate places. [2024-11-16 23:39:46,064 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 220 transitions, 647 flow [2024-11-16 23:39:46,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:39:46,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:46,066 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] [2024-11-16 23:39:46,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:39:46,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:46,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1988944909, now seen corresponding path program 1 times [2024-11-16 23:39:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:46,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367795351] [2024-11-16 23:39:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:46,134 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-16 23:39:46,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367795351] [2024-11-16 23:39:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367795351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:46,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656469283] [2024-11-16 23:39:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:46,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:46,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2024-11-16 23:39:46,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 220 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-16 23:39:46,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:46,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2024-11-16 23:39:46,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:46,517 INFO L124 PetriNetUnfolderBase]: 291/1462 cut-off events. [2024-11-16 23:39:46,518 INFO L125 PetriNetUnfolderBase]: For 1149/1184 co-relation queries the response was YES. [2024-11-16 23:39:46,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 1462 events. 291/1462 cut-off events. For 1149/1184 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9635 event pairs, 134 based on Foata normal form. 9/1393 useless extension candidates. Maximal degree in co-relation 2881. Up to 501 conditions per place. [2024-11-16 23:39:46,528 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 49 selfloop transitions, 12 changer transitions 0/235 dead transitions. [2024-11-16 23:39:46,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 235 transitions, 836 flow [2024-11-16 23:39:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2024-11-16 23:39:46,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8551810237203495 [2024-11-16 23:39:46,530 INFO L175 Difference]: Start difference. First operand has 210 places, 220 transitions, 647 flow. Second operand 3 states and 685 transitions. [2024-11-16 23:39:46,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 235 transitions, 836 flow [2024-11-16 23:39:46,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 235 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:46,536 INFO L231 Difference]: Finished difference. Result has 212 places, 228 transitions, 733 flow [2024-11-16 23:39:46,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=212, PETRI_TRANSITIONS=228} [2024-11-16 23:39:46,538 INFO L277 CegarLoopForPetriNet]: 249 programPoint places, -37 predicate places. [2024-11-16 23:39:46,538 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 228 transitions, 733 flow [2024-11-16 23:39:46,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-16 23:39:46,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:46,539 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 23:39:46,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:39:46,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash 419977531, now seen corresponding path program 1 times [2024-11-16 23:39:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:46,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659573705] [2024-11-16 23:39:46,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:46,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:39:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:46,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:39:46,616 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:39:46,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-16 23:39:46,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-16 23:39:46,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-16 23:39:46,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-16 23:39:46,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-16 23:39:46,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-16 23:39:46,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-16 23:39:46,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-16 23:39:46,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-16 23:39:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:39:46,619 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:46,620 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:39:46,620 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:39:46,659 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:39:46,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 318 transitions, 663 flow [2024-11-16 23:39:46,761 INFO L124 PetriNetUnfolderBase]: 66/639 cut-off events. [2024-11-16 23:39:46,761 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 23:39:46,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 639 events. 66/639 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2244 event pairs, 1 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 448. Up to 16 conditions per place. [2024-11-16 23:39:46,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 318 transitions, 663 flow [2024-11-16 23:39:46,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 318 transitions, 663 flow [2024-11-16 23:39:46,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:46,777 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;@5bfb9f5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:46,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-16 23:39:46,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:46,784 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2024-11-16 23:39:46,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:46,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:46,784 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] [2024-11-16 23:39:46,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:39:46,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:46,785 INFO L85 PathProgramCache]: Analyzing trace with hash 685634729, now seen corresponding path program 1 times [2024-11-16 23:39:46,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:46,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210019745] [2024-11-16 23:39:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:47,174 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-16 23:39:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210019745] [2024-11-16 23:39:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210019745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514827623] [2024-11-16 23:39:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:47,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 318 [2024-11-16 23:39:47,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 318 transitions, 663 flow. Second operand has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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-16 23:39:47,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:47,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 318 [2024-11-16 23:39:47,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:58,702 INFO L124 PetriNetUnfolderBase]: 20843/71515 cut-off events. [2024-11-16 23:39:58,703 INFO L125 PetriNetUnfolderBase]: For 1109/1111 co-relation queries the response was YES. [2024-11-16 23:39:58,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100626 conditions, 71515 events. 20843/71515 cut-off events. For 1109/1111 co-relation queries the response was YES. Maximal size of possible extension queue 1532. Compared 985522 event pairs, 7236 based on Foata normal form. 21982/86612 useless extension candidates. Maximal degree in co-relation 11759. Up to 20807 conditions per place. [2024-11-16 23:39:59,288 INFO L140 encePairwiseOnDemand]: 288/318 looper letters, 112 selfloop transitions, 5 changer transitions 0/363 dead transitions. [2024-11-16 23:39:59,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 363 transitions, 987 flow [2024-11-16 23:39:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1696 transitions. [2024-11-16 23:39:59,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-16 23:39:59,297 INFO L175 Difference]: Start difference. First operand has 295 places, 318 transitions, 663 flow. Second operand 6 states and 1696 transitions. [2024-11-16 23:39:59,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 363 transitions, 987 flow [2024-11-16 23:39:59,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 363 transitions, 987 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:59,328 INFO L231 Difference]: Finished difference. Result has 297 places, 291 transitions, 619 flow [2024-11-16 23:39:59,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=297, PETRI_TRANSITIONS=291} [2024-11-16 23:39:59,331 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 2 predicate places. [2024-11-16 23:39:59,331 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 291 transitions, 619 flow [2024-11-16 23:39:59,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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-16 23:39:59,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:59,332 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] [2024-11-16 23:39:59,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:39:59,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:39:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1998347887, now seen corresponding path program 1 times [2024-11-16 23:39:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:59,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458418710] [2024-11-16 23:39:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:59,419 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-16 23:39:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458418710] [2024-11-16 23:39:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458418710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859679425] [2024-11-16 23:39:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:59,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:59,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:59,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 318 [2024-11-16 23:39:59,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 291 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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-16 23:39:59,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:59,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 318 [2024-11-16 23:39:59,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:03,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([989] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][190], [220#ULTIMATE.startFINALtrue, 298#true, 141#L939-36true, 292#true, 294#true, 304#true, 100#L939-36true, 295#true]) [2024-11-16 23:40:03,890 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-16 23:40:03,890 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-16 23:40:03,890 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-16 23:40:03,890 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-16 23:40:04,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([989] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][190], [220#ULTIMATE.startFINALtrue, 298#true, 292#true, 294#true, 304#true, 100#L939-36true, 82#L939-23true, 295#true]) [2024-11-16 23:40:04,537 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-11-16 23:40:04,537 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-16 23:40:04,537 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:40:04,537 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-16 23:40:04,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([989] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][190], [220#ULTIMATE.startFINALtrue, 298#true, 292#true, 294#true, 221#L939-17true, 304#true, 100#L939-36true, 295#true]) [2024-11-16 23:40:04,651 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2024-11-16 23:40:04,651 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:40:04,652 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-16 23:40:04,652 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-16 23:40:04,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([989] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][190], [220#ULTIMATE.startFINALtrue, 298#true, 83#L939-4true, 292#true, 294#true, 304#true, 100#L939-36true, 295#true]) [2024-11-16 23:40:04,859 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2024-11-16 23:40:04,859 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:40:04,859 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-16 23:40:04,859 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-16 23:40:04,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([989] L-1-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_1|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_1|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_1|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_1|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_1|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_1|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_1|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_1|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_1|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_1|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_1|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_1|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_1|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][190], [220#ULTIMATE.startFINALtrue, 298#true, 292#true, 164#L940true, 294#true, 304#true, 100#L939-36true, 295#true]) [2024-11-16 23:40:04,911 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-11-16 23:40:04,911 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:40:04,911 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:40:04,911 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-16 23:40:04,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1210] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][285], [298#true, 292#true, 304#true, 100#L939-36true, 187#L952-4true, 293#true, 295#true]) [2024-11-16 23:40:04,928 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2024-11-16 23:40:04,928 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:40:04,928 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:40:04,928 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-16 23:40:05,028 INFO L124 PetriNetUnfolderBase]: 10700/39858 cut-off events. [2024-11-16 23:40:05,028 INFO L125 PetriNetUnfolderBase]: For 2245/2245 co-relation queries the response was YES. [2024-11-16 23:40:05,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55473 conditions, 39858 events. 10700/39858 cut-off events. For 2245/2245 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 522089 event pairs, 8207 based on Foata normal form. 1/35930 useless extension candidates. Maximal degree in co-relation 40530. Up to 14448 conditions per place. [2024-11-16 23:40:05,331 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 39 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-11-16 23:40:05,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 298 transitions, 717 flow [2024-11-16 23:40:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 819 transitions. [2024-11-16 23:40:05,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8584905660377359 [2024-11-16 23:40:05,334 INFO L175 Difference]: Start difference. First operand has 297 places, 291 transitions, 619 flow. Second operand 3 states and 819 transitions. [2024-11-16 23:40:05,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 298 transitions, 717 flow [2024-11-16 23:40:05,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 298 transitions, 705 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:40:05,340 INFO L231 Difference]: Finished difference. Result has 295 places, 292 transitions, 621 flow [2024-11-16 23:40:05,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=295, PETRI_TRANSITIONS=292} [2024-11-16 23:40:05,341 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 0 predicate places. [2024-11-16 23:40:05,341 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 292 transitions, 621 flow [2024-11-16 23:40:05,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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-16 23:40:05,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:05,342 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] [2024-11-16 23:40:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:40:05,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:40:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1107190305, now seen corresponding path program 1 times [2024-11-16 23:40:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034919607] [2024-11-16 23:40:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:05,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:05,396 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-16 23:40:05,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:05,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034919607] [2024-11-16 23:40:05,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034919607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:05,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:05,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:05,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991988877] [2024-11-16 23:40:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:05,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:05,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:05,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:05,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 318 [2024-11-16 23:40:05,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-16 23:40:05,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:05,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 318 [2024-11-16 23:40:05,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:07,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 304#true, 187#L952-4true, 295#true, 293#true]) [2024-11-16 23:40:07,362 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is not cut-off event [2024-11-16 23:40:07,363 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2024-11-16 23:40:07,363 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2024-11-16 23:40:07,363 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is not cut-off event [2024-11-16 23:40:11,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 187#L952-4true, 295#true, 81#t_funENTRYtrue]) [2024-11-16 23:40:11,390 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is not cut-off event [2024-11-16 23:40:11,390 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-16 23:40:11,390 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-16 23:40:11,390 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2024-11-16 23:40:11,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 169#L938true, 187#L952-4true, 295#true]) [2024-11-16 23:40:11,391 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-16 23:40:11,391 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:40:11,391 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-11-16 23:40:11,391 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:40:11,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1210] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][308], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 292#true, 304#true, 187#L952-4true, 52#t_funENTRYtrue, 295#true, 293#true]) [2024-11-16 23:40:11,399 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is not cut-off event [2024-11-16 23:40:11,399 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-16 23:40:11,399 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-16 23:40:11,399 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2024-11-16 23:40:11,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1210] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][308], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 292#true, 304#true, 187#L952-4true, 280#L938true, 295#true, 293#true]) [2024-11-16 23:40:11,720 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-11-16 23:40:11,720 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:40:11,720 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:40:11,720 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-16 23:40:13,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 141#L939-36true, 294#true, 304#true, 187#L952-4true, 295#true]) [2024-11-16 23:40:13,742 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-16 23:40:13,742 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-16 23:40:13,742 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:40:13,742 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:40:13,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1210] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][308], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 292#true, 304#true, 100#L939-36true, 187#L952-4true, 293#true, 295#true]) [2024-11-16 23:40:13,745 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-16 23:40:13,745 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-11-16 23:40:13,745 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:40:13,745 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-16 23:40:14,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][318], [310#(= |#race~global~0| 0), Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 186#L939-34true, 187#L952-4true, 295#true]) [2024-11-16 23:40:14,913 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-11-16 23:40:14,913 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-11-16 23:40:14,913 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-11-16 23:40:14,913 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-16 23:40:15,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][318], [310#(= |#race~global~0| 0), Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 192#L939-33true, 187#L952-4true, 295#true]) [2024-11-16 23:40:15,469 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-16 23:40:15,469 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-16 23:40:15,470 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-16 23:40:15,470 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-16 23:40:15,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 186#L939-34true, 187#L952-4true, 295#true]) [2024-11-16 23:40:15,470 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is not cut-off event [2024-11-16 23:40:15,470 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-11-16 23:40:15,470 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is not cut-off event [2024-11-16 23:40:15,471 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-11-16 23:40:15,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 187#L952-4true, 71#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 295#true]) [2024-11-16 23:40:15,471 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-16 23:40:15,471 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-16 23:40:15,471 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-16 23:40:15,471 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-16 23:40:15,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 192#L939-33true, 304#true, 187#L952-4true, 295#true]) [2024-11-16 23:40:15,908 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is not cut-off event [2024-11-16 23:40:15,908 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is not cut-off event [2024-11-16 23:40:15,908 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-16 23:40:15,908 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-16 23:40:18,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1209] t_funEXIT-->L952-4: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][258], [30#L939-29true, 308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 291#true, 294#true, 304#true, 187#L952-4true, 295#true]) [2024-11-16 23:40:18,037 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-11-16 23:40:18,037 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-11-16 23:40:18,037 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2024-11-16 23:40:18,038 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2024-11-16 23:40:18,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1210] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][308], [308#true, Black: 306#(= |ULTIMATE.start_main_~i~1#1| 0), 292#true, 304#true, 11#L939-29true, 187#L952-4true, 295#true, 293#true]) [2024-11-16 23:40:18,503 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is not cut-off event [2024-11-16 23:40:18,503 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event [2024-11-16 23:40:18,503 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2024-11-16 23:40:18,503 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is not cut-off event