./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:33,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:33,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:33,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:33,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:33,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:33,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:33,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:33,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:33,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:33,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:33,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:33,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:33,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:33,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:33,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:33,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:33,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:33,285 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2025-04-30 10:26:33,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:33,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:33,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:33,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:33,514 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:33,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2025-04-30 10:26:34,834 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141b0de7d/065868f835834c2e89f962ad2a67f4e5/FLAGd75ef962c [2025-04-30 10:26:35,123 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:35,127 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2025-04-30 10:26:35,143 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141b0de7d/065868f835834c2e89f962ad2a67f4e5/FLAGd75ef962c [2025-04-30 10:26:35,882 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141b0de7d/065868f835834c2e89f962ad2a67f4e5 [2025-04-30 10:26:35,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:35,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:35,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:35,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:35,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:35,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:35" (1/1) ... [2025-04-30 10:26:35,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57873117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:35, skipping insertion in model container [2025-04-30 10:26:35,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:35" (1/1) ... [2025-04-30 10:26:35,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:36,211 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:36,237 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:36,307 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:36,344 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:36,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36 WrapperNode [2025-04-30 10:26:36,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:36,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:36,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:36,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:36,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,384 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2025-04-30 10:26:36,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:36,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:36,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:36,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:36,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:36,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:36,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:36,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:36,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (1/1) ... [2025-04-30 10:26:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:36,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:36,442 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) [2025-04-30 10:26:36,446 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 [2025-04-30 10:26:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:36,459 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:36,460 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:36,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:36,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:36,460 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:36,560 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:36,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:36,835 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:36,837 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:36,854 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:36,855 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:36,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:36 BoogieIcfgContainer [2025-04-30 10:26:36,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:36,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:36,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:36,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:36,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:35" (1/3) ... [2025-04-30 10:26:36,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30be79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:36, skipping insertion in model container [2025-04-30 10:26:36,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:36" (2/3) ... [2025-04-30 10:26:36,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30be79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:36, skipping insertion in model container [2025-04-30 10:26:36,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:36" (3/3) ... [2025-04-30 10:26:36,863 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-04-30 10:26:36,873 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:36,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 157 locations, 158 edges, 1 initial locations, 3 loop locations, and 4 error locations. [2025-04-30 10:26:36,875 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:36,948 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:36,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 159 transitions, 322 flow [2025-04-30 10:26:37,036 INFO L116 PetriNetUnfolderBase]: 3/158 cut-off events. [2025-04-30 10:26:37,038 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:37,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 3/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-04-30 10:26:37,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 159 transitions, 322 flow [2025-04-30 10:26:37,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 319 flow [2025-04-30 10:26:37,050 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:37,059 INFO L340 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;@236ed239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:37,059 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:26:37,081 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:37,081 INFO L116 PetriNetUnfolderBase]: 1/116 cut-off events. [2025-04-30 10:26:37,081 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:37,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:37,083 INFO L206 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] [2025-04-30 10:26:37,083 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:37,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:37,089 INFO L85 PathProgramCache]: Analyzing trace with hash 18307895, now seen corresponding path program 1 times [2025-04-30 10:26:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:37,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200859574] [2025-04-30 10:26:37,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:37,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-30 10:26:37,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:26:37,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:37,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:37,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200859574] [2025-04-30 10:26:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200859574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:37,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264696683] [2025-04-30 10:26:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:37,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:37,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:37,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:37,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 159 [2025-04-30 10:26:37,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 158 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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) [2025-04-30 10:26:37,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:37,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 159 [2025-04-30 10:26:37,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:37,506 INFO L116 PetriNetUnfolderBase]: 11/244 cut-off events. [2025-04-30 10:26:37,509 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:37,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 244 events. 11/244 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 392 event pairs, 6 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 179. Up to 26 conditions per place. [2025-04-30 10:26:37,512 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-04-30 10:26:37,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 345 flow [2025-04-30 10:26:37,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-04-30 10:26:37,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9580712788259959 [2025-04-30 10:26:37,530 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 319 flow. Second operand 3 states and 457 transitions. [2025-04-30 10:26:37,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 345 flow [2025-04-30 10:26:37,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:37,540 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 330 flow [2025-04-30 10:26:37,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-04-30 10:26:37,546 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 2 predicate places. [2025-04-30 10:26:37,547 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 330 flow [2025-04-30 10:26:37,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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) [2025-04-30 10:26:37,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:37,548 INFO L206 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] [2025-04-30 10:26:37,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:37,549 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:37,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 50563245, now seen corresponding path program 1 times [2025-04-30 10:26:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:37,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825456315] [2025-04-30 10:26:37,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:37,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-30 10:26:37,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:26:37,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:37,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:37,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825456315] [2025-04-30 10:26:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825456315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:37,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388097260] [2025-04-30 10:26:37,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:37,790 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) [2025-04-30 10:26:37,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:26:37,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-30 10:26:37,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:26:37,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:37,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:37,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:26:37,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388097260] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:37,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:26:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19239100] [2025-04-30 10:26:37,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:37,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:38,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:38,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:38,033 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-04-30 10:26:38,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 330 flow. Second operand has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 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) [2025-04-30 10:26:38,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:38,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-04-30 10:26:38,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:38,140 INFO L116 PetriNetUnfolderBase]: 11/251 cut-off events. [2025-04-30 10:26:38,140 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:38,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 251 events. 11/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 386 event pairs, 6 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 217. Up to 26 conditions per place. [2025-04-30 10:26:38,143 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 14 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2025-04-30 10:26:38,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 167 transitions, 394 flow [2025-04-30 10:26:38,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1330 transitions. [2025-04-30 10:26:38,150 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9294199860237596 [2025-04-30 10:26:38,150 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 330 flow. Second operand 9 states and 1330 transitions. [2025-04-30 10:26:38,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 167 transitions, 394 flow [2025-04-30 10:26:38,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 167 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:38,156 INFO L231 Difference]: Finished difference. Result has 171 places, 165 transitions, 378 flow [2025-04-30 10:26:38,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2025-04-30 10:26:38,158 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 12 predicate places. [2025-04-30 10:26:38,158 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 378 flow [2025-04-30 10:26:38,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 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) [2025-04-30 10:26:38,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:38,159 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:38,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:26:38,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:38,364 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:38,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash -800441843, now seen corresponding path program 2 times [2025-04-30 10:26:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:38,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710658529] [2025-04-30 10:26:38,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:38,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-04-30 10:26:38,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-04-30 10:26:38,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:38,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:38,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710658529] [2025-04-30 10:26:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710658529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:38,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449801138] [2025-04-30 10:26:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:38,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:38,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:38,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:39,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-04-30 10:26:39,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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) [2025-04-30 10:26:39,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:39,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-04-30 10:26:39,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:39,235 INFO L116 PetriNetUnfolderBase]: 150/828 cut-off events. [2025-04-30 10:26:39,235 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:26:39,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 828 events. 150/828 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4556 event pairs, 62 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1045. Up to 240 conditions per place. [2025-04-30 10:26:39,244 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 30 selfloop transitions, 22 changer transitions 0/194 dead transitions. [2025-04-30 10:26:39,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 194 transitions, 540 flow [2025-04-30 10:26:39,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-04-30 10:26:39,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-04-30 10:26:39,247 INFO L175 Difference]: Start difference. First operand has 171 places, 165 transitions, 378 flow. Second operand 6 states and 869 transitions. [2025-04-30 10:26:39,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 194 transitions, 540 flow [2025-04-30 10:26:39,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:39,251 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 522 flow [2025-04-30 10:26:39,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2025-04-30 10:26:39,252 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 21 predicate places. [2025-04-30 10:26:39,252 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 522 flow [2025-04-30 10:26:39,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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) [2025-04-30 10:26:39,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:39,253 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:39,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:39,253 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:39,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2000203992, now seen corresponding path program 1 times [2025-04-30 10:26:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:39,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449843894] [2025-04-30 10:26:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:39,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:26:39,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:26:39,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:39,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:39,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449843894] [2025-04-30 10:26:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449843894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:39,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337971898] [2025-04-30 10:26:39,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:39,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:39,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:39,413 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) [2025-04-30 10:26:39,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:26:39,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-30 10:26:39,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-30 10:26:39,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:39,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:39,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:26:39,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:39,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:39,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337971898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:39,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:39,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:26:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971611968] [2025-04-30 10:26:39,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:39,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:26:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:39,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:26:39,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:26:39,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-04-30 10:26:39,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 522 flow. Second operand has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 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) [2025-04-30 10:26:39,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:39,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-04-30 10:26:39,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:39,895 INFO L116 PetriNetUnfolderBase]: 58/571 cut-off events. [2025-04-30 10:26:39,896 INFO L117 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-04-30 10:26:39,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 571 events. 58/571 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2205 event pairs, 11 based on Foata normal form. 4/540 useless extension candidates. Maximal degree in co-relation 669. Up to 63 conditions per place. [2025-04-30 10:26:39,899 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 18 selfloop transitions, 21 changer transitions 0/204 dead transitions. [2025-04-30 10:26:39,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 204 transitions, 688 flow [2025-04-30 10:26:39,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3088 transitions. [2025-04-30 10:26:39,904 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2025-04-30 10:26:39,905 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 522 flow. Second operand 21 states and 3088 transitions. [2025-04-30 10:26:39,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 204 transitions, 688 flow [2025-04-30 10:26:39,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 204 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:39,910 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 652 flow [2025-04-30 10:26:39,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=652, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2025-04-30 10:26:39,911 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 46 predicate places. [2025-04-30 10:26:39,911 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 652 flow [2025-04-30 10:26:39,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 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) [2025-04-30 10:26:39,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:39,913 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:39,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:40,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:26:40,118 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:40,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash -716699160, now seen corresponding path program 2 times [2025-04-30 10:26:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:40,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777297963] [2025-04-30 10:26:40,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:40,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-04-30 10:26:40,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-04-30 10:26:40,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:40,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-30 10:26:40,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:40,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777297963] [2025-04-30 10:26:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777297963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:40,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800196901] [2025-04-30 10:26:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:40,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:40,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:40,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:40,562 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-04-30 10:26:40,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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) [2025-04-30 10:26:40,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:40,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-04-30 10:26:40,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:40,718 INFO L116 PetriNetUnfolderBase]: 206/1098 cut-off events. [2025-04-30 10:26:40,719 INFO L117 PetriNetUnfolderBase]: For 224/244 co-relation queries the response was YES. [2025-04-30 10:26:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1098 events. 206/1098 cut-off events. For 224/244 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6592 event pairs, 62 based on Foata normal form. 5/1041 useless extension candidates. Maximal degree in co-relation 1691. Up to 330 conditions per place. [2025-04-30 10:26:40,724 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 47 selfloop transitions, 30 changer transitions 0/236 dead transitions. [2025-04-30 10:26:40,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 236 transitions, 922 flow [2025-04-30 10:26:40,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-04-30 10:26:40,728 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-04-30 10:26:40,728 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 652 flow. Second operand 6 states and 869 transitions. [2025-04-30 10:26:40,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 236 transitions, 922 flow [2025-04-30 10:26:40,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 236 transitions, 898 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:26:40,735 INFO L231 Difference]: Finished difference. Result has 209 places, 228 transitions, 878 flow [2025-04-30 10:26:40,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=209, PETRI_TRANSITIONS=228} [2025-04-30 10:26:40,736 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 50 predicate places. [2025-04-30 10:26:40,736 INFO L485 AbstractCegarLoop]: Abstraction has has 209 places, 228 transitions, 878 flow [2025-04-30 10:26:40,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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) [2025-04-30 10:26:40,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:40,737 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:40,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:40,737 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:40,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1826944472, now seen corresponding path program 1 times [2025-04-30 10:26:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:40,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243298091] [2025-04-30 10:26:40,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:40,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-04-30 10:26:40,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-04-30 10:26:40,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:40,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:41,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:41,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243298091] [2025-04-30 10:26:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243298091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:41,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616841834] [2025-04-30 10:26:41,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:41,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:41,014 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) [2025-04-30 10:26:41,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:26:41,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-04-30 10:26:41,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-04-30 10:26:41,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:41,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:41,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:26:41,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:41,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616841834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:41,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:26:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100362107] [2025-04-30 10:26:41,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:41,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:26:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:41,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:26:41,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:26:41,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-04-30 10:26:41,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 228 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 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) [2025-04-30 10:26:41,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:41,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-04-30 10:26:41,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:41,688 INFO L116 PetriNetUnfolderBase]: 114/841 cut-off events. [2025-04-30 10:26:41,688 INFO L117 PetriNetUnfolderBase]: For 359/372 co-relation queries the response was YES. [2025-04-30 10:26:41,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 841 events. 114/841 cut-off events. For 359/372 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4333 event pairs, 14 based on Foata normal form. 8/811 useless extension candidates. Maximal degree in co-relation 1300. Up to 84 conditions per place. [2025-04-30 10:26:41,693 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 21 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2025-04-30 10:26:41,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 1102 flow [2025-04-30 10:26:41,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:26:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:26:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4404 transitions. [2025-04-30 10:26:41,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9232704402515723 [2025-04-30 10:26:41,700 INFO L175 Difference]: Start difference. First operand has 209 places, 228 transitions, 878 flow. Second operand 30 states and 4404 transitions. [2025-04-30 10:26:41,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 1102 flow [2025-04-30 10:26:41,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 245 transitions, 1102 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:41,706 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 1030 flow [2025-04-30 10:26:41,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1030, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2025-04-30 10:26:41,706 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 83 predicate places. [2025-04-30 10:26:41,706 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 1030 flow [2025-04-30 10:26:41,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 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) [2025-04-30 10:26:41,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:41,708 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:41,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:26:41,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:41,912 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:41,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1667208809, now seen corresponding path program 2 times [2025-04-30 10:26:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:41,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091417131] [2025-04-30 10:26:41,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:41,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-04-30 10:26:41,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-04-30 10:26:41,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:42,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:42,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091417131] [2025-04-30 10:26:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091417131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582443929] [2025-04-30 10:26:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:42,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:42,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:42,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:42,259 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-04-30 10:26:42,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 1030 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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) [2025-04-30 10:26:42,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:42,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-04-30 10:26:42,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:42,551 INFO L116 PetriNetUnfolderBase]: 422/1653 cut-off events. [2025-04-30 10:26:42,552 INFO L117 PetriNetUnfolderBase]: For 992/1034 co-relation queries the response was YES. [2025-04-30 10:26:42,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1653 events. 422/1653 cut-off events. For 992/1034 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10564 event pairs, 107 based on Foata normal form. 12/1574 useless extension candidates. Maximal degree in co-relation 3386. Up to 718 conditions per place. [2025-04-30 10:26:42,559 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 76 selfloop transitions, 57 changer transitions 0/293 dead transitions. [2025-04-30 10:26:42,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 293 transitions, 1540 flow [2025-04-30 10:26:42,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-04-30 10:26:42,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-04-30 10:26:42,561 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 1030 flow. Second operand 6 states and 855 transitions. [2025-04-30 10:26:42,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 293 transitions, 1540 flow [2025-04-30 10:26:42,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 293 transitions, 1494 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:26:42,568 INFO L231 Difference]: Finished difference. Result has 234 places, 285 transitions, 1482 flow [2025-04-30 10:26:42,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1482, PETRI_PLACES=234, PETRI_TRANSITIONS=285} [2025-04-30 10:26:42,569 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 75 predicate places. [2025-04-30 10:26:42,570 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 285 transitions, 1482 flow [2025-04-30 10:26:42,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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) [2025-04-30 10:26:42,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:42,570 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:42,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:42,570 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:42,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -226856996, now seen corresponding path program 1 times [2025-04-30 10:26:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:42,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405039488] [2025-04-30 10:26:42,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:42,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:26:42,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:26:42,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:42,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:42,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405039488] [2025-04-30 10:26:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405039488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194398060] [2025-04-30 10:26:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:42,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:42,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:42,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:43,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-04-30 10:26:43,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 285 transitions, 1482 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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) [2025-04-30 10:26:43,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:43,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-04-30 10:26:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:43,342 INFO L116 PetriNetUnfolderBase]: 542/2093 cut-off events. [2025-04-30 10:26:43,342 INFO L117 PetriNetUnfolderBase]: For 2384/2443 co-relation queries the response was YES. [2025-04-30 10:26:43,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 2093 events. 542/2093 cut-off events. For 2384/2443 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14611 event pairs, 113 based on Foata normal form. 13/2020 useless extension candidates. Maximal degree in co-relation 5000. Up to 894 conditions per place. [2025-04-30 10:26:43,382 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 113 selfloop transitions, 71 changer transitions 0/346 dead transitions. [2025-04-30 10:26:43,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 346 transitions, 2204 flow [2025-04-30 10:26:43,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-04-30 10:26:43,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-04-30 10:26:43,384 INFO L175 Difference]: Start difference. First operand has 234 places, 285 transitions, 1482 flow. Second operand 6 states and 855 transitions. [2025-04-30 10:26:43,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 346 transitions, 2204 flow [2025-04-30 10:26:43,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 346 transitions, 2140 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:43,399 INFO L231 Difference]: Finished difference. Result has 244 places, 338 transitions, 2094 flow [2025-04-30 10:26:43,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2094, PETRI_PLACES=244, PETRI_TRANSITIONS=338} [2025-04-30 10:26:43,400 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 85 predicate places. [2025-04-30 10:26:43,401 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 2094 flow [2025-04-30 10:26:43,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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) [2025-04-30 10:26:43,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:43,402 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:43,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:43,402 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:43,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798264, now seen corresponding path program 1 times [2025-04-30 10:26:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:43,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372167737] [2025-04-30 10:26:43,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:43,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:26:43,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:43,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:43,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:43,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372167737] [2025-04-30 10:26:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372167737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:43,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:43,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208471461] [2025-04-30 10:26:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:43,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:43,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:43,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:44,843 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:26:44,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 2094 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:44,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:44,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:26:44,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:45,498 INFO L116 PetriNetUnfolderBase]: 1062/4156 cut-off events. [2025-04-30 10:26:45,498 INFO L117 PetriNetUnfolderBase]: For 5649/5779 co-relation queries the response was YES. [2025-04-30 10:26:45,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11496 conditions, 4156 events. 1062/4156 cut-off events. For 5649/5779 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 33044 event pairs, 151 based on Foata normal form. 45/4178 useless extension candidates. Maximal degree in co-relation 11219. Up to 580 conditions per place. [2025-04-30 10:26:45,526 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 68 selfloop transitions, 15 changer transitions 3/397 dead transitions. [2025-04-30 10:26:45,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 397 transitions, 2384 flow [2025-04-30 10:26:45,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1277 transitions. [2025-04-30 10:26:45,529 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8923829489867225 [2025-04-30 10:26:45,529 INFO L175 Difference]: Start difference. First operand has 244 places, 338 transitions, 2094 flow. Second operand 9 states and 1277 transitions. [2025-04-30 10:26:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 397 transitions, 2384 flow [2025-04-30 10:26:45,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 397 transitions, 2302 flow, removed 41 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:45,559 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2130 flow [2025-04-30 10:26:45,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2130, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2025-04-30 10:26:45,560 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 100 predicate places. [2025-04-30 10:26:45,560 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2130 flow [2025-04-30 10:26:45,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:45,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:45,561 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:45,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:26:45,561 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:45,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:45,562 INFO L85 PathProgramCache]: Analyzing trace with hash -926286722, now seen corresponding path program 2 times [2025-04-30 10:26:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:45,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082974048] [2025-04-30 10:26:45,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:45,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:45,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:26:45,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:26:45,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:45,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:45,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082974048] [2025-04-30 10:26:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082974048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:45,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592540042] [2025-04-30 10:26:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:45,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:45,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:45,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:46,759 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:26:46,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2130 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:46,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:46,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:26:46,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:47,860 INFO L116 PetriNetUnfolderBase]: 2043/7618 cut-off events. [2025-04-30 10:26:47,860 INFO L117 PetriNetUnfolderBase]: For 10992/11256 co-relation queries the response was YES. [2025-04-30 10:26:47,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22390 conditions, 7618 events. 2043/7618 cut-off events. For 10992/11256 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 68344 event pairs, 280 based on Foata normal form. 85/7653 useless extension candidates. Maximal degree in co-relation 22105. Up to 1204 conditions per place. [2025-04-30 10:26:47,913 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 107 selfloop transitions, 20 changer transitions 6/444 dead transitions. [2025-04-30 10:26:47,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 444 transitions, 2796 flow [2025-04-30 10:26:47,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1276 transitions. [2025-04-30 10:26:47,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8916841369671559 [2025-04-30 10:26:47,917 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2130 flow. Second operand 9 states and 1276 transitions. [2025-04-30 10:26:47,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 444 transitions, 2796 flow [2025-04-30 10:26:47,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 444 transitions, 2796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:47,965 INFO L231 Difference]: Finished difference. Result has 274 places, 370 transitions, 2310 flow [2025-04-30 10:26:47,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=274, PETRI_TRANSITIONS=370} [2025-04-30 10:26:47,966 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 115 predicate places. [2025-04-30 10:26:47,967 INFO L485 AbstractCegarLoop]: Abstraction has has 274 places, 370 transitions, 2310 flow [2025-04-30 10:26:47,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:47,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:47,968 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:47,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:26:47,968 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:47,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -416398666, now seen corresponding path program 3 times [2025-04-30 10:26:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:47,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979847471] [2025-04-30 10:26:47,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:26:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:47,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:47,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:26:47,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:26:47,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:48,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979847471] [2025-04-30 10:26:48,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979847471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958525384] [2025-04-30 10:26:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:48,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:48,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:48,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:49,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:26:49,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 370 transitions, 2310 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:49,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:49,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:26:49,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:50,919 INFO L116 PetriNetUnfolderBase]: 2340/8659 cut-off events. [2025-04-30 10:26:50,919 INFO L117 PetriNetUnfolderBase]: For 14707/15070 co-relation queries the response was YES. [2025-04-30 10:26:50,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26794 conditions, 8659 events. 2340/8659 cut-off events. For 14707/15070 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 79138 event pairs, 290 based on Foata normal form. 94/8697 useless extension candidates. Maximal degree in co-relation 26501. Up to 1318 conditions per place. [2025-04-30 10:26:50,991 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 119 selfloop transitions, 22 changer transitions 2/454 dead transitions. [2025-04-30 10:26:50,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 454 transitions, 3094 flow [2025-04-30 10:26:50,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1281 transitions. [2025-04-30 10:26:50,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8951781970649895 [2025-04-30 10:26:50,997 INFO L175 Difference]: Start difference. First operand has 274 places, 370 transitions, 2310 flow. Second operand 9 states and 1281 transitions. [2025-04-30 10:26:50,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 454 transitions, 3094 flow [2025-04-30 10:26:51,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 454 transitions, 3056 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:51,071 INFO L231 Difference]: Finished difference. Result has 287 places, 382 transitions, 2479 flow [2025-04-30 10:26:51,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2479, PETRI_PLACES=287, PETRI_TRANSITIONS=382} [2025-04-30 10:26:51,074 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2025-04-30 10:26:51,074 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 382 transitions, 2479 flow [2025-04-30 10:26:51,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:51,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:51,075 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:51,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:26:51,076 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:51,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1478854246, now seen corresponding path program 4 times [2025-04-30 10:26:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:51,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430493787] [2025-04-30 10:26:51,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:26:51,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:51,093 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:26:51,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:51,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:26:51,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:51,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:51,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430493787] [2025-04-30 10:26:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430493787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:51,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:51,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014135369] [2025-04-30 10:26:51,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:51,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:51,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:51,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:51,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:52,874 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:26:52,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 382 transitions, 2479 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:26:52,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:52,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:26:52,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:54,301 INFO L116 PetriNetUnfolderBase]: 2637/9697 cut-off events. [2025-04-30 10:26:54,302 INFO L117 PetriNetUnfolderBase]: For 18464/18871 co-relation queries the response was YES. [2025-04-30 10:26:54,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30686 conditions, 9697 events. 2637/9697 cut-off events. For 18464/18871 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 90734 event pairs, 301 based on Foata normal form. 107/9743 useless extension candidates. Maximal degree in co-relation 30387. Up to 1587 conditions per place. [2025-04-30 10:26:54,370 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 129 selfloop transitions, 28 changer transitions 4/472 dead transitions. [2025-04-30 10:26:54,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 472 transitions, 3428 flow [2025-04-30 10:26:54,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:26:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:26:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1413 transitions. [2025-04-30 10:26:54,372 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8886792452830189 [2025-04-30 10:26:54,372 INFO L175 Difference]: Start difference. First operand has 287 places, 382 transitions, 2479 flow. Second operand 10 states and 1413 transitions. [2025-04-30 10:26:54,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 472 transitions, 3428 flow [2025-04-30 10:26:54,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 472 transitions, 3349 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-30 10:26:54,446 INFO L231 Difference]: Finished difference. Result has 298 places, 394 transitions, 2657 flow [2025-04-30 10:26:54,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2657, PETRI_PLACES=298, PETRI_TRANSITIONS=394} [2025-04-30 10:26:54,449 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 139 predicate places. [2025-04-30 10:26:54,449 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 394 transitions, 2657 flow [2025-04-30 10:26:54,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:26:54,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:54,450 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:54,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:26:54,450 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:54,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -826527336, now seen corresponding path program 5 times [2025-04-30 10:26:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:54,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604062798] [2025-04-30 10:26:54,451 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:26:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:54,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:54,483 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:54,483 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:26:54,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-30 10:26:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:55,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604062798] [2025-04-30 10:26:55,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604062798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:55,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430672843] [2025-04-30 10:26:55,276 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:26:55,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:55,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:55,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:26:55,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:55,396 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:26:55,396 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:26:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:55,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-30 10:26:55,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:55,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:26:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:55,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:26:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430672843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:26:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-04-30 10:26:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624526332] [2025-04-30 10:26:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:55,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:55,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:55,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:26:56,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:26:56,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 394 transitions, 2657 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:26:56,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:56,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:26:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:58,530 INFO L116 PetriNetUnfolderBase]: 2967/10865 cut-off events. [2025-04-30 10:26:58,530 INFO L117 PetriNetUnfolderBase]: For 23444/23925 co-relation queries the response was YES. [2025-04-30 10:26:58,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35185 conditions, 10865 events. 2967/10865 cut-off events. For 23444/23925 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 104218 event pairs, 311 based on Foata normal form. 100/10888 useless extension candidates. Maximal degree in co-relation 34880. Up to 1711 conditions per place. [2025-04-30 10:26:58,621 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 133 selfloop transitions, 30 changer transitions 1/475 dead transitions. [2025-04-30 10:26:58,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 475 transitions, 3636 flow [2025-04-30 10:26:58,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:26:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:26:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1416 transitions. [2025-04-30 10:26:58,624 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8905660377358491 [2025-04-30 10:26:58,624 INFO L175 Difference]: Start difference. First operand has 298 places, 394 transitions, 2657 flow. Second operand 10 states and 1416 transitions. [2025-04-30 10:26:58,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 475 transitions, 3636 flow [2025-04-30 10:26:58,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 475 transitions, 3543 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-30 10:26:58,722 INFO L231 Difference]: Finished difference. Result has 309 places, 409 transitions, 2895 flow [2025-04-30 10:26:58,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2895, PETRI_PLACES=309, PETRI_TRANSITIONS=409} [2025-04-30 10:26:58,723 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 150 predicate places. [2025-04-30 10:26:58,724 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 409 transitions, 2895 flow [2025-04-30 10:26:58,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:26:58,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:58,724 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:58,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:26:58,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:58,925 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:58,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2070405432, now seen corresponding path program 6 times [2025-04-30 10:26:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:58,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839306803] [2025-04-30 10:26:58,926 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:26:58,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:58,936 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:26:58,941 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:26:58,942 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:26:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:59,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839306803] [2025-04-30 10:26:59,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839306803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:59,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:26:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139161371] [2025-04-30 10:26:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:59,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:26:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:59,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:26:59,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:26:59,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:26:59,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 409 transitions, 2895 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:26:59,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:59,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:26:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:01,667 INFO L116 PetriNetUnfolderBase]: 3289/12024 cut-off events. [2025-04-30 10:27:01,668 INFO L117 PetriNetUnfolderBase]: For 29470/30002 co-relation queries the response was YES. [2025-04-30 10:27:01,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39761 conditions, 12024 events. 3289/12024 cut-off events. For 29470/30002 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 118228 event pairs, 336 based on Foata normal form. 108/12051 useless extension candidates. Maximal degree in co-relation 39450. Up to 1968 conditions per place. [2025-04-30 10:27:01,785 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 148 selfloop transitions, 34 changer transitions 2/495 dead transitions. [2025-04-30 10:27:01,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 495 transitions, 4019 flow [2025-04-30 10:27:01,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2025-04-30 10:27:01,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8972746331236897 [2025-04-30 10:27:01,786 INFO L175 Difference]: Start difference. First operand has 309 places, 409 transitions, 2895 flow. Second operand 9 states and 1284 transitions. [2025-04-30 10:27:01,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 495 transitions, 4019 flow [2025-04-30 10:27:02,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 495 transitions, 3921 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-04-30 10:27:02,036 INFO L231 Difference]: Finished difference. Result has 320 places, 424 transitions, 3136 flow [2025-04-30 10:27:02,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2834, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3136, PETRI_PLACES=320, PETRI_TRANSITIONS=424} [2025-04-30 10:27:02,037 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 161 predicate places. [2025-04-30 10:27:02,037 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 424 transitions, 3136 flow [2025-04-30 10:27:02,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:02,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:02,039 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:02,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:02,039 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:02,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1143111712, now seen corresponding path program 7 times [2025-04-30 10:27:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:02,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311710840] [2025-04-30 10:27:02,040 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:27:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:02,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:27:02,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:02,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:02,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:02,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311710840] [2025-04-30 10:27:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311710840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803997611] [2025-04-30 10:27:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:02,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:02,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:02,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 424 transitions, 3136 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:02,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:02,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:02,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:05,018 INFO L116 PetriNetUnfolderBase]: 3632/13216 cut-off events. [2025-04-30 10:27:05,018 INFO L117 PetriNetUnfolderBase]: For 37730/38326 co-relation queries the response was YES. [2025-04-30 10:27:05,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44922 conditions, 13216 events. 3632/13216 cut-off events. For 37730/38326 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 132936 event pairs, 411 based on Foata normal form. 95/13209 useless extension candidates. Maximal degree in co-relation 44606. Up to 2114 conditions per place. [2025-04-30 10:27:05,122 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 148 selfloop transitions, 36 changer transitions 0/495 dead transitions. [2025-04-30 10:27:05,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 495 transitions, 4233 flow [2025-04-30 10:27:05,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2025-04-30 10:27:05,124 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8986722571628232 [2025-04-30 10:27:05,124 INFO L175 Difference]: Start difference. First operand has 320 places, 424 transitions, 3136 flow. Second operand 9 states and 1286 transitions. [2025-04-30 10:27:05,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 495 transitions, 4233 flow [2025-04-30 10:27:05,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 495 transitions, 4133 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:05,261 INFO L231 Difference]: Finished difference. Result has 333 places, 443 transitions, 3486 flow [2025-04-30 10:27:05,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3058, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3486, PETRI_PLACES=333, PETRI_TRANSITIONS=443} [2025-04-30 10:27:05,262 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 174 predicate places. [2025-04-30 10:27:05,262 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 443 transitions, 3486 flow [2025-04-30 10:27:05,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:05,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:05,262 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:05,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:27:05,262 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:05,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash -357279530, now seen corresponding path program 8 times [2025-04-30 10:27:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:05,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940424845] [2025-04-30 10:27:05,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:05,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:27:05,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:05,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:05,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:05,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940424845] [2025-04-30 10:27:05,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940424845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:05,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218159080] [2025-04-30 10:27:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:05,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:05,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:05,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:05,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:05,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 443 transitions, 3486 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:05,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:05,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:05,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:08,103 INFO L116 PetriNetUnfolderBase]: 4229/15234 cut-off events. [2025-04-30 10:27:08,104 INFO L117 PetriNetUnfolderBase]: For 48751/49499 co-relation queries the response was YES. [2025-04-30 10:27:08,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52774 conditions, 15234 events. 4229/15234 cut-off events. For 48751/49499 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 158896 event pairs, 434 based on Foata normal form. 125/15248 useless extension candidates. Maximal degree in co-relation 52451. Up to 2514 conditions per place. [2025-04-30 10:27:08,208 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 169 selfloop transitions, 45 changer transitions 0/525 dead transitions. [2025-04-30 10:27:08,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 525 transitions, 4789 flow [2025-04-30 10:27:08,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-04-30 10:27:08,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-04-30 10:27:08,209 INFO L175 Difference]: Start difference. First operand has 333 places, 443 transitions, 3486 flow. Second operand 9 states and 1288 transitions. [2025-04-30 10:27:08,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 525 transitions, 4789 flow [2025-04-30 10:27:08,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 525 transitions, 4685 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:08,385 INFO L231 Difference]: Finished difference. Result has 348 places, 461 transitions, 3838 flow [2025-04-30 10:27:08,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3382, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3838, PETRI_PLACES=348, PETRI_TRANSITIONS=461} [2025-04-30 10:27:08,386 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 189 predicate places. [2025-04-30 10:27:08,386 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 461 transitions, 3838 flow [2025-04-30 10:27:08,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:08,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:08,386 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:08,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:27:08,386 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:08,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1577115684, now seen corresponding path program 9 times [2025-04-30 10:27:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:08,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766167427] [2025-04-30 10:27:08,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:08,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:08,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:08,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:27:08,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:08,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:08,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766167427] [2025-04-30 10:27:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766167427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:08,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618895396] [2025-04-30 10:27:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:08,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:08,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:08,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:09,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:09,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 461 transitions, 3838 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:09,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:09,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:11,747 INFO L116 PetriNetUnfolderBase]: 4227/15237 cut-off events. [2025-04-30 10:27:11,747 INFO L117 PetriNetUnfolderBase]: For 54406/55201 co-relation queries the response was YES. [2025-04-30 10:27:12,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53822 conditions, 15237 events. 4227/15237 cut-off events. For 54406/55201 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 159139 event pairs, 377 based on Foata normal form. 210/15353 useless extension candidates. Maximal degree in co-relation 53491. Up to 2452 conditions per place. [2025-04-30 10:27:12,064 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 181 selfloop transitions, 58 changer transitions 2/552 dead transitions. [2025-04-30 10:27:12,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 552 transitions, 5160 flow [2025-04-30 10:27:12,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1279 transitions. [2025-04-30 10:27:12,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.893780573025856 [2025-04-30 10:27:12,065 INFO L175 Difference]: Start difference. First operand has 348 places, 461 transitions, 3838 flow. Second operand 9 states and 1279 transitions. [2025-04-30 10:27:12,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 552 transitions, 5160 flow [2025-04-30 10:27:12,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 552 transitions, 5072 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:12,256 INFO L231 Difference]: Finished difference. Result has 360 places, 473 transitions, 4078 flow [2025-04-30 10:27:12,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3752, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4078, PETRI_PLACES=360, PETRI_TRANSITIONS=473} [2025-04-30 10:27:12,257 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 201 predicate places. [2025-04-30 10:27:12,257 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 473 transitions, 4078 flow [2025-04-30 10:27:12,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:12,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:12,257 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:12,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:27:12,257 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:12,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1855877600, now seen corresponding path program 10 times [2025-04-30 10:27:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:12,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051718394] [2025-04-30 10:27:12,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:12,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:12,267 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:27:12,276 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:12,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:27:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:12,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051718394] [2025-04-30 10:27:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051718394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:12,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:12,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:27:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546168016] [2025-04-30 10:27:12,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:12,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:12,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:12,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:13,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:13,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 473 transitions, 4078 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:27:13,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:13,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:13,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:16,009 INFO L116 PetriNetUnfolderBase]: 3949/14364 cut-off events. [2025-04-30 10:27:16,009 INFO L117 PetriNetUnfolderBase]: For 55963/56702 co-relation queries the response was YES. [2025-04-30 10:27:16,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51559 conditions, 14364 events. 3949/14364 cut-off events. For 55963/56702 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 147963 event pairs, 363 based on Foata normal form. 187/14460 useless extension candidates. Maximal degree in co-relation 51223. Up to 2285 conditions per place. [2025-04-30 10:27:16,229 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 181 selfloop transitions, 55 changer transitions 2/549 dead transitions. [2025-04-30 10:27:16,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 549 transitions, 5288 flow [2025-04-30 10:27:16,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:27:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:27:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1409 transitions. [2025-04-30 10:27:16,230 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8861635220125786 [2025-04-30 10:27:16,231 INFO L175 Difference]: Start difference. First operand has 360 places, 473 transitions, 4078 flow. Second operand 10 states and 1409 transitions. [2025-04-30 10:27:16,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 549 transitions, 5288 flow [2025-04-30 10:27:16,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 549 transitions, 5106 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:16,492 INFO L231 Difference]: Finished difference. Result has 368 places, 476 transitions, 4112 flow [2025-04-30 10:27:16,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3908, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4112, PETRI_PLACES=368, PETRI_TRANSITIONS=476} [2025-04-30 10:27:16,492 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 209 predicate places. [2025-04-30 10:27:16,492 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 476 transitions, 4112 flow [2025-04-30 10:27:16,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:27:16,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:16,493 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:16,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:27:16,493 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:16,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -493660632, now seen corresponding path program 11 times [2025-04-30 10:27:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:16,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680068984] [2025-04-30 10:27:16,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:16,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:16,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:16,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:27:16,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-30 10:27:17,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:17,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680068984] [2025-04-30 10:27:17,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680068984] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:17,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851566280] [2025-04-30 10:27:17,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:27:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:17,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:27:17,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:27:17,265 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:17,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:17,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:27:17,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:17,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-30 10:27:17,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:17,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:27:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:17,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:27:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851566280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:17,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:27:17,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-04-30 10:27:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388573500] [2025-04-30 10:27:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:17,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:17,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:17,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:27:18,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:18,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 476 transitions, 4112 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:27:18,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:18,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:18,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:20,483 INFO L116 PetriNetUnfolderBase]: 3954/14451 cut-off events. [2025-04-30 10:27:20,483 INFO L117 PetriNetUnfolderBase]: For 53995/54723 co-relation queries the response was YES. [2025-04-30 10:27:20,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51633 conditions, 14451 events. 3954/14451 cut-off events. For 53995/54723 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 149129 event pairs, 379 based on Foata normal form. 163/14519 useless extension candidates. Maximal degree in co-relation 51293. Up to 2318 conditions per place. [2025-04-30 10:27:20,676 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 176 selfloop transitions, 61 changer transitions 1/549 dead transitions. [2025-04-30 10:27:20,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 549 transitions, 5272 flow [2025-04-30 10:27:20,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:27:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:27:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1412 transitions. [2025-04-30 10:27:20,678 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8880503144654088 [2025-04-30 10:27:20,678 INFO L175 Difference]: Start difference. First operand has 368 places, 476 transitions, 4112 flow. Second operand 10 states and 1412 transitions. [2025-04-30 10:27:20,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 549 transitions, 5272 flow [2025-04-30 10:27:20,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 549 transitions, 5154 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-30 10:27:20,918 INFO L231 Difference]: Finished difference. Result has 376 places, 487 transitions, 4364 flow [2025-04-30 10:27:20,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4012, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4364, PETRI_PLACES=376, PETRI_TRANSITIONS=487} [2025-04-30 10:27:20,919 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 217 predicate places. [2025-04-30 10:27:20,919 INFO L485 AbstractCegarLoop]: Abstraction has has 376 places, 487 transitions, 4364 flow [2025-04-30 10:27:20,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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) [2025-04-30 10:27:20,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:20,919 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:20,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:21,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:21,120 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:21,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash 516862162, now seen corresponding path program 12 times [2025-04-30 10:27:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:21,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261120520] [2025-04-30 10:27:21,121 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:27:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:21,129 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:21,134 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:21,134 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-30 10:27:21,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:21,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261120520] [2025-04-30 10:27:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261120520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:21,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178729353] [2025-04-30 10:27:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:21,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:21,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:21,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:21,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:21,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 487 transitions, 4364 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:21,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:21,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:21,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:24,217 INFO L116 PetriNetUnfolderBase]: 4243/15403 cut-off events. [2025-04-30 10:27:24,217 INFO L117 PetriNetUnfolderBase]: For 61057/61830 co-relation queries the response was YES. [2025-04-30 10:27:24,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55498 conditions, 15403 events. 4243/15403 cut-off events. For 61057/61830 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 161391 event pairs, 415 based on Foata normal form. 151/15447 useless extension candidates. Maximal degree in co-relation 55153. Up to 2492 conditions per place. [2025-04-30 10:27:24,416 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 200 selfloop transitions, 49 changer transitions 1/561 dead transitions. [2025-04-30 10:27:24,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 561 transitions, 5696 flow [2025-04-30 10:27:24,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-04-30 10:27:24,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-04-30 10:27:24,417 INFO L175 Difference]: Start difference. First operand has 376 places, 487 transitions, 4364 flow. Second operand 9 states and 1288 transitions. [2025-04-30 10:27:24,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 561 transitions, 5696 flow [2025-04-30 10:27:24,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 561 transitions, 5490 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:24,674 INFO L231 Difference]: Finished difference. Result has 384 places, 497 transitions, 4544 flow [2025-04-30 10:27:24,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4256, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4544, PETRI_PLACES=384, PETRI_TRANSITIONS=497} [2025-04-30 10:27:24,675 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 225 predicate places. [2025-04-30 10:27:24,675 INFO L485 AbstractCegarLoop]: Abstraction has has 384 places, 497 transitions, 4544 flow [2025-04-30 10:27:24,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:24,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:24,675 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:24,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:27:24,675 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:24,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash 463418674, now seen corresponding path program 13 times [2025-04-30 10:27:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:24,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814472256] [2025-04-30 10:27:24,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:27:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:24,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:27:24,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:24,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:24,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:24,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814472256] [2025-04-30 10:27:24,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814472256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98558439] [2025-04-30 10:27:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:24,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:24,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:24,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:25,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:25,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 497 transitions, 4544 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:25,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:25,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:25,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:27,741 INFO L116 PetriNetUnfolderBase]: 4249/15491 cut-off events. [2025-04-30 10:27:27,741 INFO L117 PetriNetUnfolderBase]: For 60446/61218 co-relation queries the response was YES. [2025-04-30 10:27:27,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55730 conditions, 15491 events. 4249/15491 cut-off events. For 60446/61218 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 162793 event pairs, 421 based on Foata normal form. 172/15558 useless extension candidates. Maximal degree in co-relation 55382. Up to 2504 conditions per place. [2025-04-30 10:27:27,959 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 189 selfloop transitions, 66 changer transitions 1/567 dead transitions. [2025-04-30 10:27:27,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 567 transitions, 5753 flow [2025-04-30 10:27:27,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1282 transitions. [2025-04-30 10:27:27,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8958770090845563 [2025-04-30 10:27:27,960 INFO L175 Difference]: Start difference. First operand has 384 places, 497 transitions, 4544 flow. Second operand 9 states and 1282 transitions. [2025-04-30 10:27:27,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 567 transitions, 5753 flow [2025-04-30 10:27:28,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 567 transitions, 5656 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:28,239 INFO L231 Difference]: Finished difference. Result has 391 places, 506 transitions, 4772 flow [2025-04-30 10:27:28,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4456, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4772, PETRI_PLACES=391, PETRI_TRANSITIONS=506} [2025-04-30 10:27:28,240 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 232 predicate places. [2025-04-30 10:27:28,240 INFO L485 AbstractCegarLoop]: Abstraction has has 391 places, 506 transitions, 4772 flow [2025-04-30 10:27:28,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:28,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:28,240 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:28,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:27:28,241 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:28,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1946437464, now seen corresponding path program 14 times [2025-04-30 10:27:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:28,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817379918] [2025-04-30 10:27:28,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:28,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:27:28,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:28,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:28,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:28,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817379918] [2025-04-30 10:27:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817379918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:28,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121764262] [2025-04-30 10:27:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:28,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:29,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:29,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 506 transitions, 4772 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:29,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:29,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:29,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:31,686 INFO L116 PetriNetUnfolderBase]: 4245/15496 cut-off events. [2025-04-30 10:27:31,686 INFO L117 PetriNetUnfolderBase]: For 61676/62465 co-relation queries the response was YES. [2025-04-30 10:27:31,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55946 conditions, 15496 events. 4245/15496 cut-off events. For 61676/62465 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 162969 event pairs, 417 based on Foata normal form. 169/15560 useless extension candidates. Maximal degree in co-relation 55595. Up to 2504 conditions per place. [2025-04-30 10:27:31,891 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 199 selfloop transitions, 62 changer transitions 1/573 dead transitions. [2025-04-30 10:27:31,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 573 transitions, 5978 flow [2025-04-30 10:27:31,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1283 transitions. [2025-04-30 10:27:31,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.896575821104123 [2025-04-30 10:27:31,893 INFO L175 Difference]: Start difference. First operand has 391 places, 506 transitions, 4772 flow. Second operand 9 states and 1283 transitions. [2025-04-30 10:27:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 573 transitions, 5978 flow [2025-04-30 10:27:32,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 573 transitions, 5846 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:32,179 INFO L231 Difference]: Finished difference. Result has 398 places, 514 transitions, 4970 flow [2025-04-30 10:27:32,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4648, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4970, PETRI_PLACES=398, PETRI_TRANSITIONS=514} [2025-04-30 10:27:32,180 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 239 predicate places. [2025-04-30 10:27:32,180 INFO L485 AbstractCegarLoop]: Abstraction has has 398 places, 514 transitions, 4970 flow [2025-04-30 10:27:32,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:32,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:32,181 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:32,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:27:32,181 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:32,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash 543948742, now seen corresponding path program 15 times [2025-04-30 10:27:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:32,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96828318] [2025-04-30 10:27:32,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:27:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:32,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-04-30 10:27:32,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-04-30 10:27:32,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:27:32,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:32,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96828318] [2025-04-30 10:27:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96828318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:32,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:27:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190490700] [2025-04-30 10:27:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:32,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:27:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:32,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:27:32,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:27:32,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-04-30 10:27:32,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 514 transitions, 4970 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:32,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:32,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-04-30 10:27:32,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:35,280 INFO L116 PetriNetUnfolderBase]: 3975/14698 cut-off events. [2025-04-30 10:27:35,280 INFO L117 PetriNetUnfolderBase]: For 59041/59788 co-relation queries the response was YES. [2025-04-30 10:27:35,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53068 conditions, 14698 events. 3975/14698 cut-off events. For 59041/59788 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 152594 event pairs, 407 based on Foata normal form. 152/14749 useless extension candidates. Maximal degree in co-relation 52713. Up to 2344 conditions per place. [2025-04-30 10:27:35,444 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 195 selfloop transitions, 64 changer transitions 1/571 dead transitions. [2025-04-30 10:27:35,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 571 transitions, 6030 flow [2025-04-30 10:27:35,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1285 transitions. [2025-04-30 10:27:35,446 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8979734451432565 [2025-04-30 10:27:35,446 INFO L175 Difference]: Start difference. First operand has 398 places, 514 transitions, 4970 flow. Second operand 9 states and 1285 transitions. [2025-04-30 10:27:35,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 571 transitions, 6030 flow [2025-04-30 10:27:35,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 571 transitions, 5914 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-04-30 10:27:35,719 INFO L231 Difference]: Finished difference. Result has 405 places, 521 transitions, 5160 flow [2025-04-30 10:27:35,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4812, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5160, PETRI_PLACES=405, PETRI_TRANSITIONS=521} [2025-04-30 10:27:35,720 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 246 predicate places. [2025-04-30 10:27:35,720 INFO L485 AbstractCegarLoop]: Abstraction has has 405 places, 521 transitions, 5160 flow [2025-04-30 10:27:35,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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) [2025-04-30 10:27:35,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:35,721 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:35,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:27:35,721 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:27:35,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash 307975896, now seen corresponding path program 16 times [2025-04-30 10:27:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:35,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59946537] [2025-04-30 10:27:35,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:27:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:35,731 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-04-30 10:27:35,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:27:35,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:27:35,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:27:36,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:36,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59946537] [2025-04-30 10:27:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59946537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:36,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:27:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454784251] [2025-04-30 10:27:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:36,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:36,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:36,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 Killed by 15