./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/weaver/parallel-simple-equiv.wvr.c --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/weaver/parallel-simple-equiv.wvr.c -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 a4f450f56f6a40f7cfc1a45cb9347f1cca7ce4a1ac8bd0b5be45149fc02486ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:15:55,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:15:55,795 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:15:55,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:15:55,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:15:55,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:15:55,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:15:55,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:15:55,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:15:55,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:15:55,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:15:55,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:15:55,822 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:15:55,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:15:55,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:15:55,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:15:55,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:15:55,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:15:55,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:15:55,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:15:55,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:15:55,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:15:55,825 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:15:55,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:15:55,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:15:55,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:15:55,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:15:55,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:15:55,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:15:55,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:15:55,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:15:55,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:55,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:15:55,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:15:55,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:15:55,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:15:55,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:15:55,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:15:55,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:15:55,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:15:55,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:15:55,829 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 -> a4f450f56f6a40f7cfc1a45cb9347f1cca7ce4a1ac8bd0b5be45149fc02486ed [2024-10-11 17:15:56,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:15:56,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:15:56,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:15:56,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:15:56,069 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:15:56,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c [2024-10-11 17:15:57,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:15:57,749 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:15:57,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c [2024-10-11 17:15:57,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b50dbfe2c/c46b604bfa10415f9bbc2e14d5057a47/FLAG163a40ee6 [2024-10-11 17:15:58,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b50dbfe2c/c46b604bfa10415f9bbc2e14d5057a47 [2024-10-11 17:15:58,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:15:58,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:15:58,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:58,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:15:58,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:15:58,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e7bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58, skipping insertion in model container [2024-10-11 17:15:58,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:15:58,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:58,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:15:58,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:58,444 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:15:58,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58 WrapperNode [2024-10-11 17:15:58,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:58,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:58,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:15:58,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:15:58,454 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:15:58" (1/1) ... [2024-10-11 17:15:58,463 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:15:58" (1/1) ... [2024-10-11 17:15:58,483 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2024-10-11 17:15:58,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:58,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:15:58,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:15:58,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:15:58,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:15:58,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:15:58,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:15:58,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:15:58,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (1/1) ... [2024-10-11 17:15:58,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:58,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:15:58,553 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:15:58,555 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:15:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:15:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:15:58,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:15:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:15:58,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:15:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:15:58,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:15:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:15:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:15:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:15:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:15:58,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:15:58,636 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:15:58,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:15:58,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:15:58,878 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:15:58,878 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:15:58,926 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:15:58,926 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:15:58,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:58 BoogieIcfgContainer [2024-10-11 17:15:58,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:15:58,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:15:58,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:15:58,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:15:58,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:15:58" (1/3) ... [2024-10-11 17:15:58,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c54948b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:58, skipping insertion in model container [2024-10-11 17:15:58,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:58" (2/3) ... [2024-10-11 17:15:58,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c54948b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:58, skipping insertion in model container [2024-10-11 17:15:58,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:58" (3/3) ... [2024-10-11 17:15:58,935 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-simple-equiv.wvr.c [2024-10-11 17:15:58,950 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:15:58,950 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-11 17:15:58,950 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:15:59,011 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:15:59,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 149 transitions, 319 flow [2024-10-11 17:15:59,101 INFO L124 PetriNetUnfolderBase]: 2/146 cut-off events. [2024-10-11 17:15:59,101 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:15:59,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2024-10-11 17:15:59,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 149 transitions, 319 flow [2024-10-11 17:15:59,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 129 transitions, 276 flow [2024-10-11 17:15:59,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:15:59,130 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;@4a47eb64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:15:59,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-10-11 17:15:59,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:15:59,138 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-11 17:15:59,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:15:59,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:59,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:59,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:15:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash -810049564, now seen corresponding path program 1 times [2024-10-11 17:15:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110977594] [2024-10-11 17:15:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:59,320 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:15:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110977594] [2024-10-11 17:15:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110977594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:59,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:59,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144680229] [2024-10-11 17:15:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:59,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 149 [2024-10-11 17:15:59,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 129 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:15:59,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:59,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 149 [2024-10-11 17:15:59,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:59,453 INFO L124 PetriNetUnfolderBase]: 7/148 cut-off events. [2024-10-11 17:15:59,453 INFO L125 PetriNetUnfolderBase]: For 19/25 co-relation queries the response was YES. [2024-10-11 17:15:59,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 148 events. 7/148 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 154 event pairs, 7 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 109. Up to 27 conditions per place. [2024-10-11 17:15:59,455 INFO L140 encePairwiseOnDemand]: 141/149 looper letters, 13 selfloop transitions, 2 changer transitions 1/123 dead transitions. [2024-10-11 17:15:59,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 123 transitions, 294 flow [2024-10-11 17:15:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2024-10-11 17:15:59,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8859060402684564 [2024-10-11 17:15:59,475 INFO L175 Difference]: Start difference. First operand has 138 places, 129 transitions, 276 flow. Second operand 3 states and 396 transitions. [2024-10-11 17:15:59,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 123 transitions, 294 flow [2024-10-11 17:15:59,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 123 transitions, 282 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:15:59,484 INFO L231 Difference]: Finished difference. Result has 129 places, 122 transitions, 254 flow [2024-10-11 17:15:59,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=129, PETRI_TRANSITIONS=122} [2024-10-11 17:15:59,489 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -9 predicate places. [2024-10-11 17:15:59,490 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 122 transitions, 254 flow [2024-10-11 17:15:59,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:15:59,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:59,492 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] [2024-10-11 17:15:59,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:15:59,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:15:59,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 578354275, now seen corresponding path program 1 times [2024-10-11 17:15:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447566820] [2024-10-11 17:15:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:59,551 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:15:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:59,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447566820] [2024-10-11 17:15:59,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447566820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:59,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162337157] [2024-10-11 17:15:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:59,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:59,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:59,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 149 [2024-10-11 17:15:59,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 122 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:15:59,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:59,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 149 [2024-10-11 17:15:59,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:59,692 INFO L124 PetriNetUnfolderBase]: 39/234 cut-off events. [2024-10-11 17:15:59,692 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-11 17:15:59,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 234 events. 39/234 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 618 event pairs, 39 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 307. Up to 87 conditions per place. [2024-10-11 17:15:59,694 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 17 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-10-11 17:15:59,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 121 transitions, 290 flow [2024-10-11 17:15:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-10-11 17:15:59,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8568232662192393 [2024-10-11 17:15:59,698 INFO L175 Difference]: Start difference. First operand has 129 places, 122 transitions, 254 flow. Second operand 3 states and 383 transitions. [2024-10-11 17:15:59,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 121 transitions, 290 flow [2024-10-11 17:15:59,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 121 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:59,703 INFO L231 Difference]: Finished difference. Result has 127 places, 121 transitions, 252 flow [2024-10-11 17:15:59,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=121} [2024-10-11 17:15:59,704 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -11 predicate places. [2024-10-11 17:15:59,705 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 121 transitions, 252 flow [2024-10-11 17:15:59,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:15:59,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:59,709 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] [2024-10-11 17:15:59,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:15:59,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:15:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 74609380, now seen corresponding path program 1 times [2024-10-11 17:15:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558775227] [2024-10-11 17:15:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:59,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:59,763 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:15:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:59,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558775227] [2024-10-11 17:15:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558775227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:59,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934832619] [2024-10-11 17:15:59,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:59,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:59,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 149 [2024-10-11 17:15:59,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:15:59,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:59,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 149 [2024-10-11 17:15:59,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:59,854 INFO L124 PetriNetUnfolderBase]: 39/233 cut-off events. [2024-10-11 17:15:59,854 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-11 17:15:59,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 233 events. 39/233 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 644 event pairs, 39 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 297. Up to 85 conditions per place. [2024-10-11 17:15:59,857 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 15 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-10-11 17:15:59,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 120 transitions, 284 flow [2024-10-11 17:15:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2024-10-11 17:15:59,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8657718120805369 [2024-10-11 17:15:59,860 INFO L175 Difference]: Start difference. First operand has 127 places, 121 transitions, 252 flow. Second operand 3 states and 387 transitions. [2024-10-11 17:15:59,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 120 transitions, 284 flow [2024-10-11 17:15:59,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:59,863 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 250 flow [2024-10-11 17:15:59,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2024-10-11 17:15:59,865 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -12 predicate places. [2024-10-11 17:15:59,865 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 250 flow [2024-10-11 17:15:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:15:59,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:59,866 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:15:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:15:59,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:15:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -822671195, now seen corresponding path program 1 times [2024-10-11 17:15:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:59,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91421283] [2024-10-11 17:15:59,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:59,906 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:15:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:59,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91421283] [2024-10-11 17:15:59,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91421283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:59,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:59,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998029435] [2024-10-11 17:15:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:59,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:59,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:59,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 149 [2024-10-11 17:15:59,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 250 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:15:59,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:59,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 149 [2024-10-11 17:15:59,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:59,952 INFO L124 PetriNetUnfolderBase]: 7/143 cut-off events. [2024-10-11 17:15:59,952 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2024-10-11 17:15:59,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 143 events. 7/143 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 1 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 140. Up to 20 conditions per place. [2024-10-11 17:15:59,953 INFO L140 encePairwiseOnDemand]: 143/149 looper letters, 13 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2024-10-11 17:15:59,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 290 flow [2024-10-11 17:15:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2024-10-11 17:15:59,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8948545861297539 [2024-10-11 17:15:59,956 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 250 flow. Second operand 3 states and 400 transitions. [2024-10-11 17:15:59,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 290 flow [2024-10-11 17:15:59,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:59,960 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 262 flow [2024-10-11 17:15:59,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2024-10-11 17:15:59,961 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -13 predicate places. [2024-10-11 17:15:59,961 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 262 flow [2024-10-11 17:15:59,961 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:15:59,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:59,961 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] [2024-10-11 17:15:59,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:15:59,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:15:59,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -313028534, now seen corresponding path program 1 times [2024-10-11 17:15:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144285297] [2024-10-11 17:15:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,010 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:16:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144285297] [2024-10-11 17:16:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144285297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778910872] [2024-10-11 17:16:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2024-10-11 17:16:00,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:16:00,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2024-10-11 17:16:00,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,096 INFO L124 PetriNetUnfolderBase]: 55/411 cut-off events. [2024-10-11 17:16:00,097 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-11 17:16:00,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 411 events. 55/411 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1696 event pairs, 33 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 283. Up to 83 conditions per place. [2024-10-11 17:16:00,102 INFO L140 encePairwiseOnDemand]: 140/149 looper letters, 20 selfloop transitions, 4 changer transitions 4/122 dead transitions. [2024-10-11 17:16:00,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 122 transitions, 330 flow [2024-10-11 17:16:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-10-11 17:16:00,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8568232662192393 [2024-10-11 17:16:00,103 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 262 flow. Second operand 3 states and 383 transitions. [2024-10-11 17:16:00,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 122 transitions, 330 flow [2024-10-11 17:16:00,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:00,107 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 247 flow [2024-10-11 17:16:00,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-10-11 17:16:00,108 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -16 predicate places. [2024-10-11 17:16:00,109 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 247 flow [2024-10-11 17:16:00,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:16:00,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:00,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:00,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:16:00,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:16:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1466078270, now seen corresponding path program 1 times [2024-10-11 17:16:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:00,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319680727] [2024-10-11 17:16:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,186 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:16:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319680727] [2024-10-11 17:16:00,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319680727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590477977] [2024-10-11 17:16:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 149 [2024-10-11 17:16:00,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:16:00,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 149 [2024-10-11 17:16:00,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,284 INFO L124 PetriNetUnfolderBase]: 63/390 cut-off events. [2024-10-11 17:16:00,285 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-11 17:16:00,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 390 events. 63/390 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1570 event pairs, 40 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 312. Up to 97 conditions per place. [2024-10-11 17:16:00,288 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 21 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2024-10-11 17:16:00,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 313 flow [2024-10-11 17:16:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-11 17:16:00,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.883668903803132 [2024-10-11 17:16:00,289 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 247 flow. Second operand 3 states and 395 transitions. [2024-10-11 17:16:00,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 313 flow [2024-10-11 17:16:00,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:00,293 INFO L231 Difference]: Finished difference. Result has 117 places, 111 transitions, 241 flow [2024-10-11 17:16:00,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=117, PETRI_TRANSITIONS=111} [2024-10-11 17:16:00,295 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -21 predicate places. [2024-10-11 17:16:00,295 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 241 flow [2024-10-11 17:16:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:16:00,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:00,296 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:16:00,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:16:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 415697836, now seen corresponding path program 1 times [2024-10-11 17:16:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698320408] [2024-10-11 17:16:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,350 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:16:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698320408] [2024-10-11 17:16:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698320408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537664739] [2024-10-11 17:16:00,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 149 [2024-10-11 17:16:00,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:16:00,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 149 [2024-10-11 17:16:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,421 INFO L124 PetriNetUnfolderBase]: 55/340 cut-off events. [2024-10-11 17:16:00,422 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-11 17:16:00,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 340 events. 55/340 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1238 event pairs, 19 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 345. Up to 60 conditions per place. [2024-10-11 17:16:00,425 INFO L140 encePairwiseOnDemand]: 144/149 looper letters, 19 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-10-11 17:16:00,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 303 flow [2024-10-11 17:16:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-11 17:16:00,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.883668903803132 [2024-10-11 17:16:00,427 INFO L175 Difference]: Start difference. First operand has 117 places, 111 transitions, 241 flow. Second operand 3 states and 395 transitions. [2024-10-11 17:16:00,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 303 flow [2024-10-11 17:16:00,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:00,428 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 239 flow [2024-10-11 17:16:00,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2024-10-11 17:16:00,429 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -23 predicate places. [2024-10-11 17:16:00,430 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 239 flow [2024-10-11 17:16:00,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:16:00,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:00,431 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:16:00,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:16:00,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash 41639087, now seen corresponding path program 1 times [2024-10-11 17:16:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893882538] [2024-10-11 17:16:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,487 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:16:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893882538] [2024-10-11 17:16:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893882538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387795862] [2024-10-11 17:16:00,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 149 [2024-10-11 17:16:00,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:00,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 149 [2024-10-11 17:16:00,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,560 INFO L124 PetriNetUnfolderBase]: 63/341 cut-off events. [2024-10-11 17:16:00,560 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-10-11 17:16:00,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 341 events. 63/341 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1257 event pairs, 40 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 255. Up to 98 conditions per place. [2024-10-11 17:16:00,562 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 22 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-10-11 17:16:00,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 307 flow [2024-10-11 17:16:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-10-11 17:16:00,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.87248322147651 [2024-10-11 17:16:00,564 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 239 flow. Second operand 3 states and 390 transitions. [2024-10-11 17:16:00,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 307 flow [2024-10-11 17:16:00,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:00,567 INFO L231 Difference]: Finished difference. Result has 114 places, 108 transitions, 235 flow [2024-10-11 17:16:00,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=112, 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=235, PETRI_PLACES=114, PETRI_TRANSITIONS=108} [2024-10-11 17:16:00,568 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -24 predicate places. [2024-10-11 17:16:00,568 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 108 transitions, 235 flow [2024-10-11 17:16:00,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:00,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:00,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:16:00,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:16:00,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash -573758521, now seen corresponding path program 1 times [2024-10-11 17:16:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191233487] [2024-10-11 17:16:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,622 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:16:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191233487] [2024-10-11 17:16:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191233487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306490810] [2024-10-11 17:16:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 149 [2024-10-11 17:16:00,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 108 transitions, 235 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:16:00,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 149 [2024-10-11 17:16:00,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,705 INFO L124 PetriNetUnfolderBase]: 63/306 cut-off events. [2024-10-11 17:16:00,706 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-11 17:16:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 306 events. 63/306 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1045 event pairs, 40 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 282. Up to 97 conditions per place. [2024-10-11 17:16:00,707 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 21 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-10-11 17:16:00,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 301 flow [2024-10-11 17:16:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-11 17:16:00,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.883668903803132 [2024-10-11 17:16:00,709 INFO L175 Difference]: Start difference. First operand has 114 places, 108 transitions, 235 flow. Second operand 3 states and 395 transitions. [2024-10-11 17:16:00,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 301 flow [2024-10-11 17:16:00,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:00,711 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 233 flow [2024-10-11 17:16:00,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-10-11 17:16:00,713 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -25 predicate places. [2024-10-11 17:16:00,713 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 233 flow [2024-10-11 17:16:00,713 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:16:00,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:00,714 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:00,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:16:00,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2024-10-11 17:16:00,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2007993768, now seen corresponding path program 1 times [2024-10-11 17:16:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850184293] [2024-10-11 17:16:00,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:00,761 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:16:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850184293] [2024-10-11 17:16:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850184293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272835801] [2024-10-11 17:16:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:00,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 149 [2024-10-11 17:16:00,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:16:00,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:00,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 149 [2024-10-11 17:16:00,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:00,829 INFO L124 PetriNetUnfolderBase]: 63/271 cut-off events. [2024-10-11 17:16:00,829 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-11 17:16:00,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 271 events. 63/271 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 844 event pairs, 40 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 283. Up to 98 conditions per place. [2024-10-11 17:16:00,830 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 0 selfloop transitions, 0 changer transitions 112/112 dead transitions. [2024-10-11 17:16:00,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 301 flow [2024-10-11 17:16:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-10-11 17:16:00,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.87248322147651 [2024-10-11 17:16:00,832 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 233 flow. Second operand 3 states and 390 transitions. [2024-10-11 17:16:00,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 301 flow [2024-10-11 17:16:00,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:00,834 INFO L231 Difference]: Finished difference. Result has 112 places, 0 transitions, 0 flow [2024-10-11 17:16:00,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=112, PETRI_TRANSITIONS=0} [2024-10-11 17:16:00,835 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -26 predicate places. [2024-10-11 17:16:00,835 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 0 transitions, 0 flow [2024-10-11 17:16:00,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:16:00,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (33 of 34 remaining) [2024-10-11 17:16:00,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2024-10-11 17:16:00,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2024-10-11 17:16:00,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2024-10-11 17:16:00,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2024-10-11 17:16:00,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2024-10-11 17:16:00,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (27 of 34 remaining) [2024-10-11 17:16:00,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2024-10-11 17:16:00,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2024-10-11 17:16:00,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2024-10-11 17:16:00,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2024-10-11 17:16:00,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (22 of 34 remaining) [2024-10-11 17:16:00,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2024-10-11 17:16:00,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2024-10-11 17:16:00,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2024-10-11 17:16:00,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2024-10-11 17:16:00,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2024-10-11 17:16:00,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2024-10-11 17:16:00,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2024-10-11 17:16:00,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 34 remaining) [2024-10-11 17:16:00,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 34 remaining) [2024-10-11 17:16:00,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 34 remaining) [2024-10-11 17:16:00,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 34 remaining) [2024-10-11 17:16:00,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2024-10-11 17:16:00,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2024-10-11 17:16:00,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2024-10-11 17:16:00,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2024-10-11 17:16:00,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2024-10-11 17:16:00,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2024-10-11 17:16:00,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2024-10-11 17:16:00,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2024-10-11 17:16:00,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2024-10-11 17:16:00,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2024-10-11 17:16:00,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 34 remaining) [2024-10-11 17:16:00,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:16:00,845 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:00,854 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:16:00,858 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:16:00,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:16:00 BasicIcfg [2024-10-11 17:16:00,863 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:16:00,864 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:16:00,864 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:16:00,864 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:16:00,864 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:58" (3/4) ... [2024-10-11 17:16:00,866 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:16:00,868 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:16:00,868 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:16:00,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:16:00,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 17:16:00,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:16:00,873 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:16:00,873 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:16:00,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:16:00,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:16:00,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:16:00,974 INFO L158 Benchmark]: Toolchain (without parser) took 2823.18ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 102.6MB in the beginning and 160.6MB in the end (delta: -58.0MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-10-11 17:16:00,975 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:16:00,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.53ms. Allocated memory is still 169.9MB. Free memory was 102.4MB in the beginning and 89.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:16:00,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.69ms. Allocated memory is still 169.9MB. Free memory was 89.6MB in the beginning and 87.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:16:00,975 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 169.9MB. Free memory was 87.9MB in the beginning and 86.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:16:00,976 INFO L158 Benchmark]: RCFGBuilder took 416.46ms. Allocated memory is still 169.9MB. Free memory was 86.5MB in the beginning and 126.2MB in the end (delta: -39.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 17:16:00,976 INFO L158 Benchmark]: TraceAbstraction took 1935.10ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 125.6MB in the beginning and 165.8MB in the end (delta: -40.3MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-11 17:16:00,976 INFO L158 Benchmark]: Witness Printer took 110.37ms. Allocated memory is still 228.6MB. Free memory was 165.8MB in the beginning and 160.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:16:00,978 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.10ms. Allocated memory is still 109.1MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.53ms. Allocated memory is still 169.9MB. Free memory was 102.4MB in the beginning and 89.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.69ms. Allocated memory is still 169.9MB. Free memory was 89.6MB in the beginning and 87.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 169.9MB. Free memory was 87.9MB in the beginning and 86.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 416.46ms. Allocated memory is still 169.9MB. Free memory was 86.5MB in the beginning and 126.2MB in the end (delta: -39.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1935.10ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 125.6MB in the beginning and 165.8MB in the end (delta: -40.3MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 110.37ms. Allocated memory is still 228.6MB. Free memory was 165.8MB in the beginning and 160.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 205 locations, 34 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: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 66 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=0, 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, 0.4s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 529 ConstructedInterpolants, 0 QuantifiedInterpolants, 549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:16:01,007 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 Result: TRUE