./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:55:01,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:01,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:55:01,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:01,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:01,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:01,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:01,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:01,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:01,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:01,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:55:01,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:55:01,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:55:01,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:01,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:01,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:01,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:01,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:01,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:01,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:01,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:01,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:01,795 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:55:01,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:01,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:55:01,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:01,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:01,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:01,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:01,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:55:01,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:01,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:01,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:01,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:01,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:01,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:55:01,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:01,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:01,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:55:01,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:55:01,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:01,801 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2024-11-09 06:55:02,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:02,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:02,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:02,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:02,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:02,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-09 06:55:03,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:55:03,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:55:03,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-09 06:55:03,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e8df590/b99dbcb9206a4b2e915383de44c9ef2b/FLAGe8d419fb6 [2024-11-09 06:55:03,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e8df590/b99dbcb9206a4b2e915383de44c9ef2b [2024-11-09 06:55:03,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:55:03,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:55:03,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:03,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:55:03,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:55:03,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:03" (1/1) ... [2024-11-09 06:55:03,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cc8433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:03, skipping insertion in model container [2024-11-09 06:55:03,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:03" (1/1) ... [2024-11-09 06:55:04,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:55:04,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:04,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:55:04,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:04,496 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:55:04,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04 WrapperNode [2024-11-09 06:55:04,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:04,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:04,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:55:04,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:55:04,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,555 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 146 [2024-11-09 06:55:04,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:04,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:55:04,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:55:04,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:55:04,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:55:04,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:55:04,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:55:04,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:55:04,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (1/1) ... [2024-11-09 06:55:04,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:04,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:55:04,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:55:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:55:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:55:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:55:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:55:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:55:04,707 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:55:04,707 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:55:04,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:55:04,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:55:04,708 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:55:04,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:55:04,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:55:04,710 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:55:04,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:55:04,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:55:05,222 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:55:05,223 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:55:05,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:55:05,261 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 06:55:05,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:05 BoogieIcfgContainer [2024-11-09 06:55:05,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:55:05,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:55:05,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:55:05,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:55:05,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:55:03" (1/3) ... [2024-11-09 06:55:05,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1065d39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:05, skipping insertion in model container [2024-11-09 06:55:05,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:04" (2/3) ... [2024-11-09 06:55:05,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1065d39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:05, skipping insertion in model container [2024-11-09 06:55:05,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:05" (3/3) ... [2024-11-09 06:55:05,274 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-11-09 06:55:05,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:55:05,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 06:55:05,292 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:55:05,382 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:55:05,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 197 transitions, 401 flow [2024-11-09 06:55:05,612 INFO L124 PetriNetUnfolderBase]: 19/256 cut-off events. [2024-11-09 06:55:05,613 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:55:05,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 19/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 620 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2024-11-09 06:55:05,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 197 transitions, 401 flow [2024-11-09 06:55:05,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 197 transitions, 401 flow [2024-11-09 06:55:05,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:05,654 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;@5462adc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:05,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-09 06:55:05,673 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:05,674 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-09 06:55:05,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:05,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:05,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:05,675 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-11-09 06:55:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 72201746, now seen corresponding path program 1 times [2024-11-09 06:55:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664680168] [2024-11-09 06:55:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:05,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664680168] [2024-11-09 06:55:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664680168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:06,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:06,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143266246] [2024-11-09 06:55:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:06,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:06,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:06,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:06,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2024-11-09 06:55:06,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 197 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:06,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:06,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2024-11-09 06:55:06,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:06,418 INFO L124 PetriNetUnfolderBase]: 48/581 cut-off events. [2024-11-09 06:55:06,418 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:55:06,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 581 events. 48/581 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2512 event pairs, 35 based on Foata normal form. 62/588 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2024-11-09 06:55:06,425 INFO L140 encePairwiseOnDemand]: 182/197 looper letters, 22 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2024-11-09 06:55:06,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 433 flow [2024-11-09 06:55:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2024-11-09 06:55:06,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9170896785109983 [2024-11-09 06:55:06,446 INFO L175 Difference]: Start difference. First operand has 187 places, 197 transitions, 401 flow. Second operand 3 states and 542 transitions. [2024-11-09 06:55:06,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 433 flow [2024-11-09 06:55:06,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 189 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:06,456 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 381 flow [2024-11-09 06:55:06,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2024-11-09 06:55:06,463 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-11-09 06:55:06,467 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 381 flow [2024-11-09 06:55:06,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:06,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:06,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:06,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:55:06,470 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-11-09 06:55:06,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash 890096676, now seen corresponding path program 1 times [2024-11-09 06:55:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:06,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534007485] [2024-11-09 06:55:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:07,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534007485] [2024-11-09 06:55:07,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534007485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:07,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:07,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791034921] [2024-11-09 06:55:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:07,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:07,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:07,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 197 [2024-11-09 06:55:07,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:07,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:07,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 197 [2024-11-09 06:55:07,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:07,633 INFO L124 PetriNetUnfolderBase]: 108/720 cut-off events. [2024-11-09 06:55:07,633 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-09 06:55:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 720 events. 108/720 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3829 event pairs, 66 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 856. Up to 181 conditions per place. [2024-11-09 06:55:07,640 INFO L140 encePairwiseOnDemand]: 191/197 looper letters, 48 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2024-11-09 06:55:07,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 533 flow [2024-11-09 06:55:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2024-11-09 06:55:07,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8274111675126904 [2024-11-09 06:55:07,645 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 381 flow. Second operand 6 states and 978 transitions. [2024-11-09 06:55:07,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 533 flow [2024-11-09 06:55:07,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 206 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:07,652 INFO L231 Difference]: Finished difference. Result has 190 places, 182 transitions, 385 flow [2024-11-09 06:55:07,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=182} [2024-11-09 06:55:07,655 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 3 predicate places. [2024-11-09 06:55:07,655 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 182 transitions, 385 flow [2024-11-09 06:55:07,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:07,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:07,656 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:07,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:55:07,657 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-11-09 06:55:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1147473663, now seen corresponding path program 1 times [2024-11-09 06:55:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135797346] [2024-11-09 06:55:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:07,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135797346] [2024-11-09 06:55:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135797346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:07,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:07,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737512936] [2024-11-09 06:55:07,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:07,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:07,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:07,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 197 [2024-11-09 06:55:07,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 182 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:07,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:07,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 197 [2024-11-09 06:55:07,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:07,947 INFO L124 PetriNetUnfolderBase]: 91/845 cut-off events. [2024-11-09 06:55:07,947 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:55:07,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 845 events. 91/845 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4683 event pairs, 30 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-11-09 06:55:07,953 INFO L140 encePairwiseOnDemand]: 188/197 looper letters, 30 selfloop transitions, 6 changer transitions 0/195 dead transitions. [2024-11-09 06:55:07,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 195 transitions, 486 flow [2024-11-09 06:55:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2024-11-09 06:55:07,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2024-11-09 06:55:07,957 INFO L175 Difference]: Start difference. First operand has 190 places, 182 transitions, 385 flow. Second operand 3 states and 522 transitions. [2024-11-09 06:55:07,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 195 transitions, 486 flow [2024-11-09 06:55:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 195 transitions, 476 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:07,961 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 413 flow [2024-11-09 06:55:07,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2024-11-09 06:55:07,963 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-11-09 06:55:07,963 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 413 flow [2024-11-09 06:55:07,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:07,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:07,965 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:07,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:55:07,965 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-11-09 06:55:07,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1755011909, now seen corresponding path program 1 times [2024-11-09 06:55:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497524465] [2024-11-09 06:55:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497524465] [2024-11-09 06:55:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497524465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128351727] [2024-11-09 06:55:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:08,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:08,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:08,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:08,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 197 [2024-11-09 06:55:08,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:08,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:08,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 197 [2024-11-09 06:55:08,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:08,204 INFO L124 PetriNetUnfolderBase]: 94/847 cut-off events. [2024-11-09 06:55:08,204 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-09 06:55:08,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 847 events. 94/847 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4785 event pairs, 60 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-11-09 06:55:08,210 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 27 selfloop transitions, 4 changer transitions 0/191 dead transitions. [2024-11-09 06:55:08,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 493 flow [2024-11-09 06:55:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2024-11-09 06:55:08,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8764805414551607 [2024-11-09 06:55:08,213 INFO L175 Difference]: Start difference. First operand has 187 places, 184 transitions, 413 flow. Second operand 3 states and 518 transitions. [2024-11-09 06:55:08,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 493 flow [2024-11-09 06:55:08,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:08,218 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 433 flow [2024-11-09 06:55:08,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2024-11-09 06:55:08,221 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 2 predicate places. [2024-11-09 06:55:08,221 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 433 flow [2024-11-09 06:55:08,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:08,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:08,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:08,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:55:08,223 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-11-09 06:55:08,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -524792943, now seen corresponding path program 1 times [2024-11-09 06:55:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930809618] [2024-11-09 06:55:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:08,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:08,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:08,318 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:08,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-09 06:55:08,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-09 06:55:08,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-09 06:55:08,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-09 06:55:08,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-09 06:55:08,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-09 06:55:08,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-09 06:55:08,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-09 06:55:08,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-09 06:55:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-09 06:55:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-09 06:55:08,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-09 06:55:08,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:55:08,324 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 06:55:08,328 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:08,328 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:55:08,361 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:55:08,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 246 transitions, 508 flow [2024-11-09 06:55:08,439 INFO L124 PetriNetUnfolderBase]: 34/392 cut-off events. [2024-11-09 06:55:08,439 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:55:08,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 392 events. 34/392 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1173 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2024-11-09 06:55:08,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 246 transitions, 508 flow [2024-11-09 06:55:08,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 246 transitions, 508 flow [2024-11-09 06:55:08,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:08,451 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;@5462adc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:08,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 06:55:08,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:08,462 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-09 06:55:08,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:08,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:08,463 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:08,463 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-11-09 06:55:08,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1012236846, now seen corresponding path program 1 times [2024-11-09 06:55:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629594949] [2024-11-09 06:55:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:08,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:08,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629594949] [2024-11-09 06:55:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629594949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:08,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825323150] [2024-11-09 06:55:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:08,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:08,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 246 [2024-11-09 06:55:08,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 246 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:08,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:08,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 246 [2024-11-09 06:55:08,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:09,189 INFO L124 PetriNetUnfolderBase]: 788/4355 cut-off events. [2024-11-09 06:55:09,189 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-09 06:55:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 4355 events. 788/4355 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41161 event pairs, 348 based on Foata normal form. 749/4718 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-11-09 06:55:09,219 INFO L140 encePairwiseOnDemand]: 225/246 looper letters, 31 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-11-09 06:55:09,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 233 transitions, 548 flow [2024-11-09 06:55:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-11-09 06:55:09,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8970189701897019 [2024-11-09 06:55:09,221 INFO L175 Difference]: Start difference. First operand has 231 places, 246 transitions, 508 flow. Second operand 3 states and 662 transitions. [2024-11-09 06:55:09,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 233 transitions, 548 flow [2024-11-09 06:55:09,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 233 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:09,226 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 480 flow [2024-11-09 06:55:09,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2024-11-09 06:55:09,228 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 1 predicate places. [2024-11-09 06:55:09,229 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 480 flow [2024-11-09 06:55:09,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:09,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:09,230 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:09,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:55:09,231 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-11-09 06:55:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1873296732, now seen corresponding path program 1 times [2024-11-09 06:55:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265607505] [2024-11-09 06:55:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:09,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:09,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265607505] [2024-11-09 06:55:09,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265607505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:09,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:09,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:09,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643935074] [2024-11-09 06:55:09,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:09,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 246 [2024-11-09 06:55:09,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:09,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:09,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 246 [2024-11-09 06:55:09,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:10,834 INFO L124 PetriNetUnfolderBase]: 1718/5999 cut-off events. [2024-11-09 06:55:10,835 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-09 06:55:10,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9011 conditions, 5999 events. 1718/5999 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 57109 event pairs, 168 based on Foata normal form. 0/5548 useless extension candidates. Maximal degree in co-relation 4233. Up to 2015 conditions per place. [2024-11-09 06:55:10,914 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 80 selfloop transitions, 6 changer transitions 0/274 dead transitions. [2024-11-09 06:55:10,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 274 transitions, 746 flow [2024-11-09 06:55:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1220 transitions. [2024-11-09 06:55:10,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8265582655826558 [2024-11-09 06:55:10,919 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 480 flow. Second operand 6 states and 1220 transitions. [2024-11-09 06:55:10,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 274 transitions, 746 flow [2024-11-09 06:55:10,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 274 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:55:10,928 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 488 flow [2024-11-09 06:55:10,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2024-11-09 06:55:10,930 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-09 06:55:10,931 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 488 flow [2024-11-09 06:55:10,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:10,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:10,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:10,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:55:10,933 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-11-09 06:55:10,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1314901924, now seen corresponding path program 1 times [2024-11-09 06:55:10,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:10,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721889004] [2024-11-09 06:55:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721889004] [2024-11-09 06:55:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721889004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:10,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669919663] [2024-11-09 06:55:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:11,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 246 [2024-11-09 06:55:11,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:11,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:11,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 246 [2024-11-09 06:55:11,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:13,236 INFO L124 PetriNetUnfolderBase]: 3893/14653 cut-off events. [2024-11-09 06:55:13,237 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-09 06:55:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21204 conditions, 14653 events. 3893/14653 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 164301 event pairs, 1530 based on Foata normal form. 0/13110 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2024-11-09 06:55:13,330 INFO L140 encePairwiseOnDemand]: 227/246 looper letters, 58 selfloop transitions, 14 changer transitions 0/259 dead transitions. [2024-11-09 06:55:13,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 259 transitions, 709 flow [2024-11-09 06:55:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-11-09 06:55:13,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8685636856368564 [2024-11-09 06:55:13,333 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 488 flow. Second operand 3 states and 641 transitions. [2024-11-09 06:55:13,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 259 transitions, 709 flow [2024-11-09 06:55:13,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 259 transitions, 697 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:13,339 INFO L231 Difference]: Finished difference. Result has 234 places, 240 transitions, 598 flow [2024-11-09 06:55:13,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=234, PETRI_TRANSITIONS=240} [2024-11-09 06:55:13,340 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 3 predicate places. [2024-11-09 06:55:13,340 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 240 transitions, 598 flow [2024-11-09 06:55:13,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:13,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:13,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:13,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:55:13,342 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-11-09 06:55:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1424383286, now seen corresponding path program 1 times [2024-11-09 06:55:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235210696] [2024-11-09 06:55:13,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235210696] [2024-11-09 06:55:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235210696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:13,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:13,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:13,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564283778] [2024-11-09 06:55:13,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:13,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:13,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:13,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:13,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-09 06:55:13,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 240 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:13,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:13,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-09 06:55:13,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:15,684 INFO L124 PetriNetUnfolderBase]: 4020/16506 cut-off events. [2024-11-09 06:55:15,685 INFO L125 PetriNetUnfolderBase]: For 4310/4479 co-relation queries the response was YES. [2024-11-09 06:55:15,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 16506 events. 4020/16506 cut-off events. For 4310/4479 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 194152 event pairs, 2411 based on Foata normal form. 46/15009 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2024-11-09 06:55:15,798 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 52 selfloop transitions, 14 changer transitions 0/264 dead transitions. [2024-11-09 06:55:15,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 264 transitions, 816 flow [2024-11-09 06:55:15,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2024-11-09 06:55:15,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8604336043360433 [2024-11-09 06:55:15,802 INFO L175 Difference]: Start difference. First operand has 234 places, 240 transitions, 598 flow. Second operand 3 states and 635 transitions. [2024-11-09 06:55:15,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 264 transitions, 816 flow [2024-11-09 06:55:15,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 264 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:15,821 INFO L231 Difference]: Finished difference. Result has 236 places, 252 transitions, 696 flow [2024-11-09 06:55:15,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=236, PETRI_TRANSITIONS=252} [2024-11-09 06:55:15,822 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-09 06:55:15,823 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 252 transitions, 696 flow [2024-11-09 06:55:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:15,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:15,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:55:15,824 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-11-09 06:55:15,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:15,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1886521457, now seen corresponding path program 1 times [2024-11-09 06:55:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:15,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221243165] [2024-11-09 06:55:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221243165] [2024-11-09 06:55:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221243165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391631507] [2024-11-09 06:55:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:15,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:15,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:15,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:55:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:16,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:55:16,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:16,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:55:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:16,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391631507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:55:16,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:55:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:55:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163678899] [2024-11-09 06:55:16,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:55:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:55:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:55:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:55:16,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 246 [2024-11-09 06:55:16,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 252 transitions, 696 flow. Second operand has 10 states, 10 states have (on average 200.5) internal successors, (2005), 10 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:16,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:16,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 246 [2024-11-09 06:55:16,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:17,226 INFO L124 PetriNetUnfolderBase]: 947/4684 cut-off events. [2024-11-09 06:55:17,227 INFO L125 PetriNetUnfolderBase]: For 902/987 co-relation queries the response was YES. [2024-11-09 06:55:17,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7640 conditions, 4684 events. 947/4684 cut-off events. For 902/987 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 45212 event pairs, 140 based on Foata normal form. 106/4428 useless extension candidates. Maximal degree in co-relation 3404. Up to 577 conditions per place. [2024-11-09 06:55:17,272 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 72 selfloop transitions, 7 changer transitions 0/259 dead transitions. [2024-11-09 06:55:17,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 259 transitions, 822 flow [2024-11-09 06:55:17,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:55:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 06:55:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1863 transitions. [2024-11-09 06:55:17,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8414634146341463 [2024-11-09 06:55:17,278 INFO L175 Difference]: Start difference. First operand has 236 places, 252 transitions, 696 flow. Second operand 9 states and 1863 transitions. [2024-11-09 06:55:17,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 259 transitions, 822 flow [2024-11-09 06:55:17,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 259 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:17,289 INFO L231 Difference]: Finished difference. Result has 199 places, 203 transitions, 546 flow [2024-11-09 06:55:17,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=546, PETRI_PLACES=199, PETRI_TRANSITIONS=203} [2024-11-09 06:55:17,291 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, -32 predicate places. [2024-11-09 06:55:17,291 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 203 transitions, 546 flow [2024-11-09 06:55:17,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 200.5) internal successors, (2005), 10 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:17,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:17,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:17,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:55:17,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 06:55:17,496 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-11-09 06:55:17,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1179756648, now seen corresponding path program 1 times [2024-11-09 06:55:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769864124] [2024-11-09 06:55:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 06:55:17,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:17,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769864124] [2024-11-09 06:55:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769864124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800113705] [2024-11-09 06:55:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:17,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:17,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-09 06:55:17,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 203 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:17,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:17,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-09 06:55:17,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:17,835 INFO L124 PetriNetUnfolderBase]: 260/1344 cut-off events. [2024-11-09 06:55:17,835 INFO L125 PetriNetUnfolderBase]: For 459/480 co-relation queries the response was YES. [2024-11-09 06:55:17,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 1344 events. 260/1344 cut-off events. For 459/480 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8697 event pairs, 132 based on Foata normal form. 7/1259 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-11-09 06:55:17,849 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 42 selfloop transitions, 12 changer transitions 0/217 dead transitions. [2024-11-09 06:55:17,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 217 transitions, 698 flow [2024-11-09 06:55:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2024-11-09 06:55:17,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8414634146341463 [2024-11-09 06:55:17,851 INFO L175 Difference]: Start difference. First operand has 199 places, 203 transitions, 546 flow. Second operand 3 states and 621 transitions. [2024-11-09 06:55:17,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 217 transitions, 698 flow [2024-11-09 06:55:17,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 217 transitions, 683 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:17,857 INFO L231 Difference]: Finished difference. Result has 198 places, 211 transitions, 629 flow [2024-11-09 06:55:17,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=198, PETRI_TRANSITIONS=211} [2024-11-09 06:55:17,858 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, -33 predicate places. [2024-11-09 06:55:17,858 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 211 transitions, 629 flow [2024-11-09 06:55:17,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:17,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:17,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:55:17,859 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-11-09 06:55:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1561101596, now seen corresponding path program 1 times [2024-11-09 06:55:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320146854] [2024-11-09 06:55:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:17,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:17,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320146854] [2024-11-09 06:55:17,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320146854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:17,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:17,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822199000] [2024-11-09 06:55:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:17,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:17,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:17,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-09 06:55:17,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:17,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:17,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-09 06:55:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:18,126 INFO L124 PetriNetUnfolderBase]: 291/1416 cut-off events. [2024-11-09 06:55:18,127 INFO L125 PetriNetUnfolderBase]: For 1122/1157 co-relation queries the response was YES. [2024-11-09 06:55:18,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1416 events. 291/1416 cut-off events. For 1122/1157 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9298 event pairs, 134 based on Foata normal form. 9/1349 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-11-09 06:55:18,142 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 49 selfloop transitions, 12 changer transitions 0/226 dead transitions. [2024-11-09 06:55:18,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 226 transitions, 818 flow [2024-11-09 06:55:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-11-09 06:55:18,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8428184281842819 [2024-11-09 06:55:18,145 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 629 flow. Second operand 3 states and 622 transitions. [2024-11-09 06:55:18,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 226 transitions, 818 flow [2024-11-09 06:55:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 226 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:18,152 INFO L231 Difference]: Finished difference. Result has 200 places, 219 transitions, 715 flow [2024-11-09 06:55:18,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=200, PETRI_TRANSITIONS=219} [2024-11-09 06:55:18,153 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, -31 predicate places. [2024-11-09 06:55:18,153 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 219 transitions, 715 flow [2024-11-09 06:55:18,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:18,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:18,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:55:18,155 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-11-09 06:55:18,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2095314478, now seen corresponding path program 1 times [2024-11-09 06:55:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550299811] [2024-11-09 06:55:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:18,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:18,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:18,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:18,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-09 06:55:18,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-09 06:55:18,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-09 06:55:18,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-09 06:55:18,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-09 06:55:18,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-09 06:55:18,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-09 06:55:18,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-09 06:55:18,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-09 06:55:18,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-09 06:55:18,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:55:18,243 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:18,244 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:18,244 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 06:55:18,274 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:55:18,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 295 transitions, 617 flow [2024-11-09 06:55:18,364 INFO L124 PetriNetUnfolderBase]: 54/573 cut-off events. [2024-11-09 06:55:18,364 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 06:55:18,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 573 events. 54/573 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1969 event pairs, 1 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 400. Up to 16 conditions per place. [2024-11-09 06:55:18,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 295 transitions, 617 flow [2024-11-09 06:55:18,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 295 transitions, 617 flow [2024-11-09 06:55:18,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:18,380 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;@5462adc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:18,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 06:55:18,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:18,389 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-09 06:55:18,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:18,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:18,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:18,390 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-11-09 06:55:18,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash 183986482, now seen corresponding path program 1 times [2024-11-09 06:55:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:18,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238135177] [2024-11-09 06:55:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238135177] [2024-11-09 06:55:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238135177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046379311] [2024-11-09 06:55:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:18,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:18,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 295 [2024-11-09 06:55:18,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 295 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:18,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:18,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 295 [2024-11-09 06:55:18,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:23,320 INFO L124 PetriNetUnfolderBase]: 8948/35399 cut-off events. [2024-11-09 06:55:23,321 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-11-09 06:55:23,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48637 conditions, 35399 events. 8948/35399 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 457588 event pairs, 8324 based on Foata normal form. 7648/39665 useless extension candidates. Maximal degree in co-relation 35526. Up to 12802 conditions per place. [2024-11-09 06:55:23,588 INFO L140 encePairwiseOnDemand]: 268/295 looper letters, 39 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-11-09 06:55:23,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 661 flow [2024-11-09 06:55:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-09 06:55:23,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8824858757062147 [2024-11-09 06:55:23,591 INFO L175 Difference]: Start difference. First operand has 275 places, 295 transitions, 617 flow. Second operand 3 states and 781 transitions. [2024-11-09 06:55:23,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 661 flow [2024-11-09 06:55:23,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:23,599 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 577 flow [2024-11-09 06:55:23,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2024-11-09 06:55:23,600 INFO L277 CegarLoopForPetriNet]: 275 programPoint places, 1 predicate places. [2024-11-09 06:55:23,601 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 577 flow [2024-11-09 06:55:23,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:23,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:23,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:23,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:55:23,602 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-11-09 06:55:23,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash 941062884, now seen corresponding path program 1 times [2024-11-09 06:55:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913469879] [2024-11-09 06:55:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913469879] [2024-11-09 06:55:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913469879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:23,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:23,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829968389] [2024-11-09 06:55:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:23,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:23,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:24,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 295 [2024-11-09 06:55:24,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:24,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:24,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 295 [2024-11-09 06:55:24,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:32,699 INFO L124 PetriNetUnfolderBase]: 19590/65817 cut-off events. [2024-11-09 06:55:32,700 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2024-11-09 06:55:32,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94742 conditions, 65817 events. 19590/65817 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 890564 event pairs, 7382 based on Foata normal form. 0/60163 useless extension candidates. Maximal degree in co-relation 81487. Up to 20118 conditions per place. [2024-11-09 06:55:33,203 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 112 selfloop transitions, 6 changer transitions 0/341 dead transitions. [2024-11-09 06:55:33,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 341 transitions, 955 flow [2024-11-09 06:55:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1462 transitions. [2024-11-09 06:55:33,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8259887005649718 [2024-11-09 06:55:33,207 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 577 flow. Second operand 6 states and 1462 transitions. [2024-11-09 06:55:33,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 341 transitions, 955 flow [2024-11-09 06:55:33,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 341 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:55:33,221 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 585 flow [2024-11-09 06:55:33,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2024-11-09 06:55:33,223 INFO L277 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2024-11-09 06:55:33,223 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 585 flow [2024-11-09 06:55:33,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:33,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:33,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:33,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:55:33,225 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-11-09 06:55:33,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash -981041862, now seen corresponding path program 1 times [2024-11-09 06:55:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583483172] [2024-11-09 06:55:33,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:33,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583483172] [2024-11-09 06:55:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583483172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951418384] [2024-11-09 06:55:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:33,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:33,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 295 [2024-11-09 06:55:33,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:33,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:33,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 295 [2024-11-09 06:55:33,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand