./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:53:55,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:53:55,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:53:55,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:53:55,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:53:55,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:53:55,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:53:55,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:53:55,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:53:55,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:53:55,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:53:55,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:53:55,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:53:55,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:53:55,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:53:55,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:53:55,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:53:55,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:53:55,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:53:55,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:53:55,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:53:55,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:53:55,698 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:53:55,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:53:55,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:53:55,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:53:55,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:53:55,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:53:55,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:53:55,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:53:55,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:53:55,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:53:55,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:53:55,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:53:55,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:53:55,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:53:55,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:53:55,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:53:55,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:53:55,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:53:55,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:53:55,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 [2024-10-13 09:53:55,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:53:55,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:53:55,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:53:55,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:53:55,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:53:55,984 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-13 09:53:57,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:53:57,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:53:57,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2024-10-13 09:53:57,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921a8742e/0fa5ea7286484464bc6b72c0324af610/FLAG29d1801a5 [2024-10-13 09:53:57,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921a8742e/0fa5ea7286484464bc6b72c0324af610 [2024-10-13 09:53:57,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:53:57,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:53:57,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:53:57,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:53:57,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:53:57,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:57" (1/1) ... [2024-10-13 09:53:57,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce9ec8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:57, skipping insertion in model container [2024-10-13 09:53:57,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:57" (1/1) ... [2024-10-13 09:53:57,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:53:58,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:53:58,258 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:53:58,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:53:58,391 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:53:58,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58 WrapperNode [2024-10-13 09:53:58,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:53:58,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:53:58,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:53:58,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:53:58,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,436 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-10-13 09:53:58,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:53:58,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:53:58,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:53:58,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:53:58,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:53:58,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:53:58,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:53:58,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:53:58,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (1/1) ... [2024-10-13 09:53:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:53:58,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:58,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:53:58,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:53:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:53:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:53:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 09:53:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:53:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:53:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-13 09:53:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-13 09:53:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:53:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:53:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 09:53:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:53:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:53:58,561 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:53:58,663 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:53:58,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:53:58,954 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:53:58,954 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:53:59,000 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:53:59,000 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-13 09:53:59,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:59 BoogieIcfgContainer [2024-10-13 09:53:59,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:53:59,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:53:59,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:53:59,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:53:59,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:53:57" (1/3) ... [2024-10-13 09:53:59,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1331ea18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:59, skipping insertion in model container [2024-10-13 09:53:59,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:58" (2/3) ... [2024-10-13 09:53:59,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1331ea18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:59, skipping insertion in model container [2024-10-13 09:53:59,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:59" (3/3) ... [2024-10-13 09:53:59,009 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2024-10-13 09:53:59,023 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:53:59,023 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 09:53:59,023 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:53:59,076 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 09:53:59,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 155 transitions, 317 flow [2024-10-13 09:53:59,170 INFO L124 PetriNetUnfolderBase]: 20/214 cut-off events. [2024-10-13 09:53:59,170 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:53:59,176 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-13 09:53:59,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 155 transitions, 317 flow [2024-10-13 09:53:59,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 155 transitions, 317 flow [2024-10-13 09:53:59,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:53:59,204 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;@7a42f8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:53:59,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-13 09:53:59,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:53:59,216 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2024-10-13 09:53:59,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:53:59,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:59,217 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-13 09:53:59,218 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-13 09:53:59,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash -778459379, now seen corresponding path program 1 times [2024-10-13 09:53:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:59,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488087200] [2024-10-13 09:53:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:59,505 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-13 09:53:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488087200] [2024-10-13 09:53:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488087200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:59,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:59,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:53:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151633469] [2024-10-13 09:53:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:59,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:59,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:59,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 155 [2024-10-13 09:53:59,594 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-13 09:53:59,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:59,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 155 [2024-10-13 09:53:59,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:59,746 INFO L124 PetriNetUnfolderBase]: 49/571 cut-off events. [2024-10-13 09:53:59,746 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:53:59,748 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-13 09:53:59,752 INFO L140 encePairwiseOnDemand]: 140/155 looper letters, 22 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2024-10-13 09:53:59,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 147 transitions, 349 flow [2024-10-13 09:53:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-13 09:53:59,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8946236559139785 [2024-10-13 09:53:59,769 INFO L175 Difference]: Start difference. First operand has 144 places, 155 transitions, 317 flow. Second operand 3 states and 416 transitions. [2024-10-13 09:53:59,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 147 transitions, 349 flow [2024-10-13 09:53:59,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 147 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:59,779 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 297 flow [2024-10-13 09:53:59,781 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-13 09:53:59,784 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2024-10-13 09:53:59,786 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 297 flow [2024-10-13 09:53:59,786 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-13 09:53:59,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:59,786 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-13 09:53:59,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:53:59,787 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-13 09:53:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 235746507, now seen corresponding path program 1 times [2024-10-13 09:53:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:59,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521624201] [2024-10-13 09:53:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:59,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:00,246 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-13 09:54:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:00,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521624201] [2024-10-13 09:54:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521624201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:00,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:00,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:54:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851470953] [2024-10-13 09:54:00,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:00,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:54:00,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:00,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:54:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:54:00,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2024-10-13 09:54:00,370 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-13 09:54:00,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:00,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2024-10-13 09:54:00,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:00,536 INFO L124 PetriNetUnfolderBase]: 109/671 cut-off events. [2024-10-13 09:54:00,537 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 09:54:00,539 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-13 09:54:00,543 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 48 selfloop transitions, 5 changer transitions 0/164 dead transitions. [2024-10-13 09:54:00,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 164 transitions, 449 flow [2024-10-13 09:54:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:54:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:54:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2024-10-13 09:54:00,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7806451612903226 [2024-10-13 09:54:00,550 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 297 flow. Second operand 6 states and 726 transitions. [2024-10-13 09:54:00,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 164 transitions, 449 flow [2024-10-13 09:54:00,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 164 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:54:00,555 INFO L231 Difference]: Finished difference. Result has 147 places, 140 transitions, 301 flow [2024-10-13 09:54:00,556 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-13 09:54:00,556 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 3 predicate places. [2024-10-13 09:54:00,557 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 140 transitions, 301 flow [2024-10-13 09:54:00,557 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-13 09:54:00,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:00,558 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-13 09:54:00,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:54:00,558 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-13 09:54:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1801427432, now seen corresponding path program 1 times [2024-10-13 09:54:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18569876] [2024-10-13 09:54:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:00,606 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-13 09:54:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:00,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18569876] [2024-10-13 09:54:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18569876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:00,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:00,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568918721] [2024-10-13 09:54:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:00,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:00,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 155 [2024-10-13 09:54:00,630 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-13 09:54:00,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:00,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 155 [2024-10-13 09:54:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:00,761 INFO L124 PetriNetUnfolderBase]: 92/803 cut-off events. [2024-10-13 09:54:00,761 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 09:54:00,763 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-13 09:54:00,766 INFO L140 encePairwiseOnDemand]: 146/155 looper letters, 30 selfloop transitions, 6 changer transitions 0/153 dead transitions. [2024-10-13 09:54:00,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 402 flow [2024-10-13 09:54:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2024-10-13 09:54:00,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2024-10-13 09:54:00,768 INFO L175 Difference]: Start difference. First operand has 147 places, 140 transitions, 301 flow. Second operand 3 states and 396 transitions. [2024-10-13 09:54:00,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 402 flow [2024-10-13 09:54:00,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 153 transitions, 392 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:54:00,774 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 329 flow [2024-10-13 09:54:00,775 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-13 09:54:00,775 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2024-10-13 09:54:00,777 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 329 flow [2024-10-13 09:54:00,777 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-13 09:54:00,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:00,777 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-13 09:54:00,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:54:00,778 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-13 09:54:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1816965716, now seen corresponding path program 1 times [2024-10-13 09:54:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019286356] [2024-10-13 09:54:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:00,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:00,827 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-13 09:54:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019286356] [2024-10-13 09:54:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019286356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015750391] [2024-10-13 09:54:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:00,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:00,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 155 [2024-10-13 09:54:00,855 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-13 09:54:00,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:00,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 155 [2024-10-13 09:54:00,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:00,947 INFO L124 PetriNetUnfolderBase]: 95/805 cut-off events. [2024-10-13 09:54:00,948 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-13 09:54:00,949 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-13 09:54:00,951 INFO L140 encePairwiseOnDemand]: 150/155 looper letters, 27 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2024-10-13 09:54:00,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 149 transitions, 409 flow [2024-10-13 09:54:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2024-10-13 09:54:00,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.843010752688172 [2024-10-13 09:54:00,953 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 329 flow. Second operand 3 states and 392 transitions. [2024-10-13 09:54:00,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 149 transitions, 409 flow [2024-10-13 09:54:00,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:54:00,956 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 349 flow [2024-10-13 09:54:00,956 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-13 09:54:00,957 INFO L277 CegarLoopForPetriNet]: 144 programPoint places, 2 predicate places. [2024-10-13 09:54:00,957 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 349 flow [2024-10-13 09:54:00,957 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-13 09:54:00,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:00,958 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-13 09:54:00,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:54:00,958 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-13 09:54:00,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash 517944477, now seen corresponding path program 1 times [2024-10-13 09:54:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:00,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8456451] [2024-10-13 09:54:00,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:54:00,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:54:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:54:01,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:54:01,019 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:54:01,020 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-13 09:54:01,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-13 09:54:01,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-13 09:54:01,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-13 09:54:01,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-13 09:54:01,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-13 09:54:01,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-13 09:54:01,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-13 09:54:01,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-13 09:54:01,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-13 09:54:01,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-13 09:54:01,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-13 09:54:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:54:01,024 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 09:54:01,027 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:54:01,027 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 09:54:01,053 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:54:01,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 204 transitions, 424 flow [2024-10-13 09:54:01,085 INFO L124 PetriNetUnfolderBase]: 35/350 cut-off events. [2024-10-13 09:54:01,086 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:54:01,088 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-13 09:54:01,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 204 transitions, 424 flow [2024-10-13 09:54:01,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 204 transitions, 424 flow [2024-10-13 09:54:01,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:54:01,096 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;@7a42f8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:54:01,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-13 09:54:01,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:54:01,115 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2024-10-13 09:54:01,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:54:01,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:01,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-13 09:54:01,116 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-13 09:54:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash 598020493, now seen corresponding path program 1 times [2024-10-13 09:54:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856217289] [2024-10-13 09:54:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:01,159 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-13 09:54:01,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856217289] [2024-10-13 09:54:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856217289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:01,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:54:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116133240] [2024-10-13 09:54:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:01,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:01,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:01,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 204 [2024-10-13 09:54:01,184 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-13 09:54:01,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:01,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 204 [2024-10-13 09:54:01,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:01,737 INFO L124 PetriNetUnfolderBase]: 789/4313 cut-off events. [2024-10-13 09:54:01,737 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-13 09:54:01,749 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-13 09:54:01,766 INFO L140 encePairwiseOnDemand]: 183/204 looper letters, 31 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2024-10-13 09:54:01,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 191 transitions, 464 flow [2024-10-13 09:54:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2024-10-13 09:54:01,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758169934640523 [2024-10-13 09:54:01,769 INFO L175 Difference]: Start difference. First operand has 188 places, 204 transitions, 424 flow. Second operand 3 states and 536 transitions. [2024-10-13 09:54:01,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 191 transitions, 464 flow [2024-10-13 09:54:01,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 191 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:54:01,773 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 396 flow [2024-10-13 09:54:01,773 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-13 09:54:01,774 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 1 predicate places. [2024-10-13 09:54:01,774 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 396 flow [2024-10-13 09:54:01,775 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-13 09:54:01,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:01,775 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-13 09:54:01,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:54:01,776 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-13 09:54:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 182982859, now seen corresponding path program 1 times [2024-10-13 09:54:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261255808] [2024-10-13 09:54:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:02,062 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-13 09:54:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261255808] [2024-10-13 09:54:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261255808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:54:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924636008] [2024-10-13 09:54:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:54:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:54:02,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:54:02,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 204 [2024-10-13 09:54:02,140 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-13 09:54:02,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:02,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 204 [2024-10-13 09:54:02,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:02,935 INFO L124 PetriNetUnfolderBase]: 1719/5688 cut-off events. [2024-10-13 09:54:02,935 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-10-13 09:54:02,951 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-13 09:54:02,974 INFO L140 encePairwiseOnDemand]: 198/204 looper letters, 80 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2024-10-13 09:54:02,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 232 transitions, 662 flow [2024-10-13 09:54:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:54:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:54:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2024-10-13 09:54:02,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7908496732026143 [2024-10-13 09:54:02,977 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 396 flow. Second operand 6 states and 968 transitions. [2024-10-13 09:54:02,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 232 transitions, 662 flow [2024-10-13 09:54:02,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 232 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:54:02,981 INFO L231 Difference]: Finished difference. Result has 192 places, 184 transitions, 404 flow [2024-10-13 09:54:02,981 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-13 09:54:02,982 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 4 predicate places. [2024-10-13 09:54:02,982 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 404 flow [2024-10-13 09:54:02,983 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-13 09:54:02,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:02,983 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-13 09:54:02,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:54:02,983 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-13 09:54:02,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1648112099, now seen corresponding path program 1 times [2024-10-13 09:54:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855499191] [2024-10-13 09:54:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:03,018 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-13 09:54:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855499191] [2024-10-13 09:54:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855499191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481634654] [2024-10-13 09:54:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:03,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:03,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:03,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:03,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 204 [2024-10-13 09:54:03,052 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-13 09:54:03,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:03,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 204 [2024-10-13 09:54:03,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:04,544 INFO L124 PetriNetUnfolderBase]: 3894/14611 cut-off events. [2024-10-13 09:54:04,545 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-10-13 09:54:04,592 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-13 09:54:04,645 INFO L140 encePairwiseOnDemand]: 185/204 looper letters, 58 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2024-10-13 09:54:04,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 217 transitions, 625 flow [2024-10-13 09:54:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2024-10-13 09:54:04,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8415032679738562 [2024-10-13 09:54:04,647 INFO L175 Difference]: Start difference. First operand has 192 places, 184 transitions, 404 flow. Second operand 3 states and 515 transitions. [2024-10-13 09:54:04,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 217 transitions, 625 flow [2024-10-13 09:54:04,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 217 transitions, 613 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:54:04,653 INFO L231 Difference]: Finished difference. Result has 191 places, 198 transitions, 514 flow [2024-10-13 09:54:04,653 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-13 09:54:04,654 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 3 predicate places. [2024-10-13 09:54:04,655 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 198 transitions, 514 flow [2024-10-13 09:54:04,655 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-13 09:54:04,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:04,655 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-13 09:54:04,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:54:04,655 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-13 09:54:04,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -368572323, now seen corresponding path program 1 times [2024-10-13 09:54:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:04,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482596756] [2024-10-13 09:54:04,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:04,694 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-13 09:54:04,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482596756] [2024-10-13 09:54:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482596756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:04,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222383362] [2024-10-13 09:54:04,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:04,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:04,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:04,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204 [2024-10-13 09:54:04,728 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-13 09:54:04,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:04,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204 [2024-10-13 09:54:04,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:06,481 INFO L124 PetriNetUnfolderBase]: 4021/16464 cut-off events. [2024-10-13 09:54:06,482 INFO L125 PetriNetUnfolderBase]: For 4445/4626 co-relation queries the response was YES. [2024-10-13 09:54:06,535 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-13 09:54:06,590 INFO L140 encePairwiseOnDemand]: 195/204 looper letters, 52 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2024-10-13 09:54:06,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 222 transitions, 732 flow [2024-10-13 09:54:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-10-13 09:54:06,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8316993464052288 [2024-10-13 09:54:06,592 INFO L175 Difference]: Start difference. First operand has 191 places, 198 transitions, 514 flow. Second operand 3 states and 509 transitions. [2024-10-13 09:54:06,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 222 transitions, 732 flow [2024-10-13 09:54:06,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 222 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:54:06,604 INFO L231 Difference]: Finished difference. Result has 193 places, 210 transitions, 612 flow [2024-10-13 09:54:06,605 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-13 09:54:06,606 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, 5 predicate places. [2024-10-13 09:54:06,607 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 210 transitions, 612 flow [2024-10-13 09:54:06,607 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-13 09:54:06,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:06,607 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-13 09:54:06,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:54:06,608 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-13 09:54:06,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 556786939, now seen corresponding path program 1 times [2024-10-13 09:54:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506117484] [2024-10-13 09:54:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:06,676 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-13 09:54:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506117484] [2024-10-13 09:54:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506117484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:54:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476415208] [2024-10-13 09:54:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:06,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:54:06,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:54:06,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:54:06,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:54:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:06,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 09:54:06,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:54:06,844 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-13 09:54:06,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:54:06,903 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-13 09:54:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476415208] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:54:06,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:54:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 09:54:06,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906980974] [2024-10-13 09:54:06,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:54:06,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:54:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:54:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:54:06,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 204 [2024-10-13 09:54:06,977 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-13 09:54:06,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:06,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 204 [2024-10-13 09:54:06,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:07,546 INFO L124 PetriNetUnfolderBase]: 806/4161 cut-off events. [2024-10-13 09:54:07,546 INFO L125 PetriNetUnfolderBase]: For 628/679 co-relation queries the response was YES. [2024-10-13 09:54:07,557 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-13 09:54:07,568 INFO L140 encePairwiseOnDemand]: 199/204 looper letters, 72 selfloop transitions, 7 changer transitions 0/217 dead transitions. [2024-10-13 09:54:07,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 217 transitions, 738 flow [2024-10-13 09:54:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:54:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 09:54:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1485 transitions. [2024-10-13 09:54:07,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2024-10-13 09:54:07,571 INFO L175 Difference]: Start difference. First operand has 193 places, 210 transitions, 612 flow. Second operand 9 states and 1485 transitions. [2024-10-13 09:54:07,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 217 transitions, 738 flow [2024-10-13 09:54:07,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 217 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:54:07,576 INFO L231 Difference]: Finished difference. Result has 156 places, 161 transitions, 462 flow [2024-10-13 09:54:07,577 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-13 09:54:07,577 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, -32 predicate places. [2024-10-13 09:54:07,578 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 161 transitions, 462 flow [2024-10-13 09:54:07,578 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-13 09:54:07,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:07,579 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-13 09:54:07,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:54:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 09:54:07,780 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-13 09:54:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1630048700, now seen corresponding path program 1 times [2024-10-13 09:54:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979301837] [2024-10-13 09:54:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:07,828 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-13 09:54:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979301837] [2024-10-13 09:54:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979301837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245425882] [2024-10-13 09:54:07,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:07,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:07,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:07,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204 [2024-10-13 09:54:07,857 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-13 09:54:07,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:07,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204 [2024-10-13 09:54:07,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:07,974 INFO L124 PetriNetUnfolderBase]: 261/1302 cut-off events. [2024-10-13 09:54:07,974 INFO L125 PetriNetUnfolderBase]: For 448/469 co-relation queries the response was YES. [2024-10-13 09:54:07,979 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-13 09:54:07,983 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 42 selfloop transitions, 12 changer transitions 0/175 dead transitions. [2024-10-13 09:54:07,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 175 transitions, 614 flow [2024-10-13 09:54:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-10-13 09:54:07,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2024-10-13 09:54:07,987 INFO L175 Difference]: Start difference. First operand has 156 places, 161 transitions, 462 flow. Second operand 3 states and 495 transitions. [2024-10-13 09:54:07,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 175 transitions, 614 flow [2024-10-13 09:54:07,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 175 transitions, 599 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-13 09:54:07,994 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 545 flow [2024-10-13 09:54:07,994 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-13 09:54:07,994 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, -33 predicate places. [2024-10-13 09:54:07,995 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 545 flow [2024-10-13 09:54:07,995 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-13 09:54:07,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:07,995 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-13 09:54:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:54:07,995 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-13 09:54:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -617759989, now seen corresponding path program 1 times [2024-10-13 09:54:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778494748] [2024-10-13 09:54:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:08,021 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-13 09:54:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778494748] [2024-10-13 09:54:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778494748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:08,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:08,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504592439] [2024-10-13 09:54:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:08,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 204 [2024-10-13 09:54:08,051 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-13 09:54:08,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:08,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 204 [2024-10-13 09:54:08,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:08,216 INFO L124 PetriNetUnfolderBase]: 292/1374 cut-off events. [2024-10-13 09:54:08,217 INFO L125 PetriNetUnfolderBase]: For 1085/1120 co-relation queries the response was YES. [2024-10-13 09:54:08,223 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-13 09:54:08,228 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 49 selfloop transitions, 12 changer transitions 0/184 dead transitions. [2024-10-13 09:54:08,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 734 flow [2024-10-13 09:54:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-10-13 09:54:08,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2024-10-13 09:54:08,230 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 545 flow. Second operand 3 states and 496 transitions. [2024-10-13 09:54:08,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 734 flow [2024-10-13 09:54:08,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 184 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:54:08,234 INFO L231 Difference]: Finished difference. Result has 157 places, 177 transitions, 631 flow [2024-10-13 09:54:08,235 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-13 09:54:08,235 INFO L277 CegarLoopForPetriNet]: 188 programPoint places, -31 predicate places. [2024-10-13 09:54:08,236 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 177 transitions, 631 flow [2024-10-13 09:54:08,236 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-13 09:54:08,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:08,236 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-13 09:54:08,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:54:08,237 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-13 09:54:08,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:08,237 INFO L85 PathProgramCache]: Analyzing trace with hash -785800553, now seen corresponding path program 1 times [2024-10-13 09:54:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:08,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087077873] [2024-10-13 09:54:08,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:08,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:54:08,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:54:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:54:08,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:54:08,281 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:54:08,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-13 09:54:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-13 09:54:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-13 09:54:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-13 09:54:08,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-13 09:54:08,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-13 09:54:08,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-13 09:54:08,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-13 09:54:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:54:08,283 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:54:08,284 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:54:08,284 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 09:54:08,305 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:54:08,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 253 transitions, 533 flow [2024-10-13 09:54:08,350 INFO L124 PetriNetUnfolderBase]: 55/531 cut-off events. [2024-10-13 09:54:08,350 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-13 09:54:08,355 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-13 09:54:08,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 253 transitions, 533 flow [2024-10-13 09:54:08,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 253 transitions, 533 flow [2024-10-13 09:54:08,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:54:08,362 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;@7a42f8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:54:08,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-13 09:54:08,367 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:54:08,367 INFO L124 PetriNetUnfolderBase]: 3/61 cut-off events. [2024-10-13 09:54:08,367 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:54:08,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:08,368 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-13 09:54:08,368 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-13 09:54:08,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1041899757, now seen corresponding path program 1 times [2024-10-13 09:54:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410738070] [2024-10-13 09:54:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:08,397 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-13 09:54:08,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410738070] [2024-10-13 09:54:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410738070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:54:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248614880] [2024-10-13 09:54:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:08,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:08,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:08,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 253 [2024-10-13 09:54:08,417 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-13 09:54:08,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 253 [2024-10-13 09:54:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:12,363 INFO L124 PetriNetUnfolderBase]: 8949/35357 cut-off events. [2024-10-13 09:54:12,363 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-10-13 09:54:12,487 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-13 09:54:12,763 INFO L140 encePairwiseOnDemand]: 226/253 looper letters, 39 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-10-13 09:54:12,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 234 transitions, 577 flow [2024-10-13 09:54:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:54:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:54:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-10-13 09:54:12,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8629776021080369 [2024-10-13 09:54:12,767 INFO L175 Difference]: Start difference. First operand has 232 places, 253 transitions, 533 flow. Second operand 3 states and 655 transitions. [2024-10-13 09:54:12,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 234 transitions, 577 flow [2024-10-13 09:54:12,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 234 transitions, 577 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:54:12,770 INFO L231 Difference]: Finished difference. Result has 233 places, 228 transitions, 493 flow [2024-10-13 09:54:12,771 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-13 09:54:12,771 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 1 predicate places. [2024-10-13 09:54:12,771 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 228 transitions, 493 flow [2024-10-13 09:54:12,772 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-13 09:54:12,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:12,772 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-13 09:54:12,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:54:12,772 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-13 09:54:12,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1549201355, now seen corresponding path program 1 times [2024-10-13 09:54:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:12,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391584947] [2024-10-13 09:54:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:12,978 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-13 09:54:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391584947] [2024-10-13 09:54:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391584947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:54:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940071629] [2024-10-13 09:54:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:54:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:54:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:54:13,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 253 [2024-10-13 09:54:13,058 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-13 09:54:13,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:13,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 253 [2024-10-13 09:54:13,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:54:18,695 INFO L124 PetriNetUnfolderBase]: 19556/50630 cut-off events. [2024-10-13 09:54:18,695 INFO L125 PetriNetUnfolderBase]: For 1427/1427 co-relation queries the response was YES. [2024-10-13 09:54:18,924 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-13 09:54:19,114 INFO L140 encePairwiseOnDemand]: 247/253 looper letters, 112 selfloop transitions, 6 changer transitions 0/299 dead transitions. [2024-10-13 09:54:19,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 299 transitions, 871 flow [2024-10-13 09:54:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:54:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:54:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2024-10-13 09:54:19,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2024-10-13 09:54:19,117 INFO L175 Difference]: Start difference. First operand has 233 places, 228 transitions, 493 flow. Second operand 6 states and 1210 transitions. [2024-10-13 09:54:19,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 299 transitions, 871 flow [2024-10-13 09:54:19,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 299 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:54:19,121 INFO L231 Difference]: Finished difference. Result has 236 places, 227 transitions, 501 flow [2024-10-13 09:54:19,121 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-13 09:54:19,122 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 4 predicate places. [2024-10-13 09:54:19,122 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 227 transitions, 501 flow [2024-10-13 09:54:19,123 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-13 09:54:19,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:54:19,124 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-13 09:54:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:54:19,124 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-13 09:54:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:54:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 552201615, now seen corresponding path program 1 times [2024-10-13 09:54:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:54:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579514865] [2024-10-13 09:54:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:54:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:54:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:54:19,148 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-13 09:54:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:54:19,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579514865] [2024-10-13 09:54:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579514865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:54:19,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:54:19,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:54:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748859573] [2024-10-13 09:54:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:54:19,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:54:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:54:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:54:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:54:19,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 253 [2024-10-13 09:54:19,185 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-13 09:54:19,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:54:19,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 253 [2024-10-13 09:54:19,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand