./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:01:07,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:01:07,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:01:07,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:01:07,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:01:07,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:01:07,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:01:07,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:01:07,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:01:07,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:01:07,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:01:07,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:01:07,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:01:07,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:01:07,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:01:07,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:01:07,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:01:07,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:01:07,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:01:07,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:01:07,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:01:07,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:01:07,272 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:01:07,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:01:07,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:01:07,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:01:07,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:01:07,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:01:07,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:01:07,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:01:07,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:01:07,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:07,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:01:07,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:01:07,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:01:07,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:01:07,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:01:07,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:01:07,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:01:07,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:01:07,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:01:07,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2024-11-09 07:01:07,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:01:07,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:01:07,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:01:07,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:01:07,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:01:07,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2024-11-09 07:01:09,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:01:09,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:01:09,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2024-11-09 07:01:09,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3c470b7/9511f4683a4e45eead801acf8cafb84f/FLAG5b2515fde [2024-11-09 07:01:09,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3c470b7/9511f4683a4e45eead801acf8cafb84f [2024-11-09 07:01:09,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:01:09,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:01:09,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:09,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:01:09,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:01:09,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ace4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09, skipping insertion in model container [2024-11-09 07:01:09,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:01:09,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:09,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:01:09,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:09,675 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:01:09,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09 WrapperNode [2024-11-09 07:01:09,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:09,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:09,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:01:09,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:01:09,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,738 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 417 [2024-11-09 07:01:09,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:09,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:01:09,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:01:09,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:01:09,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:01:09,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:01:09,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:01:09,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:01:09,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (1/1) ... [2024-11-09 07:01:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:09,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:01:09,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:01:09,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:01:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:01:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:01:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:01:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:01:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:01:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:01:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:01:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 07:01:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 07:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:01:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:01:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:01:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:01:09,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:01:09,891 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:01:10,013 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:01:10,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:01:10,751 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:01:10,751 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:01:11,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:01:11,130 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:01:11,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:11 BoogieIcfgContainer [2024-11-09 07:01:11,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:01:11,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:01:11,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:01:11,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:01:11,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:01:09" (1/3) ... [2024-11-09 07:01:11,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407a5c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:11, skipping insertion in model container [2024-11-09 07:01:11,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:09" (2/3) ... [2024-11-09 07:01:11,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407a5c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:11, skipping insertion in model container [2024-11-09 07:01:11,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:11" (3/3) ... [2024-11-09 07:01:11,145 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2024-11-09 07:01:11,165 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:01:11,165 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-11-09 07:01:11,165 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:01:11,272 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-11-09 07:01:11,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 308 transitions, 656 flow [2024-11-09 07:01:11,456 INFO L124 PetriNetUnfolderBase]: 14/300 cut-off events. [2024-11-09 07:01:11,456 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:01:11,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 300 events. 14/300 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 437 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 254. Up to 3 conditions per place. [2024-11-09 07:01:11,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 308 transitions, 656 flow [2024-11-09 07:01:11,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 283 transitions, 596 flow [2024-11-09 07:01:11,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:01:11,499 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;@57e6438c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:01:11,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 106 error locations. [2024-11-09 07:01:11,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:01:11,507 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-09 07:01:11,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:01:11,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:11,508 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] [2024-11-09 07:01:11,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:11,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -568796903, now seen corresponding path program 1 times [2024-11-09 07:01:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957165688] [2024-11-09 07:01:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:11,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957165688] [2024-11-09 07:01:11,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957165688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081722453] [2024-11-09 07:01:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:11,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 310 [2024-11-09 07:01:11,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:11,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:11,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 310 [2024-11-09 07:01:11,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:12,121 INFO L124 PetriNetUnfolderBase]: 266/976 cut-off events. [2024-11-09 07:01:12,121 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-09 07:01:12,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 976 events. 266/976 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5082 event pairs, 141 based on Foata normal form. 98/959 useless extension candidates. Maximal degree in co-relation 1305. Up to 391 conditions per place. [2024-11-09 07:01:12,136 INFO L140 encePairwiseOnDemand]: 257/310 looper letters, 26 selfloop transitions, 2 changer transitions 3/232 dead transitions. [2024-11-09 07:01:12,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 232 transitions, 550 flow [2024-11-09 07:01:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-09 07:01:12,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8075268817204301 [2024-11-09 07:01:12,159 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 596 flow. Second operand 3 states and 751 transitions. [2024-11-09 07:01:12,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 232 transitions, 550 flow [2024-11-09 07:01:12,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 232 transitions, 530 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 07:01:12,172 INFO L231 Difference]: Finished difference. Result has 233 places, 229 transitions, 472 flow [2024-11-09 07:01:12,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=233, PETRI_TRANSITIONS=229} [2024-11-09 07:01:12,179 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -50 predicate places. [2024-11-09 07:01:12,180 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 229 transitions, 472 flow [2024-11-09 07:01:12,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:12,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:12,181 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-11-09 07:01:12,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:01:12,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:12,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash -776775689, now seen corresponding path program 1 times [2024-11-09 07:01:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:12,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082294050] [2024-11-09 07:01:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082294050] [2024-11-09 07:01:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082294050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289839029] [2024-11-09 07:01:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:12,301 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 310 [2024-11-09 07:01:12,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 229 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:12,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:12,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 310 [2024-11-09 07:01:12,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:12,507 INFO L124 PetriNetUnfolderBase]: 266/972 cut-off events. [2024-11-09 07:01:12,507 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:12,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 972 events. 266/972 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5098 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1379. Up to 390 conditions per place. [2024-11-09 07:01:12,516 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 25 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-11-09 07:01:12,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 228 transitions, 524 flow [2024-11-09 07:01:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-11-09 07:01:12,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7559139784946236 [2024-11-09 07:01:12,521 INFO L175 Difference]: Start difference. First operand has 233 places, 229 transitions, 472 flow. Second operand 3 states and 703 transitions. [2024-11-09 07:01:12,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 228 transitions, 524 flow [2024-11-09 07:01:12,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 228 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:12,529 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 470 flow [2024-11-09 07:01:12,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-11-09 07:01:12,532 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -54 predicate places. [2024-11-09 07:01:12,532 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 470 flow [2024-11-09 07:01:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:12,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:12,533 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] [2024-11-09 07:01:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:01:12,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:12,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1657426031, now seen corresponding path program 1 times [2024-11-09 07:01:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147430193] [2024-11-09 07:01:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147430193] [2024-11-09 07:01:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147430193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:12,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:12,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:12,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302431100] [2024-11-09 07:01:12,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:12,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:12,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:12,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:12,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:12,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:12,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:12,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:12,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:12,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:12,831 INFO L124 PetriNetUnfolderBase]: 266/971 cut-off events. [2024-11-09 07:01:12,831 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:12,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 971 events. 266/971 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5074 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1369. Up to 389 conditions per place. [2024-11-09 07:01:12,840 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 24 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-11-09 07:01:12,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 227 transitions, 520 flow [2024-11-09 07:01:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-11-09 07:01:12,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7580645161290323 [2024-11-09 07:01:12,843 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 470 flow. Second operand 3 states and 705 transitions. [2024-11-09 07:01:12,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 227 transitions, 520 flow [2024-11-09 07:01:12,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 227 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:12,848 INFO L231 Difference]: Finished difference. Result has 228 places, 227 transitions, 468 flow [2024-11-09 07:01:12,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2024-11-09 07:01:12,849 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -55 predicate places. [2024-11-09 07:01:12,849 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 468 flow [2024-11-09 07:01:12,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:12,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:12,850 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] [2024-11-09 07:01:12,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:01:12,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2087087841, now seen corresponding path program 1 times [2024-11-09 07:01:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881846828] [2024-11-09 07:01:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:12,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881846828] [2024-11-09 07:01:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881846828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613590783] [2024-11-09 07:01:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:12,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:12,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:12,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:12,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:12,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:12,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:13,140 INFO L124 PetriNetUnfolderBase]: 266/970 cut-off events. [2024-11-09 07:01:13,140 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:13,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 970 events. 266/970 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5076 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1360. Up to 389 conditions per place. [2024-11-09 07:01:13,146 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 24 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-11-09 07:01:13,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 518 flow [2024-11-09 07:01:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-11-09 07:01:13,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7580645161290323 [2024-11-09 07:01:13,149 INFO L175 Difference]: Start difference. First operand has 228 places, 227 transitions, 468 flow. Second operand 3 states and 705 transitions. [2024-11-09 07:01:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 518 flow [2024-11-09 07:01:13,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:13,153 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 466 flow [2024-11-09 07:01:13,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2024-11-09 07:01:13,154 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -56 predicate places. [2024-11-09 07:01:13,154 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 466 flow [2024-11-09 07:01:13,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:13,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:13,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:01:13,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2122916661, now seen corresponding path program 1 times [2024-11-09 07:01:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792874024] [2024-11-09 07:01:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:13,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792874024] [2024-11-09 07:01:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792874024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768947207] [2024-11-09 07:01:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:13,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:13,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:13,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:13,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:13,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:13,412 INFO L124 PetriNetUnfolderBase]: 266/969 cut-off events. [2024-11-09 07:01:13,413 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:13,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 969 events. 266/969 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5088 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1351. Up to 389 conditions per place. [2024-11-09 07:01:13,421 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 24 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-11-09 07:01:13,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 225 transitions, 516 flow [2024-11-09 07:01:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-11-09 07:01:13,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7580645161290323 [2024-11-09 07:01:13,424 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 466 flow. Second operand 3 states and 705 transitions. [2024-11-09 07:01:13,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 225 transitions, 516 flow [2024-11-09 07:01:13,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 225 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:13,428 INFO L231 Difference]: Finished difference. Result has 226 places, 225 transitions, 464 flow [2024-11-09 07:01:13,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=226, PETRI_TRANSITIONS=225} [2024-11-09 07:01:13,429 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -57 predicate places. [2024-11-09 07:01:13,429 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 225 transitions, 464 flow [2024-11-09 07:01:13,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:13,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:13,430 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] [2024-11-09 07:01:13,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:01:13,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:13,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1428006771, now seen corresponding path program 1 times [2024-11-09 07:01:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:13,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256041859] [2024-11-09 07:01:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:13,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256041859] [2024-11-09 07:01:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256041859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081171733] [2024-11-09 07:01:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:13,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 310 [2024-11-09 07:01:13,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 225 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:13,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:13,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 310 [2024-11-09 07:01:13,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:13,731 INFO L124 PetriNetUnfolderBase]: 266/968 cut-off events. [2024-11-09 07:01:13,731 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:13,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 968 events. 266/968 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5036 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1343. Up to 390 conditions per place. [2024-11-09 07:01:13,739 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 25 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-11-09 07:01:13,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 224 transitions, 516 flow [2024-11-09 07:01:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-11-09 07:01:13,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7559139784946236 [2024-11-09 07:01:13,743 INFO L175 Difference]: Start difference. First operand has 226 places, 225 transitions, 464 flow. Second operand 3 states and 703 transitions. [2024-11-09 07:01:13,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 224 transitions, 516 flow [2024-11-09 07:01:13,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 224 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:13,748 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 462 flow [2024-11-09 07:01:13,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2024-11-09 07:01:13,749 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -58 predicate places. [2024-11-09 07:01:13,750 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 462 flow [2024-11-09 07:01:13,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:13,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:13,751 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] [2024-11-09 07:01:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:01:13,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash -391891637, now seen corresponding path program 1 times [2024-11-09 07:01:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:13,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148185290] [2024-11-09 07:01:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:13,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148185290] [2024-11-09 07:01:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148185290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312637513] [2024-11-09 07:01:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:13,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:13,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:13,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:13,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:13,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:13,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:13,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:13,986 INFO L124 PetriNetUnfolderBase]: 266/967 cut-off events. [2024-11-09 07:01:13,986 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:13,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 967 events. 266/967 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5046 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1333. Up to 389 conditions per place. [2024-11-09 07:01:13,994 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 24 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-11-09 07:01:13,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 223 transitions, 512 flow [2024-11-09 07:01:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-11-09 07:01:13,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7580645161290323 [2024-11-09 07:01:13,997 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 462 flow. Second operand 3 states and 705 transitions. [2024-11-09 07:01:13,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 223 transitions, 512 flow [2024-11-09 07:01:13,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:14,001 INFO L231 Difference]: Finished difference. Result has 224 places, 223 transitions, 460 flow [2024-11-09 07:01:14,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=224, PETRI_TRANSITIONS=223} [2024-11-09 07:01:14,003 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -59 predicate places. [2024-11-09 07:01:14,003 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 223 transitions, 460 flow [2024-11-09 07:01:14,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:14,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:14,004 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] [2024-11-09 07:01:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:01:14,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash -317919819, now seen corresponding path program 1 times [2024-11-09 07:01:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714369830] [2024-11-09 07:01:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714369830] [2024-11-09 07:01:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714369830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728276454] [2024-11-09 07:01:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:14,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:14,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:14,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 223 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:14,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:14,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:14,229 INFO L124 PetriNetUnfolderBase]: 266/966 cut-off events. [2024-11-09 07:01:14,230 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 966 events. 266/966 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5054 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1324. Up to 389 conditions per place. [2024-11-09 07:01:14,235 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 24 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-09 07:01:14,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 222 transitions, 510 flow [2024-11-09 07:01:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-11-09 07:01:14,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7580645161290323 [2024-11-09 07:01:14,238 INFO L175 Difference]: Start difference. First operand has 224 places, 223 transitions, 460 flow. Second operand 3 states and 705 transitions. [2024-11-09 07:01:14,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 222 transitions, 510 flow [2024-11-09 07:01:14,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:14,242 INFO L231 Difference]: Finished difference. Result has 223 places, 222 transitions, 458 flow [2024-11-09 07:01:14,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=223, PETRI_TRANSITIONS=222} [2024-11-09 07:01:14,243 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -60 predicate places. [2024-11-09 07:01:14,244 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 222 transitions, 458 flow [2024-11-09 07:01:14,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:14,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:14,245 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] [2024-11-09 07:01:14,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:01:14,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:14,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1623525706, now seen corresponding path program 1 times [2024-11-09 07:01:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221142273] [2024-11-09 07:01:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:14,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221142273] [2024-11-09 07:01:14,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221142273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921435477] [2024-11-09 07:01:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:14,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:14,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:14,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 222 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:14,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:14,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:14,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:14,434 INFO L124 PetriNetUnfolderBase]: 266/964 cut-off events. [2024-11-09 07:01:14,434 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 964 events. 266/964 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5046 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1314. Up to 389 conditions per place. [2024-11-09 07:01:14,442 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 25 selfloop transitions, 1 changer transitions 0/220 dead transitions. [2024-11-09 07:01:14,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 506 flow [2024-11-09 07:01:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2024-11-09 07:01:14,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7591397849462366 [2024-11-09 07:01:14,445 INFO L175 Difference]: Start difference. First operand has 223 places, 222 transitions, 458 flow. Second operand 3 states and 706 transitions. [2024-11-09 07:01:14,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 506 flow [2024-11-09 07:01:14,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 220 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:14,450 INFO L231 Difference]: Finished difference. Result has 221 places, 220 transitions, 452 flow [2024-11-09 07:01:14,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=221, PETRI_TRANSITIONS=220} [2024-11-09 07:01:14,451 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -62 predicate places. [2024-11-09 07:01:14,451 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 220 transitions, 452 flow [2024-11-09 07:01:14,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:14,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:14,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:14,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:01:14,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:14,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:14,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1723248541, now seen corresponding path program 1 times [2024-11-09 07:01:14,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363138260] [2024-11-09 07:01:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363138260] [2024-11-09 07:01:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363138260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:15,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:01:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064006021] [2024-11-09 07:01:15,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:15,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:01:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:01:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:01:15,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 310 [2024-11-09 07:01:15,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 220 transitions, 452 flow. Second operand has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:15,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 310 [2024-11-09 07:01:15,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:15,307 INFO L124 PetriNetUnfolderBase]: 266/963 cut-off events. [2024-11-09 07:01:15,308 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:15,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 963 events. 266/963 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5067 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1321. Up to 394 conditions per place. [2024-11-09 07:01:15,315 INFO L140 encePairwiseOnDemand]: 304/310 looper letters, 29 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2024-11-09 07:01:15,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 518 flow [2024-11-09 07:01:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:01:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:01:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1349 transitions. [2024-11-09 07:01:15,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.725268817204301 [2024-11-09 07:01:15,319 INFO L175 Difference]: Start difference. First operand has 221 places, 220 transitions, 452 flow. Second operand 6 states and 1349 transitions. [2024-11-09 07:01:15,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 518 flow [2024-11-09 07:01:15,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 219 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:15,323 INFO L231 Difference]: Finished difference. Result has 224 places, 219 transitions, 459 flow [2024-11-09 07:01:15,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=224, PETRI_TRANSITIONS=219} [2024-11-09 07:01:15,325 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -59 predicate places. [2024-11-09 07:01:15,325 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 219 transitions, 459 flow [2024-11-09 07:01:15,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:15,327 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:15,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:01:15,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash -483935705, now seen corresponding path program 1 times [2024-11-09 07:01:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861992098] [2024-11-09 07:01:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861992098] [2024-11-09 07:01:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861992098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:15,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632284373] [2024-11-09 07:01:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:15,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:15,384 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 310 [2024-11-09 07:01:15,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 219 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:15,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 310 [2024-11-09 07:01:15,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:15,547 INFO L124 PetriNetUnfolderBase]: 266/962 cut-off events. [2024-11-09 07:01:15,547 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:15,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 962 events. 266/962 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5044 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1387. Up to 389 conditions per place. [2024-11-09 07:01:15,554 INFO L140 encePairwiseOnDemand]: 307/310 looper letters, 24 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2024-11-09 07:01:15,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 218 transitions, 509 flow [2024-11-09 07:01:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2024-11-09 07:01:15,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7580645161290323 [2024-11-09 07:01:15,557 INFO L175 Difference]: Start difference. First operand has 224 places, 219 transitions, 459 flow. Second operand 3 states and 705 transitions. [2024-11-09 07:01:15,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 218 transitions, 509 flow [2024-11-09 07:01:15,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 218 transitions, 499 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:01:15,563 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 451 flow [2024-11-09 07:01:15,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2024-11-09 07:01:15,565 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -63 predicate places. [2024-11-09 07:01:15,565 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 451 flow [2024-11-09 07:01:15,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:15,566 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:15,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:01:15,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:15,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1265784760, now seen corresponding path program 1 times [2024-11-09 07:01:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910982863] [2024-11-09 07:01:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:15,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910982863] [2024-11-09 07:01:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910982863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:15,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115627436] [2024-11-09 07:01:15,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:15,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 310 [2024-11-09 07:01:15,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:15,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 310 [2024-11-09 07:01:15,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:15,789 INFO L124 PetriNetUnfolderBase]: 266/961 cut-off events. [2024-11-09 07:01:15,790 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1399 conditions, 961 events. 266/961 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5069 event pairs, 141 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1310. Up to 387 conditions per place. [2024-11-09 07:01:15,797 INFO L140 encePairwiseOnDemand]: 308/310 looper letters, 23 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2024-11-09 07:01:15,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 497 flow [2024-11-09 07:01:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2024-11-09 07:01:15,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7655913978494624 [2024-11-09 07:01:15,800 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 451 flow. Second operand 3 states and 712 transitions. [2024-11-09 07:01:15,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 497 flow [2024-11-09 07:01:15,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 217 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:15,804 INFO L231 Difference]: Finished difference. Result has 219 places, 217 transitions, 447 flow [2024-11-09 07:01:15,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=219, PETRI_TRANSITIONS=217} [2024-11-09 07:01:15,805 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -64 predicate places. [2024-11-09 07:01:15,805 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 217 transitions, 447 flow [2024-11-09 07:01:15,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:15,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:01:15,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2024-11-09 07:01:15,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 289924476, now seen corresponding path program 1 times [2024-11-09 07:01:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540421757] [2024-11-09 07:01:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540421757] [2024-11-09 07:01:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540421757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794366344] [2024-11-09 07:01:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:15,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:15,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 310 [2024-11-09 07:01:15,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 217 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:15,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:15,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 310 [2024-11-09 07:01:15,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:16,011 INFO L124 PetriNetUnfolderBase]: 266/960 cut-off events. [2024-11-09 07:01:16,011 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 07:01:16,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 960 events. 266/960 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5069 event pairs, 141 based on Foata normal form. 1/861 useless extension candidates. Maximal degree in co-relation 1388. Up to 387 conditions per place. [2024-11-09 07:01:16,016 INFO L140 encePairwiseOnDemand]: 308/310 looper letters, 0 selfloop transitions, 0 changer transitions 216/216 dead transitions. [2024-11-09 07:01:16,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 491 flow [2024-11-09 07:01:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-11-09 07:01:16,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7645161290322581 [2024-11-09 07:01:16,018 INFO L175 Difference]: Start difference. First operand has 219 places, 217 transitions, 447 flow. Second operand 3 states and 711 transitions. [2024-11-09 07:01:16,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 491 flow [2024-11-09 07:01:16,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:16,021 INFO L231 Difference]: Finished difference. Result has 219 places, 0 transitions, 0 flow [2024-11-09 07:01:16,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=219, PETRI_TRANSITIONS=0} [2024-11-09 07:01:16,022 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -64 predicate places. [2024-11-09 07:01:16,022 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 0 transitions, 0 flow [2024-11-09 07:01:16,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:01:16,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (105 of 106 remaining) [2024-11-09 07:01:16,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (104 of 106 remaining) [2024-11-09 07:01:16,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (103 of 106 remaining) [2024-11-09 07:01:16,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (101 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (100 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (99 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (98 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (97 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (96 of 106 remaining) [2024-11-09 07:01:16,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (95 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (94 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (93 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (92 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (91 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (90 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (89 of 106 remaining) [2024-11-09 07:01:16,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (88 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (87 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (85 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (83 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (82 of 106 remaining) [2024-11-09 07:01:16,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (81 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (80 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (79 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (78 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (77 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (76 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (75 of 106 remaining) [2024-11-09 07:01:16,030 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (74 of 106 remaining) [2024-11-09 07:01:16,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (73 of 106 remaining) [2024-11-09 07:01:16,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (72 of 106 remaining) [2024-11-09 07:01:16,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (71 of 106 remaining) [2024-11-09 07:01:16,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (70 of 106 remaining) [2024-11-09 07:01:16,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (69 of 106 remaining) [2024-11-09 07:01:16,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (68 of 106 remaining) [2024-11-09 07:01:16,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (67 of 106 remaining) [2024-11-09 07:01:16,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (66 of 106 remaining) [2024-11-09 07:01:16,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (65 of 106 remaining) [2024-11-09 07:01:16,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (64 of 106 remaining) [2024-11-09 07:01:16,032 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (62 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (59 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (58 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (57 of 106 remaining) [2024-11-09 07:01:16,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (56 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (55 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (54 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (53 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (52 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (51 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (50 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (49 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (48 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (47 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (46 of 106 remaining) [2024-11-09 07:01:16,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (45 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (40 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (39 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 106 remaining) [2024-11-09 07:01:16,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 106 remaining) [2024-11-09 07:01:16,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 106 remaining) [2024-11-09 07:01:16,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 106 remaining) [2024-11-09 07:01:16,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 106 remaining) [2024-11-09 07:01:16,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 106 remaining) [2024-11-09 07:01:16,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 106 remaining) [2024-11-09 07:01:16,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 106 remaining) [2024-11-09 07:01:16,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (27 of 106 remaining) [2024-11-09 07:01:16,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (26 of 106 remaining) [2024-11-09 07:01:16,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (25 of 106 remaining) [2024-11-09 07:01:16,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 106 remaining) [2024-11-09 07:01:16,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (23 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (22 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (21 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (20 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (19 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (18 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (17 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (16 of 106 remaining) [2024-11-09 07:01:16,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (15 of 106 remaining) [2024-11-09 07:01:16,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 106 remaining) [2024-11-09 07:01:16,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 106 remaining) [2024-11-09 07:01:16,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (12 of 106 remaining) [2024-11-09 07:01:16,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (11 of 106 remaining) [2024-11-09 07:01:16,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (10 of 106 remaining) [2024-11-09 07:01:16,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (9 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (8 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (7 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (5 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (4 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (3 of 106 remaining) [2024-11-09 07:01:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (2 of 106 remaining) [2024-11-09 07:01:16,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (1 of 106 remaining) [2024-11-09 07:01:16,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (0 of 106 remaining) [2024-11-09 07:01:16,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:01:16,041 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:16,047 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:01:16,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:01:16,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:01:16 BasicIcfg [2024-11-09 07:01:16,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:01:16,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:01:16,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:01:16,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:01:16,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:11" (3/4) ... [2024-11-09 07:01:16,056 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:01:16,058 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:01:16,058 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:01:16,059 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:01:16,059 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-09 07:01:16,063 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 07:01:16,064 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:01:16,064 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:01:16,064 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:01:16,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:01:16,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:01:16,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:01:16,169 INFO L158 Benchmark]: Toolchain (without parser) took 6884.33ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 108.1MB in the beginning and 192.8MB in the end (delta: -84.6MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,169 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:01:16,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.67ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 93.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.39ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 89.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,170 INFO L158 Benchmark]: Boogie Preprocessor took 51.37ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 87.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,170 INFO L158 Benchmark]: RCFGBuilder took 1339.86ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 87.2MB in the beginning and 135.1MB in the end (delta: -47.9MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,171 INFO L158 Benchmark]: TraceAbstraction took 4918.79ms. Allocated memory was 243.3MB in the beginning and 306.2MB in the end (delta: 62.9MB). Free memory was 134.0MB in the beginning and 198.0MB in the end (delta: -64.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,171 INFO L158 Benchmark]: Witness Printer took 115.23ms. Allocated memory is still 306.2MB. Free memory was 198.0MB in the beginning and 192.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:01:16,172 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.22ms. Allocated memory is still 163.6MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.67ms. Allocated memory is still 163.6MB. Free memory was 108.1MB in the beginning and 93.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.39ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 89.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.37ms. Allocated memory is still 163.6MB. Free memory was 89.7MB in the beginning and 87.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1339.86ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 87.2MB in the beginning and 135.1MB in the end (delta: -47.9MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4918.79ms. Allocated memory was 243.3MB in the beginning and 306.2MB in the end (delta: 62.9MB). Free memory was 134.0MB in the beginning and 198.0MB in the end (delta: -64.0MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 115.23ms. Allocated memory is still 306.2MB. Free memory was 198.0MB in the beginning and 192.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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 9 procedures, 398 locations, 106 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: 4.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 74 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:01:16,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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