./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_24-sound_lock_racing.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_24-sound_lock_racing.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 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:10:50,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:10:50,328 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:50,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:10:50,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:10:50,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:10:50,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:10:50,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:10:50,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:10:50,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:10:50,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:10:50,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:10:50,367 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:10:50,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:10:50,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:10:50,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:10:50,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:10:50,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:10:50,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:10:50,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:10:50,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:10:50,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:10:50,372 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:10:50,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:10:50,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:10:50,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:10:50,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:10:50,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:10:50,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:10:50,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:10:50,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:10:50,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:50,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:10:50,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:10:50,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:10:50,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:10:50,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:10:50,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:10:50,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:10:50,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:10:50,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:10:50,379 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 -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 [2024-10-11 17:10:50,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:10:50,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:10:50,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:10:50,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:10:50,688 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:10:50,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2024-10-11 17:10:52,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:10:52,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:10:52,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2024-10-11 17:10:52,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd705f7f4/34eb77228b464d048321c17a9e8dc476/FLAG297d1e5f9 [2024-10-11 17:10:52,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd705f7f4/34eb77228b464d048321c17a9e8dc476 [2024-10-11 17:10:52,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:10:52,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:10:52,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:52,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:10:52,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:10:52,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:52" (1/1) ... [2024-10-11 17:10:52,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a21051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:52, skipping insertion in model container [2024-10-11 17:10:52,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:52" (1/1) ... [2024-10-11 17:10:52,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:10:53,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:53,050 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:10:53,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:53,161 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:10:53,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53 WrapperNode [2024-10-11 17:10:53,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:53,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:53,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:10:53,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:10:53,168 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:10:53" (1/1) ... [2024-10-11 17:10:53,186 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:10:53" (1/1) ... [2024-10-11 17:10:53,220 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-10-11 17:10:53,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:53,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:10:53,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:10:53,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:10:53,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,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:10:53" (1/1) ... [2024-10-11 17:10:53,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:10:53,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:10:53,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:10:53,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:10:53,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (1/1) ... [2024-10-11 17:10:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:53,312 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:10:53,315 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:10:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:10:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:10:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:10:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:10:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:10:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:10:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:10:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:10:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:10:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:10:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:10:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:10:53,372 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:10:53,574 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:10:53,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:10:53,910 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:10:53,910 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:10:53,960 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:10:53,961 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 17:10:53,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:53 BoogieIcfgContainer [2024-10-11 17:10:53,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:10:53,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:10:53,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:10:53,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:10:53,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:10:52" (1/3) ... [2024-10-11 17:10:53,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f44859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:53, skipping insertion in model container [2024-10-11 17:10:53,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:53" (2/3) ... [2024-10-11 17:10:53,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f44859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:53, skipping insertion in model container [2024-10-11 17:10:53,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:53" (3/3) ... [2024-10-11 17:10:53,971 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2024-10-11 17:10:53,989 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:10:53,989 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 17:10:53,989 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:10:54,046 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:10:54,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 155 transitions, 317 flow [2024-10-11 17:10:54,178 INFO L124 PetriNetUnfolderBase]: 20/214 cut-off events. [2024-10-11 17:10:54,179 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:10:54,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 214 events. 20/214 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 621 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2024-10-11 17:10:54,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 155 transitions, 317 flow [2024-10-11 17:10:54,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 155 transitions, 317 flow [2024-10-11 17:10:54,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:54,213 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;@45d96b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:54,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 17:10:54,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:54,231 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2024-10-11 17:10:54,231 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:54,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:54,232 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] [2024-10-11 17:10:54,233 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:10:54,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash -778459379, now seen corresponding path program 1 times [2024-10-11 17:10:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626304549] [2024-10-11 17:10:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:54,616 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:10:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626304549] [2024-10-11 17:10:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626304549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:54,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:54,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785602390] [2024-10-11 17:10:54,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:54,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:54,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 155 [2024-10-11 17:10:54,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 155 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 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:10:54,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:54,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 155 [2024-10-11 17:10:54,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:54,870 INFO L124 PetriNetUnfolderBase]: 49/571 cut-off events. [2024-10-11 17:10:54,871 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:10:54,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 571 events. 49/571 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2733 event pairs, 35 based on Foata normal form. 63/577 useless extension candidates. Maximal degree in co-relation 607. Up to 108 conditions per place. [2024-10-11 17:10:54,875 INFO L140 encePairwiseOnDemand]: 140/155 looper letters, 22 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-10-11 17:10:54,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 147 transitions, 349 flow [2024-10-11 17:10:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:10:54,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8946236559139785 [2024-10-11 17:10:54,896 INFO L175 Difference]: Start difference. First operand has 144 places, 155 transitions, 317 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:10:54,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 147 transitions, 349 flow [2024-10-11 17:10:54,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 147 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:54,908 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 297 flow [2024-10-11 17:10:54,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2024-10-11 17:10:54,915 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2024-10-11 17:10:54,915 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 297 flow [2024-10-11 17:10:54,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 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:10:54,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:54,917 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] [2024-10-11 17:10:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:10:54,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:54,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 235746507, now seen corresponding path program 1 times [2024-10-11 17:10:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665577953] [2024-10-11 17:10:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:55,548 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:10:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665577953] [2024-10-11 17:10:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665577953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:55,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380456277] [2024-10-11 17:10:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:55,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:55,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:55,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2024-10-11 17:10:55,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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:10:55,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:55,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2024-10-11 17:10:55,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:55,926 INFO L124 PetriNetUnfolderBase]: 109/671 cut-off events. [2024-10-11 17:10:55,926 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:10:55,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 671 events. 109/671 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3789 event pairs, 7 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 859. Up to 181 conditions per place. [2024-10-11 17:10:55,935 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 48 selfloop transitions, 5 changer transitions 0/164 dead transitions. [2024-10-11 17:10:55,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 164 transitions, 449 flow [2024-10-11 17:10:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2024-10-11 17:10:55,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7806451612903226 [2024-10-11 17:10:55,944 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 297 flow. Second operand 6 states and 726 transitions. [2024-10-11 17:10:55,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 164 transitions, 449 flow [2024-10-11 17:10:55,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 164 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:55,950 INFO L231 Difference]: Finished difference. Result has 147 places, 140 transitions, 301 flow [2024-10-11 17:10:55,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=147, PETRI_TRANSITIONS=140} [2024-10-11 17:10:55,951 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 3 predicate places. [2024-10-11 17:10:55,951 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 140 transitions, 301 flow [2024-10-11 17:10:55,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 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:10:55,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:55,952 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] [2024-10-11 17:10:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:10:55,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1801427432, now seen corresponding path program 1 times [2024-10-11 17:10:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860459676] [2024-10-11 17:10:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:56,009 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:10:56,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:56,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860459676] [2024-10-11 17:10:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860459676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:56,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:56,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142284191] [2024-10-11 17:10:56,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:56,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 155 [2024-10-11 17:10:56,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 140 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:10:56,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:56,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 155 [2024-10-11 17:10:56,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:56,170 INFO L124 PetriNetUnfolderBase]: 92/803 cut-off events. [2024-10-11 17:10:56,171 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:10:56,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 803 events. 92/803 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4684 event pairs, 30 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-10-11 17:10:56,176 INFO L140 encePairwiseOnDemand]: 146/155 looper letters, 30 selfloop transitions, 6 changer transitions 0/153 dead transitions. [2024-10-11 17:10:56,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 402 flow [2024-10-11 17:10:56,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2024-10-11 17:10:56,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2024-10-11 17:10:56,180 INFO L175 Difference]: Start difference. First operand has 147 places, 140 transitions, 301 flow. Second operand 3 states and 396 transitions. [2024-10-11 17:10:56,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 402 flow [2024-10-11 17:10:56,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 153 transitions, 392 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:56,186 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 329 flow [2024-10-11 17:10:56,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2024-10-11 17:10:56,188 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2024-10-11 17:10:56,188 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 329 flow [2024-10-11 17:10:56,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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:10:56,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:56,189 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] [2024-10-11 17:10:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:10:56,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1816965716, now seen corresponding path program 1 times [2024-10-11 17:10:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693460013] [2024-10-11 17:10:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:56,241 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:10:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:56,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693460013] [2024-10-11 17:10:56,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693460013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:56,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:56,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:56,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861587154] [2024-10-11 17:10:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:56,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:56,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 155 [2024-10-11 17:10:56,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:10:56,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:56,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 155 [2024-10-11 17:10:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:56,412 INFO L124 PetriNetUnfolderBase]: 95/805 cut-off events. [2024-10-11 17:10:56,413 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-11 17:10:56,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 805 events. 95/805 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4778 event pairs, 60 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-10-11 17:10:56,419 INFO L140 encePairwiseOnDemand]: 150/155 looper letters, 27 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2024-10-11 17:10:56,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 409 flow [2024-10-11 17:10:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2024-10-11 17:10:56,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.843010752688172 [2024-10-11 17:10:56,421 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 329 flow. Second operand 3 states and 392 transitions. [2024-10-11 17:10:56,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 409 flow [2024-10-11 17:10:56,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:56,427 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 349 flow [2024-10-11 17:10:56,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2024-10-11 17:10:56,428 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 2 predicate places. [2024-10-11 17:10:56,429 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 349 flow [2024-10-11 17:10:56,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:10:56,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:56,430 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:10:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:10:56,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:10:56,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash 517944477, now seen corresponding path program 1 times [2024-10-11 17:10:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169644152] [2024-10-11 17:10:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:56,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:56,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:56,514 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:56,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-11 17:10:56,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-11 17:10:56,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-11 17:10:56,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-11 17:10:56,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-11 17:10:56,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-11 17:10:56,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-11 17:10:56,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-11 17:10:56,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-11 17:10:56,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-11 17:10:56,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-11 17:10:56,519 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-11 17:10:56,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:10:56,520 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 17:10:56,522 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:56,522 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:10:56,550 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:10:56,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 204 transitions, 424 flow [2024-10-11 17:10:56,590 INFO L124 PetriNetUnfolderBase]: 35/350 cut-off events. [2024-10-11 17:10:56,590 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:56,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 350 events. 35/350 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1173 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 216. Up to 8 conditions per place. [2024-10-11 17:10:56,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 204 transitions, 424 flow [2024-10-11 17:10:56,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 204 transitions, 424 flow [2024-10-11 17:10:56,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:56,597 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;@45d96b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:56,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:10:56,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:56,604 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2024-10-11 17:10:56,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:56,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:56,606 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] [2024-10-11 17:10:56,607 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:10:56,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 598020493, now seen corresponding path program 1 times [2024-10-11 17:10:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902046326] [2024-10-11 17:10:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:56,650 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:10:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902046326] [2024-10-11 17:10:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902046326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:56,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:56,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70929221] [2024-10-11 17:10:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:56,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:56,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 204 [2024-10-11 17:10:56,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 204 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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:10:56,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:56,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 204 [2024-10-11 17:10:56,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:57,289 INFO L124 PetriNetUnfolderBase]: 789/4313 cut-off events. [2024-10-11 17:10:57,290 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-11 17:10:57,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5666 conditions, 4313 events. 789/4313 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41133 event pairs, 348 based on Foata normal form. 749/4675 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-10-11 17:10:57,319 INFO L140 encePairwiseOnDemand]: 183/204 looper letters, 31 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2024-10-11 17:10:57,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 191 transitions, 464 flow [2024-10-11 17:10:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2024-10-11 17:10:57,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758169934640523 [2024-10-11 17:10:57,322 INFO L175 Difference]: Start difference. First operand has 188 places, 204 transitions, 424 flow. Second operand 3 states and 536 transitions. [2024-10-11 17:10:57,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 191 transitions, 464 flow [2024-10-11 17:10:57,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 191 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:57,326 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 396 flow [2024-10-11 17:10:57,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2024-10-11 17:10:57,327 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 1 predicate places. [2024-10-11 17:10:57,327 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 396 flow [2024-10-11 17:10:57,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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:10:57,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:57,328 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] [2024-10-11 17:10:57,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:10:57,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:57,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 182982859, now seen corresponding path program 1 times [2024-10-11 17:10:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:57,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646853351] [2024-10-11 17:10:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:57,645 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:10:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646853351] [2024-10-11 17:10:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646853351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:57,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676351571] [2024-10-11 17:10:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:57,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:57,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 204 [2024-10-11 17:10:57,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 0 states have call successors, (0), 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:10:57,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:57,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 204 [2024-10-11 17:10:57,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:58,668 INFO L124 PetriNetUnfolderBase]: 1719/5688 cut-off events. [2024-10-11 17:10:58,669 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-10-11 17:10:58,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 5688 events. 1719/5688 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 54074 event pairs, 222 based on Foata normal form. 0/5295 useless extension candidates. Maximal degree in co-relation 1233. Up to 2015 conditions per place. [2024-10-11 17:10:58,707 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 80 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2024-10-11 17:10:58,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 232 transitions, 662 flow [2024-10-11 17:10:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2024-10-11 17:10:58,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-10-11 17:10:58,710 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 396 flow. Second operand 6 states and 968 transitions. [2024-10-11 17:10:58,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 232 transitions, 662 flow [2024-10-11 17:10:58,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 232 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:58,717 INFO L231 Difference]: Finished difference. Result has 192 places, 184 transitions, 404 flow [2024-10-11 17:10:58,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2024-10-11 17:10:58,719 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 4 predicate places. [2024-10-11 17:10:58,719 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 404 flow [2024-10-11 17:10:58,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 0 states have call successors, (0), 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:10:58,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:58,721 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] [2024-10-11 17:10:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:10:58,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1648112099, now seen corresponding path program 1 times [2024-10-11 17:10:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231675785] [2024-10-11 17:10:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:58,766 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:10:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231675785] [2024-10-11 17:10:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231675785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416832115] [2024-10-11 17:10:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:58,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:58,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 204 [2024-10-11 17:10:58,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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:10:58,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:58,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 204 [2024-10-11 17:10:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:00,634 INFO L124 PetriNetUnfolderBase]: 3894/14611 cut-off events. [2024-10-11 17:11:00,634 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-10-11 17:11:00,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21162 conditions, 14611 events. 3894/14611 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 164005 event pairs, 1530 based on Foata normal form. 0/13069 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2024-10-11 17:11:00,738 INFO L140 encePairwiseOnDemand]: 185/204 looper letters, 58 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2024-10-11 17:11:00,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 217 transitions, 625 flow [2024-10-11 17:11:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2024-10-11 17:11:00,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8415032679738562 [2024-10-11 17:11:00,741 INFO L175 Difference]: Start difference. First operand has 192 places, 184 transitions, 404 flow. Second operand 3 states and 515 transitions. [2024-10-11 17:11:00,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 217 transitions, 625 flow [2024-10-11 17:11:00,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 217 transitions, 613 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:11:00,746 INFO L231 Difference]: Finished difference. Result has 191 places, 198 transitions, 514 flow [2024-10-11 17:11:00,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=191, PETRI_TRANSITIONS=198} [2024-10-11 17:11:00,748 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 3 predicate places. [2024-10-11 17:11:00,748 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 198 transitions, 514 flow [2024-10-11 17:11:00,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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:00,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:00,749 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] [2024-10-11 17:11:00,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:11:00,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -368572323, now seen corresponding path program 1 times [2024-10-11 17:11:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143943784] [2024-10-11 17:11:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:00,794 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:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143943784] [2024-10-11 17:11:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143943784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383820065] [2024-10-11 17:11:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:00,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:00,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:00,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204 [2024-10-11 17:11:00,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 198 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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:00,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:00,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204 [2024-10-11 17:11:00,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:02,952 INFO L124 PetriNetUnfolderBase]: 4021/16464 cut-off events. [2024-10-11 17:11:02,953 INFO L125 PetriNetUnfolderBase]: For 4445/4626 co-relation queries the response was YES. [2024-10-11 17:11:03,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27152 conditions, 16464 events. 4021/16464 cut-off events. For 4445/4626 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 193929 event pairs, 2411 based on Foata normal form. 46/14965 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2024-10-11 17:11:03,056 INFO L140 encePairwiseOnDemand]: 195/204 looper letters, 52 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2024-10-11 17:11:03,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 222 transitions, 732 flow [2024-10-11 17:11:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-10-11 17:11:03,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8316993464052288 [2024-10-11 17:11:03,059 INFO L175 Difference]: Start difference. First operand has 191 places, 198 transitions, 514 flow. Second operand 3 states and 509 transitions. [2024-10-11 17:11:03,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 222 transitions, 732 flow [2024-10-11 17:11:03,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 222 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:03,075 INFO L231 Difference]: Finished difference. Result has 193 places, 210 transitions, 612 flow [2024-10-11 17:11:03,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=193, PETRI_TRANSITIONS=210} [2024-10-11 17:11:03,078 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 5 predicate places. [2024-10-11 17:11:03,078 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 210 transitions, 612 flow [2024-10-11 17:11:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:03,079 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:11:03,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:03,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash 556786939, now seen corresponding path program 1 times [2024-10-11 17:11:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276634280] [2024-10-11 17:11:03,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:03,176 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:03,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276634280] [2024-10-11 17:11:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276634280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064863154] [2024-10-11 17:11:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:03,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:03,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:03,180 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:03,181 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:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:03,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:11:03,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:11:03,358 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:03,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:11:03,405 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:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064863154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:11:03,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:11:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:11:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428036032] [2024-10-11 17:11:03,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:11:03,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:11:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:03,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:11:03,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:11:03,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 204 [2024-10-11 17:11:03,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 210 transitions, 612 flow. Second operand has 10 states, 10 states have (on average 158.5) internal successors, (1585), 10 states have internal predecessors, (1585), 0 states have call successors, (0), 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,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:03,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 204 [2024-10-11 17:11:03,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:04,042 INFO L124 PetriNetUnfolderBase]: 806/4161 cut-off events. [2024-10-11 17:11:04,042 INFO L125 PetriNetUnfolderBase]: For 628/679 co-relation queries the response was YES. [2024-10-11 17:11:04,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 4161 events. 806/4161 cut-off events. For 628/679 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 39610 event pairs, 47 based on Foata normal form. 110/3965 useless extension candidates. Maximal degree in co-relation 3055. Up to 470 conditions per place. [2024-10-11 17:11:04,077 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 72 selfloop transitions, 7 changer transitions 0/217 dead transitions. [2024-10-11 17:11:04,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 217 transitions, 738 flow [2024-10-11 17:11:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:11:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:11:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1485 transitions. [2024-10-11 17:11:04,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2024-10-11 17:11:04,081 INFO L175 Difference]: Start difference. First operand has 193 places, 210 transitions, 612 flow. Second operand 9 states and 1485 transitions. [2024-10-11 17:11:04,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 217 transitions, 738 flow [2024-10-11 17:11:04,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 217 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:04,089 INFO L231 Difference]: Finished difference. Result has 156 places, 161 transitions, 462 flow [2024-10-11 17:11:04,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=462, PETRI_PLACES=156, PETRI_TRANSITIONS=161} [2024-10-11 17:11:04,090 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, -32 predicate places. [2024-10-11 17:11:04,090 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 161 transitions, 462 flow [2024-10-11 17:11:04,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 158.5) internal successors, (1585), 10 states have internal predecessors, (1585), 0 states have call successors, (0), 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,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:04,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:04,111 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:04,293 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,SelfDestructingSolverStorable9 [2024-10-11 17:11:04,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:04,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1630048700, now seen corresponding path program 1 times [2024-10-11 17:11:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:04,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764036425] [2024-10-11 17:11:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:04,355 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:04,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:04,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764036425] [2024-10-11 17:11:04,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764036425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:04,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:04,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389862196] [2024-10-11 17:11:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:04,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204 [2024-10-11 17:11:04,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 161 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:04,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204 [2024-10-11 17:11:04,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:04,656 INFO L124 PetriNetUnfolderBase]: 261/1302 cut-off events. [2024-10-11 17:11:04,657 INFO L125 PetriNetUnfolderBase]: For 448/469 co-relation queries the response was YES. [2024-10-11 17:11:04,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 1302 events. 261/1302 cut-off events. For 448/469 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8676 event pairs, 132 based on Foata normal form. 7/1216 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-10-11 17:11:04,667 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 42 selfloop transitions, 12 changer transitions 0/175 dead transitions. [2024-10-11 17:11:04,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 175 transitions, 614 flow [2024-10-11 17:11:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-10-11 17:11:04,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2024-10-11 17:11:04,669 INFO L175 Difference]: Start difference. First operand has 156 places, 161 transitions, 462 flow. Second operand 3 states and 495 transitions. [2024-10-11 17:11:04,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 175 transitions, 614 flow [2024-10-11 17:11:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 175 transitions, 599 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-11 17:11:04,676 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 545 flow [2024-10-11 17:11:04,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=155, PETRI_TRANSITIONS=169} [2024-10-11 17:11:04,677 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, -33 predicate places. [2024-10-11 17:11:04,678 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 545 flow [2024-10-11 17:11:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:04,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:11:04,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:04,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -617759989, now seen corresponding path program 1 times [2024-10-11 17:11:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449606465] [2024-10-11 17:11:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:04,727 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,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:04,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449606465] [2024-10-11 17:11:04,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449606465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:04,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:04,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:04,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427367269] [2024-10-11 17:11:04,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:04,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:04,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204 [2024-10-11 17:11:04,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 169 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:04,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204 [2024-10-11 17:11:04,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:04,946 INFO L124 PetriNetUnfolderBase]: 292/1374 cut-off events. [2024-10-11 17:11:04,946 INFO L125 PetriNetUnfolderBase]: For 1085/1120 co-relation queries the response was YES. [2024-10-11 17:11:04,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1374 events. 292/1374 cut-off events. For 1085/1120 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9372 event pairs, 134 based on Foata normal form. 9/1306 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-10-11 17:11:04,959 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 49 selfloop transitions, 12 changer transitions 0/184 dead transitions. [2024-10-11 17:11:04,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 734 flow [2024-10-11 17:11:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-10-11 17:11:04,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2024-10-11 17:11:04,961 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 545 flow. Second operand 3 states and 496 transitions. [2024-10-11 17:11:04,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 734 flow [2024-10-11 17:11:04,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 184 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:04,967 INFO L231 Difference]: Finished difference. Result has 157 places, 177 transitions, 631 flow [2024-10-11 17:11:04,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=157, PETRI_TRANSITIONS=177} [2024-10-11 17:11:04,968 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, -31 predicate places. [2024-10-11 17:11:04,968 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 177 transitions, 631 flow [2024-10-11 17:11:04,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:04,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:04,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:11:04,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash -785800553, now seen corresponding path program 1 times [2024-10-11 17:11:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:04,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975632358] [2024-10-11 17:11:04,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:04,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:11:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:05,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:11:05,012 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:11:05,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-11 17:11:05,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-11 17:11:05,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-11 17:11:05,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-11 17:11:05,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-11 17:11:05,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-11 17:11:05,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-11 17:11:05,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-11 17:11:05,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-11 17:11:05,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-11 17:11:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:11:05,015 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:05,016 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:11:05,016 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:11:05,045 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:11:05,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 253 transitions, 533 flow [2024-10-11 17:11:05,102 INFO L124 PetriNetUnfolderBase]: 55/531 cut-off events. [2024-10-11 17:11:05,102 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:11:05,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 531 events. 55/531 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1984 event pairs, 1 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 358. Up to 16 conditions per place. [2024-10-11 17:11:05,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 253 transitions, 533 flow [2024-10-11 17:11:05,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 253 transitions, 533 flow [2024-10-11 17:11:05,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:11:05,111 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;@45d96b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:11:05,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:11:05,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:11:05,115 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2024-10-11 17:11:05,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:11:05,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:05,115 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] [2024-10-11 17:11:05,115 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:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1041899757, now seen corresponding path program 1 times [2024-10-11 17:11:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:05,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000729455] [2024-10-11 17:11:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:05,154 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,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000729455] [2024-10-11 17:11:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000729455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210854985] [2024-10-11 17:11:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:05,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 253 [2024-10-11 17:11:05,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 253 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:05,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 253 [2024-10-11 17:11:05,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:09,291 INFO L124 PetriNetUnfolderBase]: 8949/35357 cut-off events. [2024-10-11 17:11:09,291 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-10-11 17:11:09,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48595 conditions, 35357 events. 8949/35357 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 457962 event pairs, 8324 based on Foata normal form. 7648/39622 useless extension candidates. Maximal degree in co-relation 35526. Up to 12802 conditions per place. [2024-10-11 17:11:09,571 INFO L140 encePairwiseOnDemand]: 226/253 looper letters, 39 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-10-11 17:11:09,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 234 transitions, 577 flow [2024-10-11 17:11:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-10-11 17:11:09,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8629776021080369 [2024-10-11 17:11:09,575 INFO L175 Difference]: Start difference. First operand has 232 places, 253 transitions, 533 flow. Second operand 3 states and 655 transitions. [2024-10-11 17:11:09,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 234 transitions, 577 flow [2024-10-11 17:11:09,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 234 transitions, 577 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:09,579 INFO L231 Difference]: Finished difference. Result has 233 places, 228 transitions, 493 flow [2024-10-11 17:11:09,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=233, PETRI_TRANSITIONS=228} [2024-10-11 17:11:09,581 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 1 predicate places. [2024-10-11 17:11:09,581 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 228 transitions, 493 flow [2024-10-11 17:11:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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:09,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:09,582 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] [2024-10-11 17:11:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:11:09,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1549201355, now seen corresponding path program 1 times [2024-10-11 17:11:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140344609] [2024-10-11 17:11:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:09,954 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:09,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:09,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140344609] [2024-10-11 17:11:09,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140344609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:09,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171795630] [2024-10-11 17:11:09,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:09,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:09,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:09,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:10,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 253 [2024-10-11 17:11:10,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 228 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:10,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:10,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 253 [2024-10-11 17:11:10,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:15,617 INFO L124 PetriNetUnfolderBase]: 19556/50630 cut-off events. [2024-10-11 17:11:15,617 INFO L125 PetriNetUnfolderBase]: For 1427/1427 co-relation queries the response was YES. [2024-10-11 17:11:15,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79790 conditions, 50630 events. 19556/50630 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 609707 event pairs, 2086 based on Foata normal form. 0/47257 useless extension candidates. Maximal degree in co-relation 56847. Up to 20048 conditions per place. [2024-10-11 17:11:16,050 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 112 selfloop transitions, 6 changer transitions 0/299 dead transitions. [2024-10-11 17:11:16,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 299 transitions, 871 flow [2024-10-11 17:11:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2024-10-11 17:11:16,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-11 17:11:16,053 INFO L175 Difference]: Start difference. First operand has 233 places, 228 transitions, 493 flow. Second operand 6 states and 1210 transitions. [2024-10-11 17:11:16,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 299 transitions, 871 flow [2024-10-11 17:11:16,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 299 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:16,058 INFO L231 Difference]: Finished difference. Result has 236 places, 227 transitions, 501 flow [2024-10-11 17:11:16,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=501, PETRI_PLACES=236, PETRI_TRANSITIONS=227} [2024-10-11 17:11:16,060 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 4 predicate places. [2024-10-11 17:11:16,060 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 227 transitions, 501 flow [2024-10-11 17:11:16,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:11:16,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:16,062 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] [2024-10-11 17:11:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:11:16,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:16,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 552201615, now seen corresponding path program 1 times [2024-10-11 17:11:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:16,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164193638] [2024-10-11 17:11:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:16,095 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:16,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:16,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164193638] [2024-10-11 17:11:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164193638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:16,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307560937] [2024-10-11 17:11:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:16,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:16,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 253 [2024-10-11 17:11:16,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 227 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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:16,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:16,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 253 [2024-10-11 17:11:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand