./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.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 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:59:58,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:59:58,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:59:58,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:59:58,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:59:58,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:59:58,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:59:58,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:59:58,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:59:58,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:59:58,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:59:58,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:59:58,608 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:59:58,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:59:58,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:59:58,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:59:58,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:59:58,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:59:58,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:59:58,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:59:58,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:59:58,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:59:58,612 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:59:58,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:59:58,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:59:58,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:59:58,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:59:58,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:59:58,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:59:58,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:59:58,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:59:58,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:59:58,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:59:58,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:59:58,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:59:58,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:59:58,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:59:58,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:59:58,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:59:58,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:59:58,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:59:58,616 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 -> 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 [2024-11-20 13:59:58,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:59:58,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:59:58,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:59:58,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:59:58,906 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:59:58,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-11-20 14:00:00,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:00:00,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:00:00,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-11-20 14:00:00,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ba49dd2/f839dd81d1a24cc1aa1e4152b552072f/FLAG8e0bde840 [2024-11-20 14:00:00,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ba49dd2/f839dd81d1a24cc1aa1e4152b552072f [2024-11-20 14:00:00,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:00:00,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:00:00,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:00:00,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:00:00,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:00:00,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:00:00" (1/1) ... [2024-11-20 14:00:00,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f96a446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:00, skipping insertion in model container [2024-11-20 14:00:00,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:00:00" (1/1) ... [2024-11-20 14:00:00,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:00:01,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:00:01,364 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:00:01,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:00:01,493 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:00:01,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01 WrapperNode [2024-11-20 14:00:01,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:00:01,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:00:01,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:00:01,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:00:01,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,547 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-11-20 14:00:01,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:00:01,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:00:01,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:00:01,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:00:01,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:00:01,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:00:01,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:00:01,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:00:01,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (1/1) ... [2024-11-20 14:00:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:00:01,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:01,620 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-20 14:00:01,623 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-20 14:00:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 14:00:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-20 14:00:01,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-20 14:00:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:00:01,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:00:01,667 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 14:00:01,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:00:01,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:00:02,022 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 14:00:02,022 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:00:02,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:00:02,049 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 14:00:02,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:00:02 BoogieIcfgContainer [2024-11-20 14:00:02,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:00:02,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:00:02,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:00:02,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:00:02,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:00:00" (1/3) ... [2024-11-20 14:00:02,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6382abe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:00:02, skipping insertion in model container [2024-11-20 14:00:02,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:00:01" (2/3) ... [2024-11-20 14:00:02,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6382abe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:00:02, skipping insertion in model container [2024-11-20 14:00:02,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:00:02" (3/3) ... [2024-11-20 14:00:02,059 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i [2024-11-20 14:00:02,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:00:02,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-20 14:00:02,077 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 14:00:02,142 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-20 14:00:02,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 89 transitions, 185 flow [2024-11-20 14:00:02,223 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2024-11-20 14:00:02,223 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 14:00:02,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 123 events. 6/123 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-11-20 14:00:02,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 89 transitions, 185 flow [2024-11-20 14:00:02,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 89 transitions, 185 flow [2024-11-20 14:00:02,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:02,257 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;@632d6580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:02,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 14:00:02,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:02,280 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-20 14:00:02,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:02,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:02,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:02,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1930866065, now seen corresponding path program 1 times [2024-11-20 14:00:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146948304] [2024-11-20 14:00:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:02,561 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-20 14:00:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146948304] [2024-11-20 14:00:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146948304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175212140] [2024-11-20 14:00:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:02,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:02,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2024-11-20 14:00:02,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-20 14:00:02,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:02,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2024-11-20 14:00:02,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:02,742 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2024-11-20 14:00:02,743 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2024-11-20 14:00:02,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 161 events. 8/161 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 410 event pairs, 1 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-11-20 14:00:02,745 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 8 selfloop transitions, 3 changer transitions 2/90 dead transitions. [2024-11-20 14:00:02,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 211 flow [2024-11-20 14:00:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-20 14:00:02,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9363295880149812 [2024-11-20 14:00:02,762 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 185 flow. Second operand 3 states and 250 transitions. [2024-11-20 14:00:02,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 211 flow [2024-11-20 14:00:02,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:02,774 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 199 flow [2024-11-20 14:00:02,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-11-20 14:00:02,780 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2024-11-20 14:00:02,782 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 199 flow [2024-11-20 14:00:02,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-20 14:00:02,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:02,783 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] [2024-11-20 14:00:02,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:00:02,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:02,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:02,785 INFO L85 PathProgramCache]: Analyzing trace with hash 894653936, now seen corresponding path program 1 times [2024-11-20 14:00:02,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:02,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692603734] [2024-11-20 14:00:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:03,433 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-20 14:00:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692603734] [2024-11-20 14:00:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692603734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65512293] [2024-11-20 14:00:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:03,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:03,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:03,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:03,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2024-11-20 14:00:03,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-20 14:00:03,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:03,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2024-11-20 14:00:03,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:03,695 INFO L124 PetriNetUnfolderBase]: 31/242 cut-off events. [2024-11-20 14:00:03,695 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 14:00:03,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 242 events. 31/242 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1057 event pairs, 5 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 276. Up to 62 conditions per place. [2024-11-20 14:00:03,698 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 24 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2024-11-20 14:00:03,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 271 flow [2024-11-20 14:00:03,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2024-11-20 14:00:03,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7752808988764045 [2024-11-20 14:00:03,702 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 199 flow. Second operand 6 states and 414 transitions. [2024-11-20 14:00:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 271 flow [2024-11-20 14:00:03,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:03,705 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 201 flow [2024-11-20 14:00:03,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-11-20 14:00:03,706 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2024-11-20 14:00:03,707 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 201 flow [2024-11-20 14:00:03,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-20 14:00:03,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:03,708 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] [2024-11-20 14:00:03,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:00:03,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:03,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2009182366, now seen corresponding path program 1 times [2024-11-20 14:00:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:03,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51600289] [2024-11-20 14:00:03,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:03,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:03,819 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-20 14:00:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51600289] [2024-11-20 14:00:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51600289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515114129] [2024-11-20 14:00:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:03,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:00:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:00:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:00:03,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2024-11-20 14:00:03,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:03,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:03,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2024-11-20 14:00:03,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:03,956 INFO L124 PetriNetUnfolderBase]: 17/230 cut-off events. [2024-11-20 14:00:03,957 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 14:00:03,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 230 events. 17/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 814 event pairs, 1 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-11-20 14:00:03,959 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 15 selfloop transitions, 2 changer transitions 5/93 dead transitions. [2024-11-20 14:00:03,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 259 flow [2024-11-20 14:00:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 449 transitions. [2024-11-20 14:00:03,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8408239700374532 [2024-11-20 14:00:03,966 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 201 flow. Second operand 6 states and 449 transitions. [2024-11-20 14:00:03,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 259 flow [2024-11-20 14:00:03,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 249 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:03,971 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 209 flow [2024-11-20 14:00:03,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2024-11-20 14:00:03,973 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2024-11-20 14:00:03,973 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 209 flow [2024-11-20 14:00:03,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:03,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:03,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:03,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:00:03,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:03,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash -667923900, now seen corresponding path program 1 times [2024-11-20 14:00:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68949897] [2024-11-20 14:00:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:04,016 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-20 14:00:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:04,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68949897] [2024-11-20 14:00:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68949897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536366293] [2024-11-20 14:00:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:04,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:04,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2024-11-20 14:00:04,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-20 14:00:04,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:04,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2024-11-20 14:00:04,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:04,062 INFO L124 PetriNetUnfolderBase]: 5/167 cut-off events. [2024-11-20 14:00:04,062 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-11-20 14:00:04,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 167 events. 5/167 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 187. Up to 25 conditions per place. [2024-11-20 14:00:04,065 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2024-11-20 14:00:04,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 245 flow [2024-11-20 14:00:04,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2024-11-20 14:00:04,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9063670411985019 [2024-11-20 14:00:04,068 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 209 flow. Second operand 3 states and 242 transitions. [2024-11-20 14:00:04,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 245 flow [2024-11-20 14:00:04,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 231 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:04,072 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 217 flow [2024-11-20 14:00:04,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-11-20 14:00:04,073 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2024-11-20 14:00:04,074 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 217 flow [2024-11-20 14:00:04,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-20 14:00:04,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:04,074 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] [2024-11-20 14:00:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:00:04,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1285259620, now seen corresponding path program 1 times [2024-11-20 14:00:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137362250] [2024-11-20 14:00:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137362250] [2024-11-20 14:00:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137362250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:04,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:04,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:04,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352141046] [2024-11-20 14:00:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:04,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2024-11-20 14:00:04,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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-20 14:00:04,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:04,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2024-11-20 14:00:04,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:04,604 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-11-20 14:00:04,604 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2024-11-20 14:00:04,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 280 events. 25/280 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1222 event pairs, 15 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2024-11-20 14:00:04,608 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 12 selfloop transitions, 0 changer transitions 18/93 dead transitions. [2024-11-20 14:00:04,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 285 flow [2024-11-20 14:00:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2024-11-20 14:00:04,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7940074906367042 [2024-11-20 14:00:04,611 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 217 flow. Second operand 6 states and 424 transitions. [2024-11-20 14:00:04,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 285 flow [2024-11-20 14:00:04,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:04,616 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 184 flow [2024-11-20 14:00:04,617 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2024-11-20 14:00:04,618 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 7 predicate places. [2024-11-20 14:00:04,619 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 184 flow [2024-11-20 14:00:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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-20 14:00:04,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:04,620 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] [2024-11-20 14:00:04,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:00:04,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1012954957, now seen corresponding path program 1 times [2024-11-20 14:00:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242120960] [2024-11-20 14:00:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:04,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:04,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:04,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:04,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-20 14:00:04,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-20 14:00:04,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-20 14:00:04,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-20 14:00:04,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-20 14:00:04,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-20 14:00:04,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:00:04,704 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 14:00:04,707 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:00:04,707 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-20 14:00:04,724 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 14:00:04,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 107 transitions, 230 flow [2024-11-20 14:00:04,744 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-11-20 14:00:04,745 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 14:00:04,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2024-11-20 14:00:04,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 107 transitions, 230 flow [2024-11-20 14:00:04,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 230 flow [2024-11-20 14:00:04,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:04,748 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;@632d6580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:04,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 14:00:04,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:04,752 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-20 14:00:04,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:04,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:04,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:04,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:04,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1073777201, now seen corresponding path program 1 times [2024-11-20 14:00:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:04,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373678863] [2024-11-20 14:00:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:04,774 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-20 14:00:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373678863] [2024-11-20 14:00:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373678863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590957023] [2024-11-20 14:00:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:04,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2024-11-20 14:00:04,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-20 14:00:04,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:04,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2024-11-20 14:00:04,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:04,882 INFO L124 PetriNetUnfolderBase]: 119/719 cut-off events. [2024-11-20 14:00:04,882 INFO L125 PetriNetUnfolderBase]: For 44/68 co-relation queries the response was YES. [2024-11-20 14:00:04,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 719 events. 119/719 cut-off events. For 44/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4242 event pairs, 50 based on Foata normal form. 36/670 useless extension candidates. Maximal degree in co-relation 741. Up to 139 conditions per place. [2024-11-20 14:00:04,887 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 16 selfloop transitions, 4 changer transitions 1/111 dead transitions. [2024-11-20 14:00:04,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 111 transitions, 278 flow [2024-11-20 14:00:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-20 14:00:04,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252336448598131 [2024-11-20 14:00:04,889 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 297 transitions. [2024-11-20 14:00:04,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 111 transitions, 278 flow [2024-11-20 14:00:04,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:04,891 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 252 flow [2024-11-20 14:00:04,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2024-11-20 14:00:04,892 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2024-11-20 14:00:04,892 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 252 flow [2024-11-20 14:00:04,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-20 14:00:04,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:04,893 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] [2024-11-20 14:00:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:00:04,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash -76665168, now seen corresponding path program 1 times [2024-11-20 14:00:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:04,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658192052] [2024-11-20 14:00:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:05,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:05,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658192052] [2024-11-20 14:00:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658192052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:05,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970771645] [2024-11-20 14:00:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:05,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2024-11-20 14:00:05,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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-20 14:00:05,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:05,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2024-11-20 14:00:05,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:05,470 INFO L124 PetriNetUnfolderBase]: 299/1306 cut-off events. [2024-11-20 14:00:05,471 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-20 14:00:05,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 1306 events. 299/1306 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9787 event pairs, 58 based on Foata normal form. 0/1174 useless extension candidates. Maximal degree in co-relation 1408. Up to 372 conditions per place. [2024-11-20 14:00:05,480 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 36 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2024-11-20 14:00:05,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 121 transitions, 364 flow [2024-11-20 14:00:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-11-20 14:00:05,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.794392523364486 [2024-11-20 14:00:05,482 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 252 flow. Second operand 6 states and 510 transitions. [2024-11-20 14:00:05,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 121 transitions, 364 flow [2024-11-20 14:00:05,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 121 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:05,487 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 252 flow [2024-11-20 14:00:05,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-11-20 14:00:05,488 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2024-11-20 14:00:05,488 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 252 flow [2024-11-20 14:00:05,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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-20 14:00:05,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:05,489 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] [2024-11-20 14:00:05,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:00:05,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:05,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:05,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1314465826, now seen corresponding path program 1 times [2024-11-20 14:00:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062127804] [2024-11-20 14:00:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:05,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:05,568 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-20 14:00:05,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:05,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062127804] [2024-11-20 14:00:05,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062127804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:05,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:05,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826002956] [2024-11-20 14:00:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:05,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:00:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:00:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:00:05,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2024-11-20 14:00:05,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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-20 14:00:05,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:05,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2024-11-20 14:00:05,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:05,792 INFO L124 PetriNetUnfolderBase]: 179/1195 cut-off events. [2024-11-20 14:00:05,793 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-20 14:00:05,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1195 events. 179/1195 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8712 event pairs, 75 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 560. Up to 300 conditions per place. [2024-11-20 14:00:05,800 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 20 selfloop transitions, 2 changer transitions 5/113 dead transitions. [2024-11-20 14:00:05,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 322 flow [2024-11-20 14:00:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2024-11-20 14:00:05,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.838006230529595 [2024-11-20 14:00:05,805 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 252 flow. Second operand 6 states and 538 transitions. [2024-11-20 14:00:05,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 322 flow [2024-11-20 14:00:05,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:05,810 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 264 flow [2024-11-20 14:00:05,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-11-20 14:00:05,811 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-11-20 14:00:05,812 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 264 flow [2024-11-20 14:00:05,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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-20 14:00:05,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:05,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:05,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:00:05,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:05,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2079582252, now seen corresponding path program 1 times [2024-11-20 14:00:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298935742] [2024-11-20 14:00:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:05,860 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-20 14:00:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298935742] [2024-11-20 14:00:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298935742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713528798] [2024-11-20 14:00:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:05,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:05,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:05,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2024-11-20 14:00:05,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-20 14:00:05,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:05,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2024-11-20 14:00:05,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:06,012 INFO L124 PetriNetUnfolderBase]: 165/981 cut-off events. [2024-11-20 14:00:06,016 INFO L125 PetriNetUnfolderBase]: For 182/299 co-relation queries the response was YES. [2024-11-20 14:00:06,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 981 events. 165/981 cut-off events. For 182/299 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7175 event pairs, 88 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 1539. Up to 269 conditions per place. [2024-11-20 14:00:06,027 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2024-11-20 14:00:06,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 348 flow [2024-11-20 14:00:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-11-20 14:00:06,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065420560747663 [2024-11-20 14:00:06,031 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 264 flow. Second operand 3 states and 291 transitions. [2024-11-20 14:00:06,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 348 flow [2024-11-20 14:00:06,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 336 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 14:00:06,034 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 308 flow [2024-11-20 14:00:06,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2024-11-20 14:00:06,035 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-11-20 14:00:06,036 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 308 flow [2024-11-20 14:00:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-20 14:00:06,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:06,036 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] [2024-11-20 14:00:06,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:00:06,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:06,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1021294111, now seen corresponding path program 1 times [2024-11-20 14:00:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:06,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691420291] [2024-11-20 14:00:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691420291] [2024-11-20 14:00:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691420291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:06,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:06,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:06,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200786640] [2024-11-20 14:00:06,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:06,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:06,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:06,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:06,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2024-11-20 14:00:06,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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-20 14:00:06,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:06,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2024-11-20 14:00:06,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:06,637 INFO L124 PetriNetUnfolderBase]: 356/1815 cut-off events. [2024-11-20 14:00:06,637 INFO L125 PetriNetUnfolderBase]: For 306/352 co-relation queries the response was YES. [2024-11-20 14:00:06,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1815 events. 356/1815 cut-off events. For 306/352 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15341 event pairs, 177 based on Foata normal form. 3/1659 useless extension candidates. Maximal degree in co-relation 2422. Up to 360 conditions per place. [2024-11-20 14:00:06,649 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 34 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2024-11-20 14:00:06,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 416 flow [2024-11-20 14:00:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2024-11-20 14:00:06,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8099688473520249 [2024-11-20 14:00:06,652 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 308 flow. Second operand 6 states and 520 transitions. [2024-11-20 14:00:06,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 416 flow [2024-11-20 14:00:06,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 126 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:06,656 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 302 flow [2024-11-20 14:00:06,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-11-20 14:00:06,657 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2024-11-20 14:00:06,657 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 302 flow [2024-11-20 14:00:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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-20 14:00:06,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:06,658 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] [2024-11-20 14:00:06,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:00:06,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:06,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 179882135, now seen corresponding path program 1 times [2024-11-20 14:00:06,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655316492] [2024-11-20 14:00:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,738 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-20 14:00:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655316492] [2024-11-20 14:00:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655316492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541709940] [2024-11-20 14:00:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:06,742 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-20 14:00:06,746 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-20 14:00:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:00:06,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:06,927 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-20 14:00:06,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:06,983 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-20 14:00:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541709940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:06,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-20 14:00:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912324894] [2024-11-20 14:00:06,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:06,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:00:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:06,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:00:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:00:07,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2024-11-20 14:00:07,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 302 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 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-20 14:00:07,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:07,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2024-11-20 14:00:07,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:07,309 INFO L124 PetriNetUnfolderBase]: 161/977 cut-off events. [2024-11-20 14:00:07,309 INFO L125 PetriNetUnfolderBase]: For 131/153 co-relation queries the response was YES. [2024-11-20 14:00:07,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 977 events. 161/977 cut-off events. For 131/153 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6598 event pairs, 35 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 952. Up to 157 conditions per place. [2024-11-20 14:00:07,315 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 27 selfloop transitions, 9 changer transitions 9/132 dead transitions. [2024-11-20 14:00:07,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 132 transitions, 440 flow [2024-11-20 14:00:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:00:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 14:00:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2024-11-20 14:00:07,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8294392523364486 [2024-11-20 14:00:07,343 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 302 flow. Second operand 8 states and 710 transitions. [2024-11-20 14:00:07,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 132 transitions, 440 flow [2024-11-20 14:00:07,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 428 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:07,347 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 325 flow [2024-11-20 14:00:07,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2024-11-20 14:00:07,347 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 13 predicate places. [2024-11-20 14:00:07,348 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 325 flow [2024-11-20 14:00:07,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 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-20 14:00:07,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:07,348 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:07,360 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-20 14:00:07,552 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,SelfDestructingSolverStorable11 [2024-11-20 14:00:07,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:07,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1060604224, now seen corresponding path program 1 times [2024-11-20 14:00:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113230961] [2024-11-20 14:00:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:07,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:07,591 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-20 14:00:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113230961] [2024-11-20 14:00:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113230961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826885570] [2024-11-20 14:00:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:07,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:07,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2024-11-20 14:00:07,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-20 14:00:07,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:07,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2024-11-20 14:00:07,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:07,690 INFO L124 PetriNetUnfolderBase]: 56/601 cut-off events. [2024-11-20 14:00:07,691 INFO L125 PetriNetUnfolderBase]: For 229/290 co-relation queries the response was YES. [2024-11-20 14:00:07,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 601 events. 56/601 cut-off events. For 229/290 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3609 event pairs, 30 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 910. Up to 119 conditions per place. [2024-11-20 14:00:07,695 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 1/118 dead transitions. [2024-11-20 14:00:07,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 402 flow [2024-11-20 14:00:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2024-11-20 14:00:07,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9034267912772586 [2024-11-20 14:00:07,696 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 325 flow. Second operand 3 states and 290 transitions. [2024-11-20 14:00:07,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 402 flow [2024-11-20 14:00:07,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 14:00:07,700 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 369 flow [2024-11-20 14:00:07,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2024-11-20 14:00:07,701 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 14 predicate places. [2024-11-20 14:00:07,701 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 369 flow [2024-11-20 14:00:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-20 14:00:07,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:07,701 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-20 14:00:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:00:07,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash -881547959, now seen corresponding path program 1 times [2024-11-20 14:00:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297225580] [2024-11-20 14:00:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:07,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:07,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:07,745 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-20 14:00:07,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-20 14:00:07,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:00:07,747 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:07,747 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:00:07,747 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-20 14:00:07,768 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-20 14:00:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 125 transitions, 277 flow [2024-11-20 14:00:07,800 INFO L124 PetriNetUnfolderBase]: 21/336 cut-off events. [2024-11-20 14:00:07,800 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-20 14:00:07,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 336 events. 21/336 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 902 event pairs, 1 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 214. Up to 16 conditions per place. [2024-11-20 14:00:07,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 125 transitions, 277 flow [2024-11-20 14:00:07,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 125 transitions, 277 flow [2024-11-20 14:00:07,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:07,807 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;@632d6580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:07,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 14:00:07,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:07,812 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-20 14:00:07,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:07,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:07,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:07,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1758380177, now seen corresponding path program 1 times [2024-11-20 14:00:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581231994] [2024-11-20 14:00:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:07,841 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-20 14:00:07,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581231994] [2024-11-20 14:00:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581231994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:07,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:07,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:07,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636753751] [2024-11-20 14:00:07,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:07,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:07,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:07,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2024-11-20 14:00:07,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 125 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-20 14:00:07,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:07,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2024-11-20 14:00:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:08,284 INFO L124 PetriNetUnfolderBase]: 1071/3960 cut-off events. [2024-11-20 14:00:08,285 INFO L125 PetriNetUnfolderBase]: For 378/483 co-relation queries the response was YES. [2024-11-20 14:00:08,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 3960 events. 1071/3960 cut-off events. For 378/483 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35581 event pairs, 542 based on Foata normal form. 179/3698 useless extension candidates. Maximal degree in co-relation 4604. Up to 1110 conditions per place. [2024-11-20 14:00:08,317 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 23 selfloop transitions, 5 changer transitions 1/132 dead transitions. [2024-11-20 14:00:08,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 347 flow [2024-11-20 14:00:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2024-11-20 14:00:08,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173333333333333 [2024-11-20 14:00:08,319 INFO L175 Difference]: Start difference. First operand has 126 places, 125 transitions, 277 flow. Second operand 3 states and 344 transitions. [2024-11-20 14:00:08,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 347 flow [2024-11-20 14:00:08,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:08,322 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 307 flow [2024-11-20 14:00:08,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2024-11-20 14:00:08,324 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2024-11-20 14:00:08,324 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 307 flow [2024-11-20 14:00:08,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-20 14:00:08,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:08,324 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] [2024-11-20 14:00:08,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:00:08,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:08,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash -850124816, now seen corresponding path program 1 times [2024-11-20 14:00:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:08,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352908740] [2024-11-20 14:00:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:08,533 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-20 14:00:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352908740] [2024-11-20 14:00:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352908740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930585898] [2024-11-20 14:00:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:08,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:08,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 125 [2024-11-20 14:00:08,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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-20 14:00:08,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:08,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 125 [2024-11-20 14:00:08,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:09,505 INFO L124 PetriNetUnfolderBase]: 2135/6741 cut-off events. [2024-11-20 14:00:09,506 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-11-20 14:00:09,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 6741 events. 2135/6741 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 67071 event pairs, 440 based on Foata normal form. 0/5959 useless extension candidates. Maximal degree in co-relation 6909. Up to 2247 conditions per place. [2024-11-20 14:00:09,573 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 48 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2024-11-20 14:00:09,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 459 flow [2024-11-20 14:00:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2024-11-20 14:00:09,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.808 [2024-11-20 14:00:09,576 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 307 flow. Second operand 6 states and 606 transitions. [2024-11-20 14:00:09,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 459 flow [2024-11-20 14:00:09,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 148 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:09,584 INFO L231 Difference]: Finished difference. Result has 131 places, 124 transitions, 305 flow [2024-11-20 14:00:09,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=124} [2024-11-20 14:00:09,585 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2024-11-20 14:00:09,585 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 305 flow [2024-11-20 14:00:09,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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-20 14:00:09,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:09,586 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] [2024-11-20 14:00:09,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:00:09,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash 541006178, now seen corresponding path program 1 times [2024-11-20 14:00:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813421471] [2024-11-20 14:00:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:09,648 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-20 14:00:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813421471] [2024-11-20 14:00:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813421471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678449562] [2024-11-20 14:00:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:00:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:00:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:00:09,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2024-11-20 14:00:09,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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-20 14:00:09,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:09,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2024-11-20 14:00:09,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:10,442 INFO L124 PetriNetUnfolderBase]: 1392/6275 cut-off events. [2024-11-20 14:00:10,443 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2024-11-20 14:00:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8980 conditions, 6275 events. 1392/6275 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 63462 event pairs, 1074 based on Foata normal form. 1/5612 useless extension candidates. Maximal degree in co-relation 5639. Up to 1837 conditions per place. [2024-11-20 14:00:10,496 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 24 selfloop transitions, 2 changer transitions 5/132 dead transitions. [2024-11-20 14:00:10,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 383 flow [2024-11-20 14:00:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2024-11-20 14:00:10,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346666666666667 [2024-11-20 14:00:10,499 INFO L175 Difference]: Start difference. First operand has 131 places, 124 transitions, 305 flow. Second operand 6 states and 626 transitions. [2024-11-20 14:00:10,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 383 flow [2024-11-20 14:00:10,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 373 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:10,502 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 317 flow [2024-11-20 14:00:10,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2024-11-20 14:00:10,504 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2024-11-20 14:00:10,504 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 317 flow [2024-11-20 14:00:10,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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-20 14:00:10,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:10,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:00:10,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash 917682500, now seen corresponding path program 1 times [2024-11-20 14:00:10,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865002826] [2024-11-20 14:00:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:10,543 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-20 14:00:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:10,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865002826] [2024-11-20 14:00:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865002826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:10,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348362416] [2024-11-20 14:00:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:10,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:10,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:10,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-11-20 14:00:10,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-20 14:00:10,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:10,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-11-20 14:00:10,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:11,342 INFO L124 PetriNetUnfolderBase]: 1740/6509 cut-off events. [2024-11-20 14:00:11,343 INFO L125 PetriNetUnfolderBase]: For 1635/2354 co-relation queries the response was YES. [2024-11-20 14:00:11,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11100 conditions, 6509 events. 1740/6509 cut-off events. For 1635/2354 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 67622 event pairs, 967 based on Foata normal form. 10/5761 useless extension candidates. Maximal degree in co-relation 11041. Up to 2240 conditions per place. [2024-11-20 14:00:11,407 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 29 selfloop transitions, 9 changer transitions 0/140 dead transitions. [2024-11-20 14:00:11,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 451 flow [2024-11-20 14:00:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2024-11-20 14:00:11,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2024-11-20 14:00:11,409 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 317 flow. Second operand 3 states and 340 transitions. [2024-11-20 14:00:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 451 flow [2024-11-20 14:00:11,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 439 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 14:00:11,423 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 381 flow [2024-11-20 14:00:11,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2024-11-20 14:00:11,424 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places. [2024-11-20 14:00:11,424 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 381 flow [2024-11-20 14:00:11,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-20 14:00:11,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:11,425 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] [2024-11-20 14:00:11,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:00:11,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 161140844, now seen corresponding path program 1 times [2024-11-20 14:00:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:11,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397885870] [2024-11-20 14:00:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397885870] [2024-11-20 14:00:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397885870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716087688] [2024-11-20 14:00:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:11,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:11,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:11,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125 [2024-11-20 14:00:11,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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-20 14:00:11,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:11,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125 [2024-11-20 14:00:11,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:12,886 INFO L124 PetriNetUnfolderBase]: 2856/10331 cut-off events. [2024-11-20 14:00:12,886 INFO L125 PetriNetUnfolderBase]: For 1730/2294 co-relation queries the response was YES. [2024-11-20 14:00:12,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 10331 events. 2856/10331 cut-off events. For 1730/2294 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 114378 event pairs, 1400 based on Foata normal form. 17/9184 useless extension candidates. Maximal degree in co-relation 13963. Up to 2139 conditions per place. [2024-11-20 14:00:12,958 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 46 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2024-11-20 14:00:12,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 155 transitions, 529 flow [2024-11-20 14:00:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-11-20 14:00:12,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8213333333333334 [2024-11-20 14:00:12,961 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 381 flow. Second operand 6 states and 616 transitions. [2024-11-20 14:00:12,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 155 transitions, 529 flow [2024-11-20 14:00:12,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:12,971 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 371 flow [2024-11-20 14:00:12,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-11-20 14:00:12,972 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2024-11-20 14:00:12,972 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 371 flow [2024-11-20 14:00:12,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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-20 14:00:12,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:12,973 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] [2024-11-20 14:00:12,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:00:12,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:12,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash 694988840, now seen corresponding path program 1 times [2024-11-20 14:00:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829297361] [2024-11-20 14:00:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:13,040 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-20 14:00:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829297361] [2024-11-20 14:00:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829297361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872070246] [2024-11-20 14:00:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:13,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:13,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:00:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:13,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:00:13,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:13,174 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-20 14:00:13,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:13,223 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-20 14:00:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872070246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:13,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-20 14:00:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731493982] [2024-11-20 14:00:13,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:00:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:00:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:00:13,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2024-11-20 14:00:13,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 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-20 14:00:13,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:13,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2024-11-20 14:00:13,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:14,078 INFO L124 PetriNetUnfolderBase]: 1459/6147 cut-off events. [2024-11-20 14:00:14,079 INFO L125 PetriNetUnfolderBase]: For 935/1162 co-relation queries the response was YES. [2024-11-20 14:00:14,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10404 conditions, 6147 events. 1459/6147 cut-off events. For 935/1162 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 62125 event pairs, 454 based on Foata normal form. 1/5513 useless extension candidates. Maximal degree in co-relation 5059. Up to 1044 conditions per place. [2024-11-20 14:00:14,207 INFO L140 encePairwiseOnDemand]: 115/125 looper letters, 48 selfloop transitions, 10 changer transitions 0/163 dead transitions. [2024-11-20 14:00:14,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 163 transitions, 562 flow [2024-11-20 14:00:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:00:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 14:00:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2024-11-20 14:00:14,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.835 [2024-11-20 14:00:14,210 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 371 flow. Second operand 8 states and 835 transitions. [2024-11-20 14:00:14,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 163 transitions, 562 flow [2024-11-20 14:00:14,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 163 transitions, 550 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:14,217 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 405 flow [2024-11-20 14:00:14,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2024-11-20 14:00:14,218 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 13 predicate places. [2024-11-20 14:00:14,218 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 405 flow [2024-11-20 14:00:14,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 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-20 14:00:14,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:14,219 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:14,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:00:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-20 14:00:14,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:14,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2119836893, now seen corresponding path program 1 times [2024-11-20 14:00:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959892989] [2024-11-20 14:00:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:14,458 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-20 14:00:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959892989] [2024-11-20 14:00:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959892989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:14,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892572928] [2024-11-20 14:00:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:14,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:14,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-11-20 14:00:14,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-20 14:00:14,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:14,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-11-20 14:00:14,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:15,026 INFO L124 PetriNetUnfolderBase]: 1088/4747 cut-off events. [2024-11-20 14:00:15,027 INFO L125 PetriNetUnfolderBase]: For 2578/2820 co-relation queries the response was YES. [2024-11-20 14:00:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9139 conditions, 4747 events. 1088/4747 cut-off events. For 2578/2820 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 49421 event pairs, 589 based on Foata normal form. 7/4392 useless extension candidates. Maximal degree in co-relation 8357. Up to 1450 conditions per place. [2024-11-20 14:00:15,061 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 31 selfloop transitions, 13 changer transitions 0/150 dead transitions. [2024-11-20 14:00:15,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 150 transitions, 566 flow [2024-11-20 14:00:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-11-20 14:00:15,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.904 [2024-11-20 14:00:15,063 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 405 flow. Second operand 3 states and 339 transitions. [2024-11-20 14:00:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 150 transitions, 566 flow [2024-11-20 14:00:15,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 150 transitions, 560 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 14:00:15,070 INFO L231 Difference]: Finished difference. Result has 140 places, 143 transitions, 517 flow [2024-11-20 14:00:15,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=140, PETRI_TRANSITIONS=143} [2024-11-20 14:00:15,070 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2024-11-20 14:00:15,071 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 143 transitions, 517 flow [2024-11-20 14:00:15,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-20 14:00:15,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:15,071 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] [2024-11-20 14:00:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:00:15,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1392824919, now seen corresponding path program 1 times [2024-11-20 14:00:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703950628] [2024-11-20 14:00:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:15,166 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-20 14:00:15,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:15,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703950628] [2024-11-20 14:00:15,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703950628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:15,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:15,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:00:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394163733] [2024-11-20 14:00:15,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:15,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:15,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:15,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 125 [2024-11-20 14:00:15,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 143 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-20 14:00:15,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:15,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 125 [2024-11-20 14:00:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:15,362 INFO L124 PetriNetUnfolderBase]: 124/1629 cut-off events. [2024-11-20 14:00:15,362 INFO L125 PetriNetUnfolderBase]: For 736/839 co-relation queries the response was YES. [2024-11-20 14:00:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1629 events. 124/1629 cut-off events. For 736/839 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13490 event pairs, 20 based on Foata normal form. 21/1580 useless extension candidates. Maximal degree in co-relation 1118. Up to 142 conditions per place. [2024-11-20 14:00:15,369 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 12 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2024-11-20 14:00:15,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 490 flow [2024-11-20 14:00:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2024-11-20 14:00:15,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.928 [2024-11-20 14:00:15,371 INFO L175 Difference]: Start difference. First operand has 140 places, 143 transitions, 517 flow. Second operand 3 states and 348 transitions. [2024-11-20 14:00:15,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 490 flow [2024-11-20 14:00:15,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 476 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:15,376 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 421 flow [2024-11-20 14:00:15,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-11-20 14:00:15,377 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2024-11-20 14:00:15,377 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 421 flow [2024-11-20 14:00:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-20 14:00:15,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:15,378 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-20 14:00:15,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 14:00:15,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:15,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1765073251, now seen corresponding path program 1 times [2024-11-20 14:00:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:15,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114123700] [2024-11-20 14:00:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-20 14:00:15,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114123700] [2024-11-20 14:00:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114123700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:15,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084265192] [2024-11-20 14:00:15,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:15,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-11-20 14:00:15,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-20 14:00:15,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:15,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-11-20 14:00:15,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:15,661 INFO L124 PetriNetUnfolderBase]: 203/1827 cut-off events. [2024-11-20 14:00:15,661 INFO L125 PetriNetUnfolderBase]: For 1356/1421 co-relation queries the response was YES. [2024-11-20 14:00:15,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1827 events. 203/1827 cut-off events. For 1356/1421 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15943 event pairs, 134 based on Foata normal form. 3/1739 useless extension candidates. Maximal degree in co-relation 2957. Up to 435 conditions per place. [2024-11-20 14:00:15,668 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 25 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2024-11-20 14:00:15,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 503 flow [2024-11-20 14:00:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-20 14:00:15,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853333333333333 [2024-11-20 14:00:15,669 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 421 flow. Second operand 3 states and 332 transitions. [2024-11-20 14:00:15,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 503 flow [2024-11-20 14:00:15,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 14:00:15,673 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 455 flow [2024-11-20 14:00:15,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-11-20 14:00:15,674 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 17 predicate places. [2024-11-20 14:00:15,674 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 455 flow [2024-11-20 14:00:15,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-20 14:00:15,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:15,674 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:00:15,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1997245556, now seen corresponding path program 1 times [2024-11-20 14:00:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993217382] [2024-11-20 14:00:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:15,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:15,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:15,729 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:15,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-20 14:00:15,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-20 14:00:15,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-20 14:00:15,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-20 14:00:15,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-20 14:00:15,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-20 14:00:15,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-20 14:00:15,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-20 14:00:15,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:00:15,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:15,733 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:00:15,733 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-20 14:00:15,756 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-20 14:00:15,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 143 transitions, 326 flow [2024-11-20 14:00:15,818 INFO L124 PetriNetUnfolderBase]: 43/562 cut-off events. [2024-11-20 14:00:15,819 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-20 14:00:15,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 562 events. 43/562 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1997 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 356. Up to 32 conditions per place. [2024-11-20 14:00:15,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 143 transitions, 326 flow [2024-11-20 14:00:15,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 143 transitions, 326 flow [2024-11-20 14:00:15,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:15,825 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;@632d6580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:15,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-20 14:00:15,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:15,827 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-20 14:00:15,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:15,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:15,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:15,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:15,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 310292303, now seen corresponding path program 1 times [2024-11-20 14:00:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064845162] [2024-11-20 14:00:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:15,845 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-20 14:00:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064845162] [2024-11-20 14:00:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064845162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:15,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:15,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665309089] [2024-11-20 14:00:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:15,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:15,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2024-11-20 14:00:15,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-20 14:00:15,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:15,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2024-11-20 14:00:15,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:18,011 INFO L124 PetriNetUnfolderBase]: 7859/23223 cut-off events. [2024-11-20 14:00:18,012 INFO L125 PetriNetUnfolderBase]: For 2506/2857 co-relation queries the response was YES. [2024-11-20 14:00:18,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35573 conditions, 23223 events. 7859/23223 cut-off events. For 2506/2857 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 267152 event pairs, 4292 based on Foata normal form. 903/21908 useless extension candidates. Maximal degree in co-relation 28335. Up to 7653 conditions per place. [2024-11-20 14:00:18,310 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 30 selfloop transitions, 6 changer transitions 1/153 dead transitions. [2024-11-20 14:00:18,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 418 flow [2024-11-20 14:00:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2024-11-20 14:00:18,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9114219114219114 [2024-11-20 14:00:18,312 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 326 flow. Second operand 3 states and 391 transitions. [2024-11-20 14:00:18,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 418 flow [2024-11-20 14:00:18,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 153 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:18,316 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 364 flow [2024-11-20 14:00:18,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2024-11-20 14:00:18,317 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 4 predicate places. [2024-11-20 14:00:18,317 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 364 flow [2024-11-20 14:00:18,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-20 14:00:18,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:18,317 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] [2024-11-20 14:00:18,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:00:18,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:18,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1425725008, now seen corresponding path program 1 times [2024-11-20 14:00:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672190040] [2024-11-20 14:00:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:18,529 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-20 14:00:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672190040] [2024-11-20 14:00:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672190040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:18,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482933869] [2024-11-20 14:00:18,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:18,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:18,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:18,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2024-11-20 14:00:18,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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-20 14:00:18,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:18,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2024-11-20 14:00:18,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:22,555 INFO L124 PetriNetUnfolderBase]: 12676/35344 cut-off events. [2024-11-20 14:00:22,555 INFO L125 PetriNetUnfolderBase]: For 3145/3145 co-relation queries the response was YES. [2024-11-20 14:00:22,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57702 conditions, 35344 events. 12676/35344 cut-off events. For 3145/3145 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 432859 event pairs, 5965 based on Foata normal form. 0/31767 useless extension candidates. Maximal degree in co-relation 35470. Up to 13083 conditions per place. [2024-11-20 14:00:22,795 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 60 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-11-20 14:00:22,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 175 transitions, 556 flow [2024-11-20 14:00:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2024-11-20 14:00:22,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2024-11-20 14:00:22,797 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 364 flow. Second operand 6 states and 702 transitions. [2024-11-20 14:00:22,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 175 transitions, 556 flow [2024-11-20 14:00:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 175 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:22,852 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 360 flow [2024-11-20 14:00:22,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2024-11-20 14:00:22,852 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 5 predicate places. [2024-11-20 14:00:22,852 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 360 flow [2024-11-20 14:00:22,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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-20 14:00:22,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:22,853 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] [2024-11-20 14:00:22,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 14:00:22,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -34594014, now seen corresponding path program 1 times [2024-11-20 14:00:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349103757] [2024-11-20 14:00:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:22,902 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-20 14:00:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349103757] [2024-11-20 14:00:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349103757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300173938] [2024-11-20 14:00:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:22,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:00:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:22,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:00:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:00:22,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 143 [2024-11-20 14:00:22,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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-20 14:00:22,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:22,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 143 [2024-11-20 14:00:22,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:26,348 INFO L124 PetriNetUnfolderBase]: 8788/32683 cut-off events. [2024-11-20 14:00:26,349 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2024-11-20 14:00:26,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47760 conditions, 32683 events. 8788/32683 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 418503 event pairs, 5700 based on Foata normal form. 1/28182 useless extension candidates. Maximal degree in co-relation 16955. Up to 9905 conditions per place. [2024-11-20 14:00:26,613 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 28 selfloop transitions, 2 changer transitions 5/151 dead transitions. [2024-11-20 14:00:26,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 446 flow [2024-11-20 14:00:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2024-11-20 14:00:26,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2024-11-20 14:00:26,616 INFO L175 Difference]: Start difference. First operand has 150 places, 143 transitions, 360 flow. Second operand 6 states and 714 transitions. [2024-11-20 14:00:26,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 446 flow [2024-11-20 14:00:26,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 151 transitions, 436 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:26,619 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 372 flow [2024-11-20 14:00:26,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2024-11-20 14:00:26,619 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2024-11-20 14:00:26,620 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 372 flow [2024-11-20 14:00:26,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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-20 14:00:26,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:26,620 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 14:00:26,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash 257971780, now seen corresponding path program 1 times [2024-11-20 14:00:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871401126] [2024-11-20 14:00:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:26,661 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-20 14:00:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871401126] [2024-11-20 14:00:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871401126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:26,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:26,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041138881] [2024-11-20 14:00:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:26,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:26,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-20 14:00:26,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-20 14:00:26,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:26,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-20 14:00:26,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:31,166 INFO L124 PetriNetUnfolderBase]: 13629/40864 cut-off events. [2024-11-20 14:00:31,167 INFO L125 PetriNetUnfolderBase]: For 10648/13092 co-relation queries the response was YES. [2024-11-20 14:00:31,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71721 conditions, 40864 events. 13629/40864 cut-off events. For 10648/13092 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 523312 event pairs, 7860 based on Foata normal form. 36/36352 useless extension candidates. Maximal degree in co-relation 71661. Up to 15880 conditions per place. [2024-11-20 14:00:31,492 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 39 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2024-11-20 14:00:31,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 558 flow [2024-11-20 14:00:31,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2024-11-20 14:00:31,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9067599067599068 [2024-11-20 14:00:31,494 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 372 flow. Second operand 3 states and 389 transitions. [2024-11-20 14:00:31,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 558 flow [2024-11-20 14:00:31,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 546 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 14:00:31,613 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 456 flow [2024-11-20 14:00:31,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=151, PETRI_TRANSITIONS=153} [2024-11-20 14:00:31,614 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 6 predicate places. [2024-11-20 14:00:31,614 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 456 flow [2024-11-20 14:00:31,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-20 14:00:31,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:31,614 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] [2024-11-20 14:00:31,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 14:00:31,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:31,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1295200181, now seen corresponding path program 1 times [2024-11-20 14:00:31,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:31,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468032703] [2024-11-20 14:00:31,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468032703] [2024-11-20 14:00:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468032703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890851881] [2024-11-20 14:00:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:31,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:31,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2024-11-20 14:00:31,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 153 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-20 14:00:31,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:31,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2024-11-20 14:00:31,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:36,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [130#L1024true, 170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 45#L1022-3true, 144#true, 142#true]) [2024-11-20 14:00:36,818 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-20 14:00:36,818 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-20 14:00:36,818 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-20 14:00:36,818 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-20 14:00:36,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][182], [170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 146#true, 140#true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 98#L1023-6true, 144#true, 23#L1023-5true]) [2024-11-20 14:00:36,929 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-20 14:00:36,929 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:36,929 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:36,929 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:36,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [170#true, 20#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 112#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 142#true]) [2024-11-20 14:00:36,984 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-20 14:00:36,985 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:36,985 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-20 14:00:36,985 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-20 14:00:37,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][177], [130#L1024true, 170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 146#true, 140#true, 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 23#L1023-5true]) [2024-11-20 14:00:37,680 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-11-20 14:00:37,680 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-20 14:00:37,680 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-20 14:00:37,680 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-20 14:00:38,041 INFO L124 PetriNetUnfolderBase]: 19866/57035 cut-off events. [2024-11-20 14:00:38,041 INFO L125 PetriNetUnfolderBase]: For 9377/13250 co-relation queries the response was YES. [2024-11-20 14:00:38,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99820 conditions, 57035 events. 19866/57035 cut-off events. For 9377/13250 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 746315 event pairs, 9571 based on Foata normal form. 80/49862 useless extension candidates. Maximal degree in co-relation 78994. Up to 12589 conditions per place. [2024-11-20 14:00:38,559 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 58 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2024-11-20 14:00:38,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 184 transitions, 644 flow [2024-11-20 14:00:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2024-11-20 14:00:38,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8298368298368298 [2024-11-20 14:00:38,561 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 456 flow. Second operand 6 states and 712 transitions. [2024-11-20 14:00:38,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 184 transitions, 644 flow [2024-11-20 14:00:38,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:38,662 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 442 flow [2024-11-20 14:00:38,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2024-11-20 14:00:38,662 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 8 predicate places. [2024-11-20 14:00:38,662 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 442 flow [2024-11-20 14:00:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-20 14:00:38,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:38,663 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] [2024-11-20 14:00:38,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 14:00:38,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1577931351, now seen corresponding path program 1 times [2024-11-20 14:00:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928123094] [2024-11-20 14:00:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:38,745 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-20 14:00:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928123094] [2024-11-20 14:00:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928123094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951305294] [2024-11-20 14:00:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:38,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:38,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:38,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:00:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:38,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:00:38,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:38,896 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-20 14:00:38,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:38,947 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-20 14:00:38,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951305294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:38,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:38,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-20 14:00:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594853417] [2024-11-20 14:00:38,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:38,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:00:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:00:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:00:39,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2024-11-20 14:00:39,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 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-20 14:00:39,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:39,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2024-11-20 14:00:39,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:42,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][190], [Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 57#L1023-5true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 98#L1023-6true, 144#true, 23#L1023-5true]) [2024-11-20 14:00:42,412 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-20 14:00:42,412 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:42,412 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:42,412 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-20 14:00:42,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][188], [130#L1024true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 57#L1023-5true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 23#L1023-5true]) [2024-11-20 14:00:42,879 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-11-20 14:00:42,879 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-20 14:00:42,879 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-20 14:00:42,879 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-20 14:00:43,533 INFO L124 PetriNetUnfolderBase]: 11178/36923 cut-off events. [2024-11-20 14:00:43,533 INFO L125 PetriNetUnfolderBase]: For 5999/7801 co-relation queries the response was YES. [2024-11-20 14:00:43,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63969 conditions, 36923 events. 11178/36923 cut-off events. For 5999/7801 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 472404 event pairs, 4636 based on Foata normal form. 15/32381 useless extension candidates. Maximal degree in co-relation 32374. Up to 6529 conditions per place. [2024-11-20 14:00:43,832 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 61 selfloop transitions, 10 changer transitions 0/193 dead transitions. [2024-11-20 14:00:43,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 193 transitions, 680 flow [2024-11-20 14:00:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:00:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 14:00:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2024-11-20 14:00:43,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8391608391608392 [2024-11-20 14:00:43,834 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 442 flow. Second operand 8 states and 960 transitions. [2024-11-20 14:00:43,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 193 transitions, 680 flow [2024-11-20 14:00:43,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 193 transitions, 668 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:43,855 INFO L231 Difference]: Finished difference. Result has 158 places, 155 transitions, 476 flow [2024-11-20 14:00:43,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=476, PETRI_PLACES=158, PETRI_TRANSITIONS=155} [2024-11-20 14:00:43,856 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 13 predicate places. [2024-11-20 14:00:43,856 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 476 flow [2024-11-20 14:00:43,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 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-20 14:00:43,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:43,857 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:43,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 14:00:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:44,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:44,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash -404304548, now seen corresponding path program 1 times [2024-11-20 14:00:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:44,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290839166] [2024-11-20 14:00:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:44,088 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-20 14:00:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290839166] [2024-11-20 14:00:44,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290839166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:44,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:44,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117226709] [2024-11-20 14:00:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:44,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:44,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-20 14:00:44,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-20 14:00:44,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:44,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-20 14:00:44,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:48,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 33#L1024true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 69#L1038true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, 545#true, Black: 148#true, 98#L1023-6true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), 142#true]) [2024-11-20 14:00:48,621 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2024-11-20 14:00:48,621 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-11-20 14:00:48,621 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-20 14:00:48,621 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-20 14:00:48,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 117#L1024-3true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 69#L1038true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, 545#true, Black: 148#true, 98#L1023-6true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), 142#true]) [2024-11-20 14:00:48,631 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2024-11-20 14:00:48,631 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-20 14:00:48,632 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-20 14:00:48,632 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-20 14:00:48,682 INFO L124 PetriNetUnfolderBase]: 11773/38290 cut-off events. [2024-11-20 14:00:48,683 INFO L125 PetriNetUnfolderBase]: For 22710/24410 co-relation queries the response was YES. [2024-11-20 14:00:48,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76142 conditions, 38290 events. 11773/38290 cut-off events. For 22710/24410 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 513457 event pairs, 6499 based on Foata normal form. 24/34728 useless extension candidates. Maximal degree in co-relation 68804. Up to 13617 conditions per place. [2024-11-20 14:00:49,071 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 43 selfloop transitions, 18 changer transitions 0/180 dead transitions. [2024-11-20 14:00:49,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 180 transitions, 721 flow [2024-11-20 14:00:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2024-11-20 14:00:49,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9044289044289044 [2024-11-20 14:00:49,073 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 476 flow. Second operand 3 states and 388 transitions. [2024-11-20 14:00:49,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 180 transitions, 721 flow [2024-11-20 14:00:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 180 transitions, 715 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 14:00:49,107 INFO L231 Difference]: Finished difference. Result has 159 places, 169 transitions, 648 flow [2024-11-20 14:00:49,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=159, PETRI_TRANSITIONS=169} [2024-11-20 14:00:49,108 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places. [2024-11-20 14:00:49,108 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 169 transitions, 648 flow [2024-11-20 14:00:49,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-20 14:00:49,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:49,109 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] [2024-11-20 14:00:49,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-20 14:00:49,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:49,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1149769352, now seen corresponding path program 1 times [2024-11-20 14:00:49,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:49,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936083636] [2024-11-20 14:00:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:49,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:49,181 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-20 14:00:49,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936083636] [2024-11-20 14:00:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936083636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:49,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:49,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:00:49,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903765987] [2024-11-20 14:00:49,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:49,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:49,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:49,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2024-11-20 14:00:49,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 169 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-20 14:00:49,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:49,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2024-11-20 14:00:49,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:50,102 INFO L124 PetriNetUnfolderBase]: 688/6572 cut-off events. [2024-11-20 14:00:50,102 INFO L125 PetriNetUnfolderBase]: For 3285/3759 co-relation queries the response was YES. [2024-11-20 14:00:50,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11505 conditions, 6572 events. 688/6572 cut-off events. For 3285/3759 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 75229 event pairs, 149 based on Foata normal form. 177/6357 useless extension candidates. Maximal degree in co-relation 4603. Up to 662 conditions per place. [2024-11-20 14:00:50,136 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 16 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2024-11-20 14:00:50,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 581 flow [2024-11-20 14:00:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2024-11-20 14:00:50,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9254079254079254 [2024-11-20 14:00:50,138 INFO L175 Difference]: Start difference. First operand has 159 places, 169 transitions, 648 flow. Second operand 3 states and 397 transitions. [2024-11-20 14:00:50,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 581 flow [2024-11-20 14:00:50,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 159 transitions, 567 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:50,147 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 488 flow [2024-11-20 14:00:50,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2024-11-20 14:00:50,148 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places. [2024-11-20 14:00:50,148 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 488 flow [2024-11-20 14:00:50,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-20 14:00:50,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:50,148 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-20 14:00:50,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-20 14:00:50,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:50,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1330462637, now seen corresponding path program 1 times [2024-11-20 14:00:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:50,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709840303] [2024-11-20 14:00:50,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:50,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-20 14:00:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709840303] [2024-11-20 14:00:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709840303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:50,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733139859] [2024-11-20 14:00:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:50,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:50,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-20 14:00:50,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-20 14:00:50,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:50,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-20 14:00:50,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:51,126 INFO L124 PetriNetUnfolderBase]: 1114/7642 cut-off events. [2024-11-20 14:00:51,127 INFO L125 PetriNetUnfolderBase]: For 6514/6675 co-relation queries the response was YES. [2024-11-20 14:00:51,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15275 conditions, 7642 events. 1114/7642 cut-off events. For 6514/6675 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 90898 event pairs, 714 based on Foata normal form. 7/7132 useless extension candidates. Maximal degree in co-relation 12014. Up to 2065 conditions per place. [2024-11-20 14:00:51,161 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2024-11-20 14:00:51,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 602 flow [2024-11-20 14:00:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-20 14:00:51,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8811188811188811 [2024-11-20 14:00:51,162 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 488 flow. Second operand 3 states and 378 transitions. [2024-11-20 14:00:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 602 flow [2024-11-20 14:00:51,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 14:00:51,169 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 520 flow [2024-11-20 14:00:51,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2024-11-20 14:00:51,170 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 17 predicate places. [2024-11-20 14:00:51,170 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 520 flow [2024-11-20 14:00:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-20 14:00:51,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:51,170 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-20 14:00:51,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1780606827, now seen corresponding path program 1 times [2024-11-20 14:00:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985248685] [2024-11-20 14:00:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 14:00:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985248685] [2024-11-20 14:00:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985248685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383572244] [2024-11-20 14:00:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:51,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-20 14:00:51,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-20 14:00:51,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:51,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-20 14:00:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:52,136 INFO L124 PetriNetUnfolderBase]: 1121/7928 cut-off events. [2024-11-20 14:00:52,136 INFO L125 PetriNetUnfolderBase]: For 8662/8814 co-relation queries the response was YES. [2024-11-20 14:00:52,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16348 conditions, 7928 events. 1121/7928 cut-off events. For 8662/8814 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 95369 event pairs, 707 based on Foata normal form. 4/7482 useless extension candidates. Maximal degree in co-relation 13094. Up to 2095 conditions per place. [2024-11-20 14:00:52,178 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2024-11-20 14:00:52,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 161 transitions, 625 flow [2024-11-20 14:00:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-11-20 14:00:52,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2024-11-20 14:00:52,180 INFO L175 Difference]: Start difference. First operand has 162 places, 155 transitions, 520 flow. Second operand 3 states and 377 transitions. [2024-11-20 14:00:52,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 161 transitions, 625 flow [2024-11-20 14:00:52,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 611 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:52,193 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 548 flow [2024-11-20 14:00:52,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2024-11-20 14:00:52,193 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 19 predicate places. [2024-11-20 14:00:52,193 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 548 flow [2024-11-20 14:00:52,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-20 14:00:52,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:52,194 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2024-11-20 14:00:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-20 14:00:52,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2042999134, now seen corresponding path program 1 times [2024-11-20 14:00:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354739891] [2024-11-20 14:00:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:52,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:52,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:52,241 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:52,241 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2024-11-20 14:00:52,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-20 14:00:52,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-20 14:00:52,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-20 14:00:52,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-11-20 14:00:52,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-20 14:00:52,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-20 14:00:52,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-20 14:00:52,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-20 14:00:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-20 14:00:52,242 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:52,335 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2024-11-20 14:00:52,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:00:52,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:00:52 BasicIcfg [2024-11-20 14:00:52,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:00:52,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:00:52,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:00:52,352 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:00:52,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:00:02" (3/4) ... [2024-11-20 14:00:52,354 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 14:00:52,440 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 14:00:52,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:00:52,442 INFO L158 Benchmark]: Toolchain (without parser) took 51598.33ms. Allocated memory was 138.4MB in the beginning and 14.6GB in the end (delta: 14.5GB). Free memory was 66.1MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2024-11-20 14:00:52,443 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:00:52,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.59ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 66.1MB in the beginning and 151.1MB in the end (delta: -85.0MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-20 14:00:52,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 197.1MB. Free memory was 151.1MB in the beginning and 149.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:00:52,444 INFO L158 Benchmark]: Boogie Preprocessor took 31.85ms. Allocated memory is still 197.1MB. Free memory was 149.0MB in the beginning and 146.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:00:52,444 INFO L158 Benchmark]: RCFGBuilder took 469.50ms. Allocated memory is still 197.1MB. Free memory was 146.9MB in the beginning and 131.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 14:00:52,444 INFO L158 Benchmark]: TraceAbstraction took 50298.55ms. Allocated memory was 197.1MB in the beginning and 14.6GB in the end (delta: 14.4GB). Free memory was 130.1MB in the beginning and 11.4GB in the end (delta: -11.2GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2024-11-20 14:00:52,444 INFO L158 Benchmark]: Witness Printer took 90.11ms. Allocated memory is still 14.6GB. Free memory was 11.4GB in the beginning and 11.3GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 14:00:52,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.59ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 66.1MB in the beginning and 151.1MB in the end (delta: -85.0MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 197.1MB. Free memory was 151.1MB in the beginning and 149.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.85ms. Allocated memory is still 197.1MB. Free memory was 149.0MB in the beginning and 146.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.50ms. Allocated memory is still 197.1MB. Free memory was 146.9MB in the beginning and 131.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 50298.55ms. Allocated memory was 197.1MB in the beginning and 14.6GB in the end (delta: 14.4GB). Free memory was 130.1MB in the beginning and 11.4GB in the end (delta: -11.2GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 90.11ms. Allocated memory is still 14.6GB. Free memory was 11.4GB in the beginning and 11.3GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1023]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 int data = 0; VAL [data=0] [L1020] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L1028] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=2] [L1029] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}] [L1029] RET 0 assume_abort_if_not(threads_total >= 0) [L1030] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1031] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1031] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1034] 0 int i = 0; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1034] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] EXPR 0 tids[i] VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1025] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1035] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1034] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1034] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1038] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [1038] and C: data = __VERIFIER_nondet_int() [1023] - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 103 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 5 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 120 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 804 IncrementalHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 35 mSDtfsCounter, 804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 137 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 42 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 1061 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 62/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 154 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 522 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 57 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=648occurred in iteration=7, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 681 ConstructedInterpolants, 0 QuantifiedInterpolants, 1159 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 146/149 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 14:00:52,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE