./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:10:57,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:10:57,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:10:57,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:10:57,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:10:57,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:10:57,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:10:57,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:10:57,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:10:57,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:10:57,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:10:57,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:10:57,728 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:10:57,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:10:57,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:10:57,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:10:57,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:10:57,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:10:57,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:10:57,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:10:57,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:10:57,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:10:57,733 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:10:57,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:10:57,733 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:10:57,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:10:57,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:10:57,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:10:57,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:10:57,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:10:57,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:10:57,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:57,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:10:57,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:10:57,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:10:57,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:10:57,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:10:57,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:10:57,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:10:57,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:10:57,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:10:57,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2024-10-11 17:10:57,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:10:57,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:10:57,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:10:57,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:10:57,974 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:10:57,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-10-11 17:10:59,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:10:59,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:10:59,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-10-11 17:10:59,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ab3f7adc/f137041c136f4d49bf8f44e822bc8364/FLAGe2960751c [2024-10-11 17:10:59,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ab3f7adc/f137041c136f4d49bf8f44e822bc8364 [2024-10-11 17:10:59,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:10:59,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:10:59,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:59,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:10:59,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:10:59,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:59" (1/1) ... [2024-10-11 17:10:59,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c01de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:59, skipping insertion in model container [2024-10-11 17:10:59,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:59" (1/1) ... [2024-10-11 17:10:59,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:11:00,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:11:00,135 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:11:00,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:11:00,195 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:11:00,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00 WrapperNode [2024-10-11 17:11:00,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:11:00,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:11:00,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:11:00,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:11:00,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,228 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-10-11 17:11:00,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:11:00,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:11:00,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:11:00,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:11:00,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:11:00,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:11:00,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:11:00,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:11:00,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (1/1) ... [2024-10-11 17:11:00,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:11:00,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:00,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:11:00,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:11:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:11:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:11:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:11:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:11:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:11:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:11:00,325 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:11:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:11:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-10-11 17:11:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:11:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:11:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:11:00,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:11:00,328 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:11:00,423 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:11:00,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:11:00,597 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:11:00,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:11:00,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:11:00,624 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 17:11:00,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:11:00 BoogieIcfgContainer [2024-10-11 17:11:00,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:11:00,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:11:00,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:11:00,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:11:00,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:10:59" (1/3) ... [2024-10-11 17:11:00,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bb095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:11:00, skipping insertion in model container [2024-10-11 17:11:00,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:11:00" (2/3) ... [2024-10-11 17:11:00,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bb095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:11:00, skipping insertion in model container [2024-10-11 17:11:00,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:11:00" (3/3) ... [2024-10-11 17:11:00,631 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-10-11 17:11:00,643 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:11:00,644 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 17:11:00,644 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:11:00,686 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:11:00,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 144 transitions, 295 flow [2024-10-11 17:11:00,763 INFO L124 PetriNetUnfolderBase]: 23/207 cut-off events. [2024-10-11 17:11:00,763 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:11:00,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 207 events. 23/207 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 659 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 113. Up to 6 conditions per place. [2024-10-11 17:11:00,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 144 transitions, 295 flow [2024-10-11 17:11:00,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 144 transitions, 295 flow [2024-10-11 17:11:00,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:11:00,788 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4989093c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:11:00,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 17:11:00,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:11:00,805 INFO L124 PetriNetUnfolderBase]: 4/49 cut-off events. [2024-10-11 17:11:00,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:11:00,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:00,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:00,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:11:00,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash -339722752, now seen corresponding path program 1 times [2024-10-11 17:11:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883172135] [2024-10-11 17:11:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:00,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883172135] [2024-10-11 17:11:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883172135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404146476] [2024-10-11 17:11:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:01,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:11:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:11:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:11:01,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2024-10-11 17:11:01,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 295 flow. Second operand has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:01,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2024-10-11 17:11:01,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:01,209 INFO L124 PetriNetUnfolderBase]: 27/367 cut-off events. [2024-10-11 17:11:01,209 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:11:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 367 events. 27/367 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1446 event pairs, 24 based on Foata normal form. 54/383 useless extension candidates. Maximal degree in co-relation 340. Up to 65 conditions per place. [2024-10-11 17:11:01,212 INFO L140 encePairwiseOnDemand]: 131/144 looper letters, 12 selfloop transitions, 0 changer transitions 0/129 dead transitions. [2024-10-11 17:11:01,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 289 flow [2024-10-11 17:11:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:11:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 17:11:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2024-10-11 17:11:01,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.90625 [2024-10-11 17:11:01,229 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 295 flow. Second operand 2 states and 261 transitions. [2024-10-11 17:11:01,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 289 flow [2024-10-11 17:11:01,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:01,235 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 265 flow [2024-10-11 17:11:01,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=265, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-10-11 17:11:01,241 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, -1 predicate places. [2024-10-11 17:11:01,241 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 265 flow [2024-10-11 17:11:01,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:11:01,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:11:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -104795701, now seen corresponding path program 1 times [2024-10-11 17:11:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777892892] [2024-10-11 17:11:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777892892] [2024-10-11 17:11:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777892892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296042036] [2024-10-11 17:11:01,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:01,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:01,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2024-10-11 17:11:01,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:01,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2024-10-11 17:11:01,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:01,443 INFO L124 PetriNetUnfolderBase]: 55/546 cut-off events. [2024-10-11 17:11:01,443 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:11:01,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 546 events. 55/546 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2704 event pairs, 0 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 664. Up to 108 conditions per place. [2024-10-11 17:11:01,448 INFO L140 encePairwiseOnDemand]: 141/144 looper letters, 22 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-10-11 17:11:01,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 135 transitions, 325 flow [2024-10-11 17:11:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-10-11 17:11:01,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2024-10-11 17:11:01,451 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 265 flow. Second operand 3 states and 361 transitions. [2024-10-11 17:11:01,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 135 transitions, 325 flow [2024-10-11 17:11:01,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:01,456 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 273 flow [2024-10-11 17:11:01,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-10-11 17:11:01,458 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 2 predicate places. [2024-10-11 17:11:01,458 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 273 flow [2024-10-11 17:11:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:01,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:11:01,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:11:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1760864711, now seen corresponding path program 1 times [2024-10-11 17:11:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747790733] [2024-10-11 17:11:01,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747790733] [2024-10-11 17:11:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747790733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763805497] [2024-10-11 17:11:01,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:01,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:01,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 144 [2024-10-11 17:11:01,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:01,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:01,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 144 [2024-10-11 17:11:01,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:02,075 INFO L124 PetriNetUnfolderBase]: 115/660 cut-off events. [2024-10-11 17:11:02,076 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:11:02,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 660 events. 115/660 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3757 event pairs, 12 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 942. Up to 181 conditions per place. [2024-10-11 17:11:02,079 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 48 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2024-10-11 17:11:02,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 425 flow [2024-10-11 17:11:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2024-10-11 17:11:02,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-10-11 17:11:02,082 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 273 flow. Second operand 6 states and 654 transitions. [2024-10-11 17:11:02,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 425 flow [2024-10-11 17:11:02,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:02,085 INFO L231 Difference]: Finished difference. Result has 136 places, 128 transitions, 277 flow [2024-10-11 17:11:02,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=136, PETRI_TRANSITIONS=128} [2024-10-11 17:11:02,086 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 4 predicate places. [2024-10-11 17:11:02,086 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 128 transitions, 277 flow [2024-10-11 17:11:02,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:02,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:02,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:11:02,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:11:02,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1856796326, now seen corresponding path program 1 times [2024-10-11 17:11:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520762501] [2024-10-11 17:11:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520762501] [2024-10-11 17:11:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520762501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414863293] [2024-10-11 17:11:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:02,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2024-10-11 17:11:02,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 128 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2024-10-11 17:11:02,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:02,255 INFO L124 PetriNetUnfolderBase]: 92/791 cut-off events. [2024-10-11 17:11:02,255 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:11:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 791 events. 92/791 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4695 event pairs, 30 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1022. Up to 125 conditions per place. [2024-10-11 17:11:02,258 INFO L140 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 6 changer transitions 0/141 dead transitions. [2024-10-11 17:11:02,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 378 flow [2024-10-11 17:11:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-10-11 17:11:02,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-10-11 17:11:02,259 INFO L175 Difference]: Start difference. First operand has 136 places, 128 transitions, 277 flow. Second operand 3 states and 360 transitions. [2024-10-11 17:11:02,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 378 flow [2024-10-11 17:11:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 141 transitions, 368 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:11:02,262 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 305 flow [2024-10-11 17:11:02,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2024-10-11 17:11:02,263 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 1 predicate places. [2024-10-11 17:11:02,263 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 305 flow [2024-10-11 17:11:02,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:02,264 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:02,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:11:02,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:11:02,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash -983623192, now seen corresponding path program 1 times [2024-10-11 17:11:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:02,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859038250] [2024-10-11 17:11:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859038250] [2024-10-11 17:11:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859038250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821488543] [2024-10-11 17:11:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:02,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 144 [2024-10-11 17:11:02,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 144 [2024-10-11 17:11:02,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:02,404 INFO L124 PetriNetUnfolderBase]: 95/793 cut-off events. [2024-10-11 17:11:02,405 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-10-11 17:11:02,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 793 events. 95/793 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4750 event pairs, 60 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1121. Up to 189 conditions per place. [2024-10-11 17:11:02,408 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 27 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-10-11 17:11:02,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 385 flow [2024-10-11 17:11:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-10-11 17:11:02,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2024-10-11 17:11:02,410 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 305 flow. Second operand 3 states and 356 transitions. [2024-10-11 17:11:02,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 385 flow [2024-10-11 17:11:02,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 137 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:02,413 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 325 flow [2024-10-11 17:11:02,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2024-10-11 17:11:02,414 INFO L277 CegarLoopForPetriNet]: 132 programPoint places, 3 predicate places. [2024-10-11 17:11:02,414 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 325 flow [2024-10-11 17:11:02,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:02,415 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:02,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:11:02,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:11:02,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1999974289, now seen corresponding path program 1 times [2024-10-11 17:11:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374497302] [2024-10-11 17:11:02,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:02,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:11:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:02,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:11:02,459 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:11:02,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-11 17:11:02,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-11 17:11:02,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-11 17:11:02,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-11 17:11:02,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-11 17:11:02,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-11 17:11:02,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-11 17:11:02,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-11 17:11:02,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-11 17:11:02,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-11 17:11:02,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-11 17:11:02,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-11 17:11:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:11:02,465 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 17:11:02,467 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:11:02,467 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:11:02,489 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:11:02,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 193 transitions, 402 flow [2024-10-11 17:11:02,522 INFO L124 PetriNetUnfolderBase]: 40/347 cut-off events. [2024-10-11 17:11:02,522 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:11:02,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 347 events. 40/347 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1223 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 209. Up to 9 conditions per place. [2024-10-11 17:11:02,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 193 transitions, 402 flow [2024-10-11 17:11:02,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 193 transitions, 402 flow [2024-10-11 17:11:02,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:11:02,528 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4989093c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:11:02,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:11:02,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:11:02,531 INFO L124 PetriNetUnfolderBase]: 4/49 cut-off events. [2024-10-11 17:11:02,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:11:02,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:02,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:02,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:02,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash -930480128, now seen corresponding path program 1 times [2024-10-11 17:11:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768694500] [2024-10-11 17:11:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768694500] [2024-10-11 17:11:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768694500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695665902] [2024-10-11 17:11:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:11:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:11:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:11:02,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2024-10-11 17:11:02,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 193 transitions, 402 flow. Second operand has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2024-10-11 17:11:02,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:02,765 INFO L124 PetriNetUnfolderBase]: 421/2602 cut-off events. [2024-10-11 17:11:02,765 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 17:11:02,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 2602 events. 421/2602 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 21186 event pairs, 414 based on Foata normal form. 577/2911 useless extension candidates. Maximal degree in co-relation 2797. Up to 716 conditions per place. [2024-10-11 17:11:02,778 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 20 selfloop transitions, 0 changer transitions 0/172 dead transitions. [2024-10-11 17:11:02,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 400 flow [2024-10-11 17:11:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:11:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 17:11:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2024-10-11 17:11:02,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8937823834196891 [2024-10-11 17:11:02,779 INFO L175 Difference]: Start difference. First operand has 176 places, 193 transitions, 402 flow. Second operand 2 states and 345 transitions. [2024-10-11 17:11:02,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 400 flow [2024-10-11 17:11:02,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:02,782 INFO L231 Difference]: Finished difference. Result has 175 places, 172 transitions, 360 flow [2024-10-11 17:11:02,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2024-10-11 17:11:02,783 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -1 predicate places. [2024-10-11 17:11:02,783 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 360 flow [2024-10-11 17:11:02,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:02,784 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:02,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:11:02,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:02,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -886944789, now seen corresponding path program 1 times [2024-10-11 17:11:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:02,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086487305] [2024-10-11 17:11:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:02,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086487305] [2024-10-11 17:11:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086487305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:02,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:02,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345191979] [2024-10-11 17:11:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:02,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 193 [2024-10-11 17:11:02,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:02,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 193 [2024-10-11 17:11:02,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:03,153 INFO L124 PetriNetUnfolderBase]: 802/4340 cut-off events. [2024-10-11 17:11:03,153 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-11 17:11:03,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5694 conditions, 4340 events. 802/4340 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 41568 event pairs, 348 based on Foata normal form. 1/3941 useless extension candidates. Maximal degree in co-relation 5689. Up to 1303 conditions per place. [2024-10-11 17:11:03,173 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 31 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-10-11 17:11:03,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 440 flow [2024-10-11 17:11:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2024-10-11 17:11:03,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8203799654576857 [2024-10-11 17:11:03,175 INFO L175 Difference]: Start difference. First operand has 175 places, 172 transitions, 360 flow. Second operand 3 states and 475 transitions. [2024-10-11 17:11:03,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 440 flow [2024-10-11 17:11:03,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:03,177 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 372 flow [2024-10-11 17:11:03,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2024-10-11 17:11:03,178 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-10-11 17:11:03,178 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 372 flow [2024-10-11 17:11:03,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:03,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:03,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:03,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:11:03,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:03,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1010920344, now seen corresponding path program 1 times [2024-10-11 17:11:03,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:03,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646291758] [2024-10-11 17:11:03,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646291758] [2024-10-11 17:11:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646291758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637320921] [2024-10-11 17:11:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:03,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 193 [2024-10-11 17:11:03,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:03,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:03,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 193 [2024-10-11 17:11:03,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:04,321 INFO L124 PetriNetUnfolderBase]: 1739/6865 cut-off events. [2024-10-11 17:11:04,322 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-10-11 17:11:04,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9836 conditions, 6865 events. 1739/6865 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 68791 event pairs, 760 based on Foata normal form. 0/6164 useless extension candidates. Maximal degree in co-relation 9829. Up to 2015 conditions per place. [2024-10-11 17:11:04,361 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 80 selfloop transitions, 6 changer transitions 0/220 dead transitions. [2024-10-11 17:11:04,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 220 transitions, 638 flow [2024-10-11 17:11:04,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2024-10-11 17:11:04,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7737478411053541 [2024-10-11 17:11:04,364 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 372 flow. Second operand 6 states and 896 transitions. [2024-10-11 17:11:04,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 220 transitions, 638 flow [2024-10-11 17:11:04,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 220 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:04,369 INFO L231 Difference]: Finished difference. Result has 181 places, 172 transitions, 380 flow [2024-10-11 17:11:04,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=181, PETRI_TRANSITIONS=172} [2024-10-11 17:11:04,371 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 5 predicate places. [2024-10-11 17:11:04,371 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 172 transitions, 380 flow [2024-10-11 17:11:04,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:04,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:04,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:11:04,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1827650231, now seen corresponding path program 1 times [2024-10-11 17:11:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730302471] [2024-10-11 17:11:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:04,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730302471] [2024-10-11 17:11:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730302471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:04,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:04,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921334209] [2024-10-11 17:11:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:04,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 193 [2024-10-11 17:11:04,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:04,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:04,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 193 [2024-10-11 17:11:04,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:05,598 INFO L124 PetriNetUnfolderBase]: 4085/14792 cut-off events. [2024-10-11 17:11:05,599 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-10-11 17:11:05,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21539 conditions, 14792 events. 4085/14792 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 164322 event pairs, 1409 based on Foata normal form. 0/13243 useless extension candidates. Maximal degree in co-relation 21532. Up to 3578 conditions per place. [2024-10-11 17:11:05,660 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 58 selfloop transitions, 14 changer transitions 0/205 dead transitions. [2024-10-11 17:11:05,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 205 transitions, 601 flow [2024-10-11 17:11:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2024-10-11 17:11:05,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8272884283246977 [2024-10-11 17:11:05,662 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 380 flow. Second operand 3 states and 479 transitions. [2024-10-11 17:11:05,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 205 transitions, 601 flow [2024-10-11 17:11:05,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 205 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:11:05,666 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 490 flow [2024-10-11 17:11:05,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2024-10-11 17:11:05,667 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 4 predicate places. [2024-10-11 17:11:05,667 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 490 flow [2024-10-11 17:11:05,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:05,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:05,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:11:05,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 909106138, now seen corresponding path program 1 times [2024-10-11 17:11:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546918557] [2024-10-11 17:11:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546918557] [2024-10-11 17:11:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546918557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:05,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842799750] [2024-10-11 17:11:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:05,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:05,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-10-11 17:11:05,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:05,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:05,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-10-11 17:11:05,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:07,178 INFO L124 PetriNetUnfolderBase]: 4151/16635 cut-off events. [2024-10-11 17:11:07,179 INFO L125 PetriNetUnfolderBase]: For 4322/4497 co-relation queries the response was YES. [2024-10-11 17:11:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27453 conditions, 16635 events. 4151/16635 cut-off events. For 4322/4497 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 195215 event pairs, 2411 based on Foata normal form. 46/15100 useless extension candidates. Maximal degree in co-relation 27445. Up to 5625 conditions per place. [2024-10-11 17:11:07,263 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 52 selfloop transitions, 14 changer transitions 0/210 dead transitions. [2024-10-11 17:11:07,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 210 transitions, 708 flow [2024-10-11 17:11:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-10-11 17:11:07,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169257340241797 [2024-10-11 17:11:07,266 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 490 flow. Second operand 3 states and 473 transitions. [2024-10-11 17:11:07,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 210 transitions, 708 flow [2024-10-11 17:11:07,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 210 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:07,275 INFO L231 Difference]: Finished difference. Result has 182 places, 198 transitions, 588 flow [2024-10-11 17:11:07,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=182, PETRI_TRANSITIONS=198} [2024-10-11 17:11:07,276 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 6 predicate places. [2024-10-11 17:11:07,276 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 198 transitions, 588 flow [2024-10-11 17:11:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:07,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:07,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:07,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:11:07,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:07,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1460415895, now seen corresponding path program 1 times [2024-10-11 17:11:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405372055] [2024-10-11 17:11:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405372055] [2024-10-11 17:11:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405372055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818594400] [2024-10-11 17:11:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:07,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:11:07,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:11:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:07,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:11:07,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:11:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:07,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:11:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:07,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818594400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:11:07,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:11:07,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:11:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3799002] [2024-10-11 17:11:07,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:11:07,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:11:07,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:11:07,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:11:07,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 193 [2024-10-11 17:11:07,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 198 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 146.5) internal successors, (1465), 10 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:07,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:07,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 193 [2024-10-11 17:11:07,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:08,034 INFO L124 PetriNetUnfolderBase]: 762/3672 cut-off events. [2024-10-11 17:11:08,035 INFO L125 PetriNetUnfolderBase]: For 511/522 co-relation queries the response was YES. [2024-10-11 17:11:08,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 3672 events. 762/3672 cut-off events. For 511/522 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 33068 event pairs, 75 based on Foata normal form. 105/3541 useless extension candidates. Maximal degree in co-relation 5695. Up to 478 conditions per place. [2024-10-11 17:11:08,047 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 72 selfloop transitions, 7 changer transitions 0/202 dead transitions. [2024-10-11 17:11:08,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 202 transitions, 708 flow [2024-10-11 17:11:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:11:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:11:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1377 transitions. [2024-10-11 17:11:08,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927461139896373 [2024-10-11 17:11:08,050 INFO L175 Difference]: Start difference. First operand has 182 places, 198 transitions, 588 flow. Second operand 9 states and 1377 transitions. [2024-10-11 17:11:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 202 transitions, 708 flow [2024-10-11 17:11:08,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 202 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:08,054 INFO L231 Difference]: Finished difference. Result has 143 places, 146 transitions, 432 flow [2024-10-11 17:11:08,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=432, PETRI_PLACES=143, PETRI_TRANSITIONS=146} [2024-10-11 17:11:08,055 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -33 predicate places. [2024-10-11 17:11:08,055 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 146 transitions, 432 flow [2024-10-11 17:11:08,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.5) internal successors, (1465), 10 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:08,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:08,056 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:08,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:11:08,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:11:08,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:08,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -685547369, now seen corresponding path program 1 times [2024-10-11 17:11:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669869528] [2024-10-11 17:11:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:11:08,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669869528] [2024-10-11 17:11:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669869528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:08,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329050718] [2024-10-11 17:11:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:08,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:08,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:08,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:08,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-10-11 17:11:08,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:08,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:08,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-10-11 17:11:08,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:08,438 INFO L124 PetriNetUnfolderBase]: 260/1287 cut-off events. [2024-10-11 17:11:08,438 INFO L125 PetriNetUnfolderBase]: For 454/475 co-relation queries the response was YES. [2024-10-11 17:11:08,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2333 conditions, 1287 events. 260/1287 cut-off events. For 454/475 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8696 event pairs, 132 based on Foata normal form. 7/1202 useless extension candidates. Maximal degree in co-relation 2324. Up to 459 conditions per place. [2024-10-11 17:11:08,446 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 42 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2024-10-11 17:11:08,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 160 transitions, 584 flow [2024-10-11 17:11:08,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2024-10-11 17:11:08,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927461139896373 [2024-10-11 17:11:08,450 INFO L175 Difference]: Start difference. First operand has 143 places, 146 transitions, 432 flow. Second operand 3 states and 459 transitions. [2024-10-11 17:11:08,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 160 transitions, 584 flow [2024-10-11 17:11:08,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 160 transitions, 569 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-11 17:11:08,454 INFO L231 Difference]: Finished difference. Result has 142 places, 154 transitions, 515 flow [2024-10-11 17:11:08,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=142, PETRI_TRANSITIONS=154} [2024-10-11 17:11:08,455 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -34 predicate places. [2024-10-11 17:11:08,455 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 154 transitions, 515 flow [2024-10-11 17:11:08,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:08,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:08,456 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:08,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:11:08,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:08,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1241489000, now seen corresponding path program 1 times [2024-10-11 17:11:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270883366] [2024-10-11 17:11:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270883366] [2024-10-11 17:11:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270883366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009995647] [2024-10-11 17:11:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:08,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:08,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:08,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:08,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-10-11 17:11:08,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 154 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:08,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:08,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-10-11 17:11:08,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:08,677 INFO L124 PetriNetUnfolderBase]: 291/1359 cut-off events. [2024-10-11 17:11:08,678 INFO L125 PetriNetUnfolderBase]: For 1124/1159 co-relation queries the response was YES. [2024-10-11 17:11:08,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1359 events. 291/1359 cut-off events. For 1124/1159 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9379 event pairs, 134 based on Foata normal form. 9/1292 useless extension candidates. Maximal degree in co-relation 2778. Up to 501 conditions per place. [2024-10-11 17:11:08,686 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 49 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2024-10-11 17:11:08,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 169 transitions, 704 flow [2024-10-11 17:11:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2024-10-11 17:11:08,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7944732297063903 [2024-10-11 17:11:08,688 INFO L175 Difference]: Start difference. First operand has 142 places, 154 transitions, 515 flow. Second operand 3 states and 460 transitions. [2024-10-11 17:11:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 169 transitions, 704 flow [2024-10-11 17:11:08,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 169 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:08,693 INFO L231 Difference]: Finished difference. Result has 144 places, 162 transitions, 601 flow [2024-10-11 17:11:08,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=144, PETRI_TRANSITIONS=162} [2024-10-11 17:11:08,694 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -32 predicate places. [2024-10-11 17:11:08,694 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 162 transitions, 601 flow [2024-10-11 17:11:08,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:08,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:08,695 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:08,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:11:08,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:11:08,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1863380673, now seen corresponding path program 1 times [2024-10-11 17:11:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062859612] [2024-10-11 17:11:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:08,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:11:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:08,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:11:08,741 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:11:08,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-11 17:11:08,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-11 17:11:08,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-11 17:11:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-11 17:11:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-11 17:11:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-11 17:11:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-11 17:11:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-11 17:11:08,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-11 17:11:08,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-11 17:11:08,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:11:08,744 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:08,745 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:11:08,745 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:11:08,775 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:11:08,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 242 transitions, 511 flow [2024-10-11 17:11:08,832 INFO L124 PetriNetUnfolderBase]: 62/532 cut-off events. [2024-10-11 17:11:08,833 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:11:08,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 532 events. 62/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2051 event pairs, 1 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 355. Up to 16 conditions per place. [2024-10-11 17:11:08,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 242 transitions, 511 flow [2024-10-11 17:11:08,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 242 transitions, 511 flow [2024-10-11 17:11:08,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:11:08,839 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4989093c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:11:08,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:11:08,841 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:11:08,841 INFO L124 PetriNetUnfolderBase]: 4/49 cut-off events. [2024-10-11 17:11:08,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:11:08,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:08,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:08,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1938267136, now seen corresponding path program 1 times [2024-10-11 17:11:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986546061] [2024-10-11 17:11:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986546061] [2024-10-11 17:11:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986546061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110212514] [2024-10-11 17:11:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:08,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:11:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:11:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:11:08,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 242 [2024-10-11 17:11:08,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 242 transitions, 511 flow. Second operand has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:08,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:08,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 242 [2024-10-11 17:11:08,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:11,089 INFO L124 PetriNetUnfolderBase]: 4833/20255 cut-off events. [2024-10-11 17:11:11,089 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2024-10-11 17:11:11,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27680 conditions, 20255 events. 4833/20255 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 243219 event pairs, 4795 based on Foata normal form. 5465/23774 useless extension candidates. Maximal degree in co-relation 23268. Up to 6995 conditions per place. [2024-10-11 17:11:11,232 INFO L140 encePairwiseOnDemand]: 217/242 looper letters, 28 selfloop transitions, 0 changer transitions 0/215 dead transitions. [2024-10-11 17:11:11,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 513 flow [2024-10-11 17:11:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:11:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 17:11:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 429 transitions. [2024-10-11 17:11:11,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2024-10-11 17:11:11,236 INFO L175 Difference]: Start difference. First operand has 220 places, 242 transitions, 511 flow. Second operand 2 states and 429 transitions. [2024-10-11 17:11:11,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 513 flow [2024-10-11 17:11:11,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:11,241 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 457 flow [2024-10-11 17:11:11,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-10-11 17:11:11,242 INFO L277 CegarLoopForPetriNet]: 220 programPoint places, -1 predicate places. [2024-10-11 17:11:11,243 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 457 flow [2024-10-11 17:11:11,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:11,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:11,243 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:11:11,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1292357163, now seen corresponding path program 1 times [2024-10-11 17:11:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011327321] [2024-10-11 17:11:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:11,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:11,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011327321] [2024-10-11 17:11:11,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011327321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:11,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:11,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709576384] [2024-10-11 17:11:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:11,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:11,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 242 [2024-10-11 17:11:11,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:11,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:11,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 242 [2024-10-11 17:11:11,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:14,814 INFO L124 PetriNetUnfolderBase]: 8969/35405 cut-off events. [2024-10-11 17:11:14,814 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-10-11 17:11:14,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48644 conditions, 35405 events. 8969/35405 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 458373 event pairs, 8324 based on Foata normal form. 1/32003 useless extension candidates. Maximal degree in co-relation 48638. Up to 12802 conditions per place. [2024-10-11 17:11:14,997 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 39 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-10-11 17:11:14,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 222 transitions, 553 flow [2024-10-11 17:11:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2024-10-11 17:11:14,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8099173553719008 [2024-10-11 17:11:14,999 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 457 flow. Second operand 3 states and 588 transitions. [2024-10-11 17:11:15,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 222 transitions, 553 flow [2024-10-11 17:11:15,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:15,004 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 469 flow [2024-10-11 17:11:15,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2024-10-11 17:11:15,004 INFO L277 CegarLoopForPetriNet]: 220 programPoint places, 2 predicate places. [2024-10-11 17:11:15,004 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 469 flow [2024-10-11 17:11:15,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:15,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:15,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:15,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:11:15,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:15,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2122930970, now seen corresponding path program 1 times [2024-10-11 17:11:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:15,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290701190] [2024-10-11 17:11:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290701190] [2024-10-11 17:11:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290701190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231960700] [2024-10-11 17:11:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:15,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:15,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 242 [2024-10-11 17:11:15,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:15,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:15,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 242 [2024-10-11 17:11:15,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:21,874 INFO L124 PetriNetUnfolderBase]: 19695/66075 cut-off events. [2024-10-11 17:11:21,874 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2024-10-11 17:11:22,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95001 conditions, 66075 events. 19695/66075 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 893559 event pairs, 7382 based on Foata normal form. 0/60323 useless extension candidates. Maximal degree in co-relation 94993. Up to 20118 conditions per place. [2024-10-11 17:11:22,326 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 112 selfloop transitions, 6 changer transitions 0/287 dead transitions. [2024-10-11 17:11:22,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 287 transitions, 847 flow [2024-10-11 17:11:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2024-10-11 17:11:22,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7837465564738292 [2024-10-11 17:11:22,329 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 469 flow. Second operand 6 states and 1138 transitions. [2024-10-11 17:11:22,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 287 transitions, 847 flow [2024-10-11 17:11:22,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 287 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:22,334 INFO L231 Difference]: Finished difference. Result has 225 places, 215 transitions, 477 flow [2024-10-11 17:11:22,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=225, PETRI_TRANSITIONS=215} [2024-10-11 17:11:22,335 INFO L277 CegarLoopForPetriNet]: 220 programPoint places, 5 predicate places. [2024-10-11 17:11:22,335 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 215 transitions, 477 flow [2024-10-11 17:11:22,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:22,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:22,335 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:22,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:11:22,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:22,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2072502008, now seen corresponding path program 1 times [2024-10-11 17:11:22,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146224615] [2024-10-11 17:11:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146224615] [2024-10-11 17:11:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146224615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:22,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432013586] [2024-10-11 17:11:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:22,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:22,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 242 [2024-10-11 17:11:22,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 215 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:22,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:22,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 242 [2024-10-11 17:11:22,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand