./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/per-thread-index-inc-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:20:27,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:20:27,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:20:27,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:20:27,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:20:27,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:20:27,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:20:27,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:20:27,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:20:27,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:20:27,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:20:27,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:20:27,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:20:27,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:20:27,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:20:27,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:20:27,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:20:27,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:20:27,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:20:27,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:20:27,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:20:27,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:20:27,679 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:20:27,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:20:27,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:20:27,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:20:27,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:20:27,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:20:27,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:20:27,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:20:27,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:20:27,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:27,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:20:27,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:20:27,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:20:27,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:20:27,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:20:27,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:20:27,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:20:27,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:20:27,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:20:27,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcbcb8208024116480c974e9f1bc8db6725056562df0982447c3fb673ff0c0ec [2024-10-11 17:20:27,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:20:27,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:20:27,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:20:27,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:20:28,000 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:20:28,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-10-11 17:20:29,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:20:29,775 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:20:29,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race.i [2024-10-11 17:20:29,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c345e9af4/be721658c0b4425592694aaff46500e0/FLAG43799f48b [2024-10-11 17:20:30,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c345e9af4/be721658c0b4425592694aaff46500e0 [2024-10-11 17:20:30,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:20:30,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:20:30,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:30,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:20:30,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:20:30,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609cc317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30, skipping insertion in model container [2024-10-11 17:20:30,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:20:30,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:30,619 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:20:30,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:30,721 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:20:30,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30 WrapperNode [2024-10-11 17:20:30,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:30,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:30,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:20:30,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:20:30,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,775 INFO L138 Inliner]: procedures = 273, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-10-11 17:20:30,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:30,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:20:30,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:20:30,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:20:30,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:20:30,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:20:30,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:20:30,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:20:30,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (1/1) ... [2024-10-11 17:20:30,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:30,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:30,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:20:30,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:20:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:20:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:20:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:20:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:20:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:20:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:20:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:20:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:20:30,908 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:20:31,074 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:20:31,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:20:31,327 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:20:31,327 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:20:31,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:20:31,347 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:20:31,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:31 BoogieIcfgContainer [2024-10-11 17:20:31,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:20:31,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:20:31,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:20:31,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:20:31,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:20:30" (1/3) ... [2024-10-11 17:20:31,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5491b8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:31, skipping insertion in model container [2024-10-11 17:20:31,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:30" (2/3) ... [2024-10-11 17:20:31,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5491b8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:31, skipping insertion in model container [2024-10-11 17:20:31,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:31" (3/3) ... [2024-10-11 17:20:31,357 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race.i [2024-10-11 17:20:31,374 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:20:31,375 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-11 17:20:31,375 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:20:31,477 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:20:31,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 112 transitions, 231 flow [2024-10-11 17:20:31,580 INFO L124 PetriNetUnfolderBase]: 6/147 cut-off events. [2024-10-11 17:20:31,580 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:20:31,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 147 events. 6/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 247 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2024-10-11 17:20:31,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 112 transitions, 231 flow [2024-10-11 17:20:31,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 112 transitions, 231 flow [2024-10-11 17:20:31,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:20:31,611 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;@3e4ac08b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:20:31,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 17:20:31,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:20:31,626 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-10-11 17:20:31,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:20:31,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:31,627 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] [2024-10-11 17:20:31,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:31,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1757414955, now seen corresponding path program 1 times [2024-10-11 17:20:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280178479] [2024-10-11 17:20:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:31,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280178479] [2024-10-11 17:20:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280178479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:31,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:31,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391715576] [2024-10-11 17:20:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:31,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:31,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:31,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2024-10-11 17:20:31,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:32,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:32,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2024-10-11 17:20:32,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:32,062 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2024-10-11 17:20:32,062 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-11 17:20:32,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 151 events. 3/151 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 296 event pairs, 2 based on Foata normal form. 7/140 useless extension candidates. Maximal degree in co-relation 90. Up to 15 conditions per place. [2024-10-11 17:20:32,065 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 8 selfloop transitions, 2 changer transitions 1/108 dead transitions. [2024-10-11 17:20:32,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 243 flow [2024-10-11 17:20:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2024-10-11 17:20:32,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-10-11 17:20:32,089 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 231 flow. Second operand 3 states and 308 transitions. [2024-10-11 17:20:32,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 243 flow [2024-10-11 17:20:32,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 243 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:32,100 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 225 flow [2024-10-11 17:20:32,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2024-10-11 17:20:32,110 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2024-10-11 17:20:32,110 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 225 flow [2024-10-11 17:20:32,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:32,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:32,111 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:32,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:20:32,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -806940075, now seen corresponding path program 1 times [2024-10-11 17:20:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:32,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488439054] [2024-10-11 17:20:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488439054] [2024-10-11 17:20:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488439054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:32,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681826021] [2024-10-11 17:20:32,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:32,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:32,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:32,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-10-11 17:20:32,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:32,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:32,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-10-11 17:20:32,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:32,319 INFO L124 PetriNetUnfolderBase]: 5/190 cut-off events. [2024-10-11 17:20:32,319 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:20:32,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 190 events. 5/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 407 event pairs, 2 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 184. Up to 16 conditions per place. [2024-10-11 17:20:32,323 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-10-11 17:20:32,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 243 flow [2024-10-11 17:20:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2024-10-11 17:20:32,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2024-10-11 17:20:32,327 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 225 flow. Second operand 3 states and 311 transitions. [2024-10-11 17:20:32,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 243 flow [2024-10-11 17:20:32,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:32,332 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 231 flow [2024-10-11 17:20:32,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2024-10-11 17:20:32,333 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2024-10-11 17:20:32,333 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 231 flow [2024-10-11 17:20:32,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:32,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:32,334 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] [2024-10-11 17:20:32,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:20:32,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:32,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1122336323, now seen corresponding path program 1 times [2024-10-11 17:20:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422357919] [2024-10-11 17:20:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:32,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422357919] [2024-10-11 17:20:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422357919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:32,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603121045] [2024-10-11 17:20:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:32,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:33,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2024-10-11 17:20:33,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:33,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2024-10-11 17:20:33,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:33,351 INFO L124 PetriNetUnfolderBase]: 73/418 cut-off events. [2024-10-11 17:20:33,352 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:20:33,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 418 events. 73/418 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1943 event pairs, 35 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 516. Up to 159 conditions per place. [2024-10-11 17:20:33,355 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 23 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2024-10-11 17:20:33,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 128 transitions, 363 flow [2024-10-11 17:20:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-10-11 17:20:33,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8273809523809523 [2024-10-11 17:20:33,363 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 231 flow. Second operand 6 states and 556 transitions. [2024-10-11 17:20:33,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 128 transitions, 363 flow [2024-10-11 17:20:33,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 128 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:33,369 INFO L231 Difference]: Finished difference. Result has 120 places, 128 transitions, 381 flow [2024-10-11 17:20:33,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=120, PETRI_TRANSITIONS=128} [2024-10-11 17:20:33,371 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2024-10-11 17:20:33,371 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 381 flow [2024-10-11 17:20:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:33,372 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:33,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:20:33,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:33,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1345351484, now seen corresponding path program 1 times [2024-10-11 17:20:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:33,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218823363] [2024-10-11 17:20:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:33,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218823363] [2024-10-11 17:20:33,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218823363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:33,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:33,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:33,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857389816] [2024-10-11 17:20:33,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:33,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:33,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:33,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 112 [2024-10-11 17:20:33,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:33,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 112 [2024-10-11 17:20:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:33,665 INFO L124 PetriNetUnfolderBase]: 34/281 cut-off events. [2024-10-11 17:20:33,665 INFO L125 PetriNetUnfolderBase]: For 29/44 co-relation queries the response was YES. [2024-10-11 17:20:33,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 281 events. 34/281 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 926 event pairs, 0 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 356. Up to 49 conditions per place. [2024-10-11 17:20:33,671 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions. [2024-10-11 17:20:33,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 427 flow [2024-10-11 17:20:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2024-10-11 17:20:33,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8854166666666666 [2024-10-11 17:20:33,674 INFO L175 Difference]: Start difference. First operand has 120 places, 128 transitions, 381 flow. Second operand 6 states and 595 transitions. [2024-10-11 17:20:33,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 427 flow [2024-10-11 17:20:33,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 427 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:33,682 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 399 flow [2024-10-11 17:20:33,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2024-10-11 17:20:33,685 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 18 predicate places. [2024-10-11 17:20:33,686 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 399 flow [2024-10-11 17:20:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:33,687 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] [2024-10-11 17:20:33,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:20:33,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:33,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1255025239, now seen corresponding path program 1 times [2024-10-11 17:20:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072425617] [2024-10-11 17:20:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:33,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072425617] [2024-10-11 17:20:33,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072425617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:33,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:33,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328199143] [2024-10-11 17:20:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:33,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:33,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:33,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-10-11 17:20:33,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:33,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-10-11 17:20:33,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:33,777 INFO L124 PetriNetUnfolderBase]: 33/267 cut-off events. [2024-10-11 17:20:33,778 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-10-11 17:20:33,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 267 events. 33/267 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 888 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 371. Up to 49 conditions per place. [2024-10-11 17:20:33,780 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 5 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-10-11 17:20:33,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 409 flow [2024-10-11 17:20:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-10-11 17:20:33,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2024-10-11 17:20:33,782 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 399 flow. Second operand 3 states and 309 transitions. [2024-10-11 17:20:33,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 409 flow [2024-10-11 17:20:33,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 395 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:20:33,787 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 385 flow [2024-10-11 17:20:33,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2024-10-11 17:20:33,788 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2024-10-11 17:20:33,788 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 385 flow [2024-10-11 17:20:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:33,789 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] [2024-10-11 17:20:33,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:20:33,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:33,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2061779004, now seen corresponding path program 1 times [2024-10-11 17:20:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790587284] [2024-10-11 17:20:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790587284] [2024-10-11 17:20:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790587284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47651677] [2024-10-11 17:20:33,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:33,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:33,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:33,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2024-10-11 17:20:33,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:33,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2024-10-11 17:20:33,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:33,905 INFO L124 PetriNetUnfolderBase]: 33/266 cut-off events. [2024-10-11 17:20:33,906 INFO L125 PetriNetUnfolderBase]: For 30/39 co-relation queries the response was YES. [2024-10-11 17:20:33,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 266 events. 33/266 cut-off events. For 30/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 883 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 370. Up to 49 conditions per place. [2024-10-11 17:20:33,908 INFO L140 encePairwiseOnDemand]: 109/112 looper letters, 6 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-10-11 17:20:33,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 125 transitions, 399 flow [2024-10-11 17:20:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-10-11 17:20:33,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2024-10-11 17:20:33,910 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 385 flow. Second operand 3 states and 309 transitions. [2024-10-11 17:20:33,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 125 transitions, 399 flow [2024-10-11 17:20:33,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:33,916 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 383 flow [2024-10-11 17:20:33,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2024-10-11 17:20:33,919 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2024-10-11 17:20:33,920 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 383 flow [2024-10-11 17:20:33,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:33,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:33,921 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] [2024-10-11 17:20:33,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:20:33,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 959140595, now seen corresponding path program 1 times [2024-10-11 17:20:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335725328] [2024-10-11 17:20:33,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:20:34,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335725328] [2024-10-11 17:20:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335725328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944107237] [2024-10-11 17:20:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:34,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:34,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:34,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:34,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2024-10-11 17:20:34,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:34,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2024-10-11 17:20:34,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:34,544 INFO L124 PetriNetUnfolderBase]: 81/424 cut-off events. [2024-10-11 17:20:34,544 INFO L125 PetriNetUnfolderBase]: For 87/177 co-relation queries the response was YES. [2024-10-11 17:20:34,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 424 events. 81/424 cut-off events. For 87/177 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2071 event pairs, 15 based on Foata normal form. 16/410 useless extension candidates. Maximal degree in co-relation 774. Up to 173 conditions per place. [2024-10-11 17:20:34,547 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 38 selfloop transitions, 21 changer transitions 7/147 dead transitions. [2024-10-11 17:20:34,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 147 transitions, 588 flow [2024-10-11 17:20:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2024-10-11 17:20:34,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-10-11 17:20:34,549 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 383 flow. Second operand 6 states and 567 transitions. [2024-10-11 17:20:34,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 147 transitions, 588 flow [2024-10-11 17:20:34,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 147 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:34,555 INFO L231 Difference]: Finished difference. Result has 128 places, 140 transitions, 540 flow [2024-10-11 17:20:34,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=128, PETRI_TRANSITIONS=140} [2024-10-11 17:20:34,556 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 17 predicate places. [2024-10-11 17:20:34,557 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 140 transitions, 540 flow [2024-10-11 17:20:34,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:34,558 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] [2024-10-11 17:20:34,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:20:34,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-11 17:20:34,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1142501627, now seen corresponding path program 1 times [2024-10-11 17:20:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:34,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417494387] [2024-10-11 17:20:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:20:34,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:20:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:20:34,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:20:34,635 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:20:34,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-10-11 17:20:34,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-11 17:20:34,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-11 17:20:34,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-11 17:20:34,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-11 17:20:34,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-11 17:20:34,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-11 17:20:34,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-11 17:20:34,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-11 17:20:34,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-11 17:20:34,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-10-11 17:20:34,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-11 17:20:34,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-11 17:20:34,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-11 17:20:34,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-11 17:20:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:20:34,643 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:34,645 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:20:34,647 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:20:34,672 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:20:34,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 148 transitions, 312 flow [2024-10-11 17:20:34,716 INFO L124 PetriNetUnfolderBase]: 11/254 cut-off events. [2024-10-11 17:20:34,716 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-10-11 17:20:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 254 events. 11/254 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 582 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2024-10-11 17:20:34,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 148 transitions, 312 flow [2024-10-11 17:20:34,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 148 transitions, 312 flow [2024-10-11 17:20:34,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:20:34,723 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;@3e4ac08b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:20:34,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:20:34,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:20:34,729 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2024-10-11 17:20:34,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:20:34,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:34,729 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] [2024-10-11 17:20:34,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1166251989, now seen corresponding path program 1 times [2024-10-11 17:20:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684344888] [2024-10-11 17:20:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684344888] [2024-10-11 17:20:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684344888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:34,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392955554] [2024-10-11 17:20:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:34,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:34,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-10-11 17:20:34,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:34,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-10-11 17:20:34,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:34,852 INFO L124 PetriNetUnfolderBase]: 19/420 cut-off events. [2024-10-11 17:20:34,852 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-10-11 17:20:34,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 420 events. 19/420 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1715 event pairs, 16 based on Foata normal form. 17/386 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2024-10-11 17:20:34,857 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 11 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2024-10-11 17:20:34,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 330 flow [2024-10-11 17:20:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-10-11 17:20:34,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234234234234234 [2024-10-11 17:20:34,859 INFO L175 Difference]: Start difference. First operand has 148 places, 148 transitions, 312 flow. Second operand 3 states and 410 transitions. [2024-10-11 17:20:34,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 330 flow [2024-10-11 17:20:34,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:34,862 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 306 flow [2024-10-11 17:20:34,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=304, 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=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2024-10-11 17:20:34,864 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2024-10-11 17:20:34,864 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 306 flow [2024-10-11 17:20:34,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:34,865 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:34,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:20:34,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash -61724567, now seen corresponding path program 1 times [2024-10-11 17:20:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512985552] [2024-10-11 17:20:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:34,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:34,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512985552] [2024-10-11 17:20:34,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512985552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:34,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:34,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509003304] [2024-10-11 17:20:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:34,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:34,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:34,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-10-11 17:20:34,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:34,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:34,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-10-11 17:20:34,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:34,993 INFO L124 PetriNetUnfolderBase]: 48/667 cut-off events. [2024-10-11 17:20:34,993 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 17:20:34,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 667 events. 48/667 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3460 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 760. Up to 97 conditions per place. [2024-10-11 17:20:35,000 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 12 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2024-10-11 17:20:35,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 343 flow [2024-10-11 17:20:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2024-10-11 17:20:35,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9256756756756757 [2024-10-11 17:20:35,002 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 306 flow. Second operand 3 states and 411 transitions. [2024-10-11 17:20:35,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 343 flow [2024-10-11 17:20:35,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:35,005 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 317 flow [2024-10-11 17:20:35,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2024-10-11 17:20:35,006 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, -2 predicate places. [2024-10-11 17:20:35,006 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 317 flow [2024-10-11 17:20:35,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:35,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:35,007 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] [2024-10-11 17:20:35,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:20:35,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:35,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash 14905815, now seen corresponding path program 1 times [2024-10-11 17:20:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:35,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580128019] [2024-10-11 17:20:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:35,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580128019] [2024-10-11 17:20:35,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580128019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:35,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:35,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643533699] [2024-10-11 17:20:35,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:35,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:35,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:35,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 148 [2024-10-11 17:20:35,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:35,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:35,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 148 [2024-10-11 17:20:35,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:36,072 INFO L124 PetriNetUnfolderBase]: 1014/3225 cut-off events. [2024-10-11 17:20:36,073 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-10-11 17:20:36,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5114 conditions, 3225 events. 1014/3225 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 25955 event pairs, 586 based on Foata normal form. 0/2825 useless extension candidates. Maximal degree in co-relation 4166. Up to 1589 conditions per place. [2024-10-11 17:20:36,098 INFO L140 encePairwiseOnDemand]: 133/148 looper letters, 30 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2024-10-11 17:20:36,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 181 transitions, 534 flow [2024-10-11 17:20:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2024-10-11 17:20:36,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8547297297297297 [2024-10-11 17:20:36,101 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 317 flow. Second operand 6 states and 759 transitions. [2024-10-11 17:20:36,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 181 transitions, 534 flow [2024-10-11 17:20:36,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 181 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:36,106 INFO L231 Difference]: Finished difference. Result has 156 places, 180 transitions, 571 flow [2024-10-11 17:20:36,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=156, PETRI_TRANSITIONS=180} [2024-10-11 17:20:36,108 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 8 predicate places. [2024-10-11 17:20:36,109 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 180 transitions, 571 flow [2024-10-11 17:20:36,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:36,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:36,110 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] [2024-10-11 17:20:36,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:20:36,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:36,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1842185304, now seen corresponding path program 1 times [2024-10-11 17:20:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242053174] [2024-10-11 17:20:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:36,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242053174] [2024-10-11 17:20:36,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242053174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:36,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91891780] [2024-10-11 17:20:36,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:36,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:36,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:36,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 148 [2024-10-11 17:20:36,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 180 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:36,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:36,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 148 [2024-10-11 17:20:36,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:36,527 INFO L124 PetriNetUnfolderBase]: 436/1802 cut-off events. [2024-10-11 17:20:36,528 INFO L125 PetriNetUnfolderBase]: For 382/609 co-relation queries the response was YES. [2024-10-11 17:20:36,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1802 events. 436/1802 cut-off events. For 382/609 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 12682 event pairs, 135 based on Foata normal form. 2/1653 useless extension candidates. Maximal degree in co-relation 2673. Up to 612 conditions per place. [2024-10-11 17:20:36,545 INFO L140 encePairwiseOnDemand]: 140/148 looper letters, 14 selfloop transitions, 2 changer transitions 5/186 dead transitions. [2024-10-11 17:20:36,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 186 transitions, 625 flow [2024-10-11 17:20:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2024-10-11 17:20:36,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031531531531531 [2024-10-11 17:20:36,548 INFO L175 Difference]: Start difference. First operand has 156 places, 180 transitions, 571 flow. Second operand 6 states and 802 transitions. [2024-10-11 17:20:36,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 186 transitions, 625 flow [2024-10-11 17:20:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 186 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:36,555 INFO L231 Difference]: Finished difference. Result has 165 places, 181 transitions, 593 flow [2024-10-11 17:20:36,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=165, PETRI_TRANSITIONS=181} [2024-10-11 17:20:36,556 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 17 predicate places. [2024-10-11 17:20:36,556 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 181 transitions, 593 flow [2024-10-11 17:20:36,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:36,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:36,557 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] [2024-10-11 17:20:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:20:36,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:36,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1936166393, now seen corresponding path program 1 times [2024-10-11 17:20:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486572771] [2024-10-11 17:20:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486572771] [2024-10-11 17:20:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486572771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:36,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327724405] [2024-10-11 17:20:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:36,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:36,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 148 [2024-10-11 17:20:36,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 181 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:36,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:36,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 148 [2024-10-11 17:20:36,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:37,090 INFO L124 PetriNetUnfolderBase]: 716/3519 cut-off events. [2024-10-11 17:20:37,091 INFO L125 PetriNetUnfolderBase]: For 681/878 co-relation queries the response was YES. [2024-10-11 17:20:37,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 3519 events. 716/3519 cut-off events. For 681/878 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 33250 event pairs, 150 based on Foata normal form. 0/3261 useless extension candidates. Maximal degree in co-relation 6208. Up to 1046 conditions per place. [2024-10-11 17:20:37,130 INFO L140 encePairwiseOnDemand]: 134/148 looper letters, 21 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2024-10-11 17:20:37,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 194 transitions, 692 flow [2024-10-11 17:20:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-10-11 17:20:37,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-10-11 17:20:37,132 INFO L175 Difference]: Start difference. First operand has 165 places, 181 transitions, 593 flow. Second operand 3 states and 416 transitions. [2024-10-11 17:20:37,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 194 transitions, 692 flow [2024-10-11 17:20:37,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 194 transitions, 680 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:20:37,146 INFO L231 Difference]: Finished difference. Result has 162 places, 191 transitions, 669 flow [2024-10-11 17:20:37,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=162, PETRI_TRANSITIONS=191} [2024-10-11 17:20:37,147 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 14 predicate places. [2024-10-11 17:20:37,147 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 669 flow [2024-10-11 17:20:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:37,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:37,148 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] [2024-10-11 17:20:37,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:20:37,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:37,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash -319198242, now seen corresponding path program 1 times [2024-10-11 17:20:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33132613] [2024-10-11 17:20:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:37,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:37,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33132613] [2024-10-11 17:20:37,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33132613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:37,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424811807] [2024-10-11 17:20:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:37,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:37,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:37,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:37,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-10-11 17:20:37,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:37,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:37,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-10-11 17:20:37,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:37,842 INFO L124 PetriNetUnfolderBase]: 810/4027 cut-off events. [2024-10-11 17:20:37,842 INFO L125 PetriNetUnfolderBase]: For 910/1103 co-relation queries the response was YES. [2024-10-11 17:20:37,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7300 conditions, 4027 events. 810/4027 cut-off events. For 910/1103 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 39368 event pairs, 164 based on Foata normal form. 5/3738 useless extension candidates. Maximal degree in co-relation 6319. Up to 1186 conditions per place. [2024-10-11 17:20:37,876 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 20 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2024-10-11 17:20:37,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 200 transitions, 769 flow [2024-10-11 17:20:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-10-11 17:20:37,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9346846846846847 [2024-10-11 17:20:37,879 INFO L175 Difference]: Start difference. First operand has 162 places, 191 transitions, 669 flow. Second operand 3 states and 415 transitions. [2024-10-11 17:20:37,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 200 transitions, 769 flow [2024-10-11 17:20:37,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 200 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:37,893 INFO L231 Difference]: Finished difference. Result has 164 places, 198 transitions, 725 flow [2024-10-11 17:20:37,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=725, PETRI_PLACES=164, PETRI_TRANSITIONS=198} [2024-10-11 17:20:37,894 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 16 predicate places. [2024-10-11 17:20:37,894 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 198 transitions, 725 flow [2024-10-11 17:20:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:37,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:37,895 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] [2024-10-11 17:20:37,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:20:37,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1875307, now seen corresponding path program 1 times [2024-10-11 17:20:37,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:37,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248486703] [2024-10-11 17:20:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:37,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:20:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248486703] [2024-10-11 17:20:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248486703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261648023] [2024-10-11 17:20:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:38,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-11 17:20:38,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 198 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:38,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:38,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-11 17:20:38,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:39,491 INFO L124 PetriNetUnfolderBase]: 2243/7607 cut-off events. [2024-10-11 17:20:39,491 INFO L125 PetriNetUnfolderBase]: For 2377/8107 co-relation queries the response was YES. [2024-10-11 17:20:39,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16481 conditions, 7607 events. 2243/7607 cut-off events. For 2377/8107 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 78106 event pairs, 601 based on Foata normal form. 241/7172 useless extension candidates. Maximal degree in co-relation 14233. Up to 3716 conditions per place. [2024-10-11 17:20:39,563 INFO L140 encePairwiseOnDemand]: 133/148 looper letters, 64 selfloop transitions, 38 changer transitions 0/237 dead transitions. [2024-10-11 17:20:39,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 237 transitions, 1077 flow [2024-10-11 17:20:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2024-10-11 17:20:39,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8671171171171171 [2024-10-11 17:20:39,566 INFO L175 Difference]: Start difference. First operand has 164 places, 198 transitions, 725 flow. Second operand 6 states and 770 transitions. [2024-10-11 17:20:39,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 237 transitions, 1077 flow [2024-10-11 17:20:39,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 237 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:39,583 INFO L231 Difference]: Finished difference. Result has 172 places, 235 transitions, 1025 flow [2024-10-11 17:20:39,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=172, PETRI_TRANSITIONS=235} [2024-10-11 17:20:39,585 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 24 predicate places. [2024-10-11 17:20:39,585 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 235 transitions, 1025 flow [2024-10-11 17:20:39,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:39,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:39,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:20:39,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:39,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1395823936, now seen corresponding path program 1 times [2024-10-11 17:20:39,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:39,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872362971] [2024-10-11 17:20:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872362971] [2024-10-11 17:20:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872362971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:39,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:39,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131462613] [2024-10-11 17:20:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:39,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:40,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 148 [2024-10-11 17:20:40,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 235 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:40,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:40,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 148 [2024-10-11 17:20:40,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:42,326 INFO L124 PetriNetUnfolderBase]: 5040/15273 cut-off events. [2024-10-11 17:20:42,326 INFO L125 PetriNetUnfolderBase]: For 9427/22602 co-relation queries the response was YES. [2024-10-11 17:20:42,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39368 conditions, 15273 events. 5040/15273 cut-off events. For 9427/22602 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 161271 event pairs, 840 based on Foata normal form. 40/14177 useless extension candidates. Maximal degree in co-relation 35374. Up to 6568 conditions per place. [2024-10-11 17:20:42,452 INFO L140 encePairwiseOnDemand]: 129/148 looper letters, 127 selfloop transitions, 118 changer transitions 0/382 dead transitions. [2024-10-11 17:20:42,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 382 transitions, 2373 flow [2024-10-11 17:20:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2024-10-11 17:20:42,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2024-10-11 17:20:42,455 INFO L175 Difference]: Start difference. First operand has 172 places, 235 transitions, 1025 flow. Second operand 6 states and 804 transitions. [2024-10-11 17:20:42,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 382 transitions, 2373 flow [2024-10-11 17:20:42,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 382 transitions, 2241 flow, removed 66 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:42,525 INFO L231 Difference]: Finished difference. Result has 181 places, 347 transitions, 2091 flow [2024-10-11 17:20:42,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2091, PETRI_PLACES=181, PETRI_TRANSITIONS=347} [2024-10-11 17:20:42,527 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 33 predicate places. [2024-10-11 17:20:42,527 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 347 transitions, 2091 flow [2024-10-11 17:20:42,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:42,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:42,528 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] [2024-10-11 17:20:42,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:20:42,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash 930580674, now seen corresponding path program 1 times [2024-10-11 17:20:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343582212] [2024-10-11 17:20:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:42,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:20:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343582212] [2024-10-11 17:20:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343582212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622447240] [2024-10-11 17:20:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:42,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 148 [2024-10-11 17:20:42,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 347 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:42,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:42,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 148 [2024-10-11 17:20:42,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:43,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] threadEXIT-->L1061-7: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem15#1_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][258], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 87#L1061-7true, Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 53#L1048-5true, 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 180#true, Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-10-11 17:20:43,880 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-10-11 17:20:43,881 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 17:20:43,881 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 17:20:43,881 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-11 17:20:44,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([465] threadEXIT-->L1061-7: Formula: (= v_threadThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem15#1_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|} AuxVars[] AssignedVars[][298], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, Black: 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 213#(= |threadThread2of2ForFork0_#t~nondet4| |#race~next_j~0|), 133#L1048-7true, 87#L1061-7true, Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 156#(= |#race~datas~0| 0), Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 149#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 146#true, 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 182#(= |#race~next_j~0| 0), Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-10-11 17:20:44,050 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-10-11 17:20:44,050 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-10-11 17:20:44,051 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-10-11 17:20:44,051 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-10-11 17:20:44,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L1061-1-->L1061-2: Formula: (= (store |v_#race_12| |v_ULTIMATE.start_main_~tids~0#1.base_11| (store (select |v_#race_12| |v_ULTIMATE.start_main_~tids~0#1.base_11|) (+ (* |v_ULTIMATE.start_main_~i~1#1_6| 4) |v_ULTIMATE.start_main_~tids~0#1.offset_11|) 0)) |v_#race_11|) InVars {#race=|v_#race_12|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_11|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_6|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_11|} OutVars{#race=|v_#race_11|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_11|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_6|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_11|} AuxVars[] AssignedVars[#race][122], [201#true, Black: 194#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 195#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 190#true, 192#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 158#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 211#true, Black: 203#(= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 204#(and (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet6| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 147#true, 156#(= |#race~datas~0| 0), 90#L1049-11true, Black: 154#true, Black: 161#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 162#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), Black: 160#(= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 163#(and (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet12#1|) (= |ULTIMATE.start_main_#t~nondet12#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet12#1|)), 148#true, Black: 171#(= |ULTIMATE.start_main_~i~0#1| 0), 17#L1061-2true, Black: 182#(= |#race~next_j~0| 0), Black: 187#(= |threadThread1of2ForFork0_#t~nondet4| |#race~next_j~0|)]) [2024-10-11 17:20:44,407 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-10-11 17:20:44,407 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-11 17:20:44,407 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-11 17:20:44,407 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-11 17:20:44,433 INFO L124 PetriNetUnfolderBase]: 3866/13161 cut-off events. [2024-10-11 17:20:44,433 INFO L125 PetriNetUnfolderBase]: For 10154/11349 co-relation queries the response was YES. [2024-10-11 17:20:44,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36269 conditions, 13161 events. 3866/13161 cut-off events. For 10154/11349 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 144583 event pairs, 307 based on Foata normal form. 11/12573 useless extension candidates. Maximal degree in co-relation 32371. Up to 3169 conditions per place. [2024-10-11 17:20:44,568 INFO L140 encePairwiseOnDemand]: 141/148 looper letters, 22 selfloop transitions, 11 changer transitions 0/355 dead transitions. [2024-10-11 17:20:44,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 355 transitions, 2190 flow [2024-10-11 17:20:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-10-11 17:20:44,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9324324324324325 [2024-10-11 17:20:44,570 INFO L175 Difference]: Start difference. First operand has 181 places, 347 transitions, 2091 flow. Second operand 3 states and 414 transitions. [2024-10-11 17:20:44,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 355 transitions, 2190 flow [2024-10-11 17:20:44,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 355 transitions, 2154 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:44,871 INFO L231 Difference]: Finished difference. Result has 185 places, 354 transitions, 2143 flow [2024-10-11 17:20:44,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=185, PETRI_TRANSITIONS=354} [2024-10-11 17:20:44,873 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 37 predicate places. [2024-10-11 17:20:44,873 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 354 transitions, 2143 flow [2024-10-11 17:20:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:44,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:44,874 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] [2024-10-11 17:20:44,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:20:44,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:20:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 957147819, now seen corresponding path program 1 times [2024-10-11 17:20:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045640669] [2024-10-11 17:20:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:20:44,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:20:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:20:44,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:20:44,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:20:44,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2024-10-11 17:20:44,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-10-11 17:20:44,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-10-11 17:20:44,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-10-11 17:20:44,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-10-11 17:20:44,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 20 remaining) [2024-10-11 17:20:44,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-10-11 17:20:44,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-10-11 17:20:44,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-10-11 17:20:44,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-10-11 17:20:44,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-10-11 17:20:44,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-10-11 17:20:44,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-10-11 17:20:44,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-10-11 17:20:44,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-10-11 17:20:44,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-10-11 17:20:44,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-10-11 17:20:44,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-10-11 17:20:44,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-10-11 17:20:44,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-10-11 17:20:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:20:44,931 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:45,007 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-11 17:20:45,007 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:20:45,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:20:45 BasicIcfg [2024-10-11 17:20:45,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:20:45,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:20:45,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:20:45,015 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:20:45,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:31" (3/4) ... [2024-10-11 17:20:45,017 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:20:45,019 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:20:45,019 INFO L158 Benchmark]: Toolchain (without parser) took 14943.46ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 102.3MB in the beginning and 745.5MB in the end (delta: -643.2MB). Peak memory consumption was 625.2MB. Max. memory is 16.1GB. [2024-10-11 17:20:45,019 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:20:45,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.26ms. Allocated memory is still 159.4MB. Free memory was 102.0MB in the beginning and 70.8MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 17:20:45,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.45ms. Allocated memory is still 159.4MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:20:45,020 INFO L158 Benchmark]: Boogie Preprocessor took 31.66ms. Allocated memory is still 159.4MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:20:45,020 INFO L158 Benchmark]: RCFGBuilder took 538.42ms. Allocated memory is still 159.4MB. Free memory was 66.6MB in the beginning and 49.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:20:45,021 INFO L158 Benchmark]: TraceAbstraction took 13664.81ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 49.0MB in the beginning and 745.5MB in the end (delta: -696.6MB). Peak memory consumption was 570.7MB. Max. memory is 16.1GB. [2024-10-11 17:20:45,021 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 1.4GB. Free memory is still 745.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:20:45,022 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.26ms. Allocated memory is still 159.4MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.26ms. Allocated memory is still 159.4MB. Free memory was 102.0MB in the beginning and 70.8MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.45ms. Allocated memory is still 159.4MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.66ms. Allocated memory is still 159.4MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.42ms. Allocated memory is still 159.4MB. Free memory was 66.6MB in the beginning and 49.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13664.81ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 49.0MB in the beginning and 745.5MB in the end (delta: -696.6MB). Peak memory consumption was 570.7MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 1.4GB. Free memory is still 745.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1047]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int *datas; VAL [datas={0:0}] [L1044] 0 int next_j = 0; VAL [datas={0:0}, next_j=0] [L1053] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, next_j=0, threads_total=2] [L1054] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, next_j=0] [L1054] RET 0 assume_abort_if_not(threads_total >= 0) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, next_j=0, threads_total=2, tids={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=0, next_j=0, threads_total=2, tids={-2:0}] [L1057] 0 i++ VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1058] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, datas={-3:0}, i=1, next_j=0, threads_total=2, tids={-2:0}] [L1046] 2 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1046] 1 int j; VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, next_j=0] [L1047] 1 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=0] [L1048] 1 next_j++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] [L1047] 2 j = next_j VAL [\old(arg)={0:0}, arg={0:0}, datas={-3:0}, j=0, next_j=1] Now there is a data race on ~next_j~0 between C: next_j++ [1048] and C: j = next_j [1047] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1058]: 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. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 144 locations, 15 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.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 29 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=7, InterpolantAutomatonStates: 30, 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.3s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, 179 locations, 20 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: 10.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 59 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2143occurred in iteration=9, InterpolantAutomatonStates: 39, 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.0s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 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-10-11 17:20:45,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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