./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-5.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e0f90189cbea201dcd094fc9e84327a00ade17017ada90c5df84c8712afaf176 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:02:11,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:02:11,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:02:11,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:02:11,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:02:11,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:02:11,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:02:11,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:02:11,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:02:11,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:02:11,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:02:11,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:02:11,144 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:02:11,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:02:11,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:02:11,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:11,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:11,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:02:11,146 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> e0f90189cbea201dcd094fc9e84327a00ade17017ada90c5df84c8712afaf176 [2025-01-09 21:02:11,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:02:11,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:02:11,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:02:11,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:02:11,376 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:02:11,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-5.i [2025-01-09 21:02:12,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57d628773/33f050057ec945ec8cd53891e429108b/FLAGd67dc9c43 [2025-01-09 21:02:12,849 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:02:12,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-5.i [2025-01-09 21:02:12,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57d628773/33f050057ec945ec8cd53891e429108b/FLAGd67dc9c43 [2025-01-09 21:02:13,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57d628773/33f050057ec945ec8cd53891e429108b [2025-01-09 21:02:13,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:02:13,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:02:13,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:13,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:02:13,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:02:13,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f67c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13, skipping insertion in model container [2025-01-09 21:02:13,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:02:13,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:13,394 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:02:13,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:13,454 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:02:13,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13 WrapperNode [2025-01-09 21:02:13,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:13,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:13,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:02:13,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:02:13,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,485 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2025-01-09 21:02:13,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:13,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:02:13,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:02:13,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:02:13,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:02:13,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:02:13,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:02:13,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:02:13,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (1/1) ... [2025-01-09 21:02:13,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:02:13,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:02:13,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:02:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 21:02:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 21:02:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 21:02:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 21:02:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:02:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:02:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:02:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:02:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:02:13,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:02:13,562 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:02:13,664 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:02:13,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:02:13,906 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:02:13,906 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:02:13,990 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:02:13,990 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:02:13,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:13 BoogieIcfgContainer [2025-01-09 21:02:13,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:02:13,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:02:13,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:02:13,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:02:13,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:13" (1/3) ... [2025-01-09 21:02:13,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730f6da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:13, skipping insertion in model container [2025-01-09 21:02:14,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:13" (2/3) ... [2025-01-09 21:02:14,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730f6da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:14, skipping insertion in model container [2025-01-09 21:02:14,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:13" (3/3) ... [2025-01-09 21:02:14,001 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2025-01-09 21:02:14,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:02:14,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-5.i that has 3 procedures, 176 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-01-09 21:02:14,013 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:02:14,079 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:02:14,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 183 transitions, 374 flow [2025-01-09 21:02:14,178 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2025-01-09 21:02:14,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 8/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 155. Up to 2 conditions per place. [2025-01-09 21:02:14,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 183 transitions, 374 flow [2025-01-09 21:02:14,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 368 flow [2025-01-09 21:02:14,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:14,205 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;@366fc27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:14,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:02:14,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:14,210 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-01-09 21:02:14,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:14,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:14,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:14,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:14,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:14,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1870938818, now seen corresponding path program 1 times [2025-01-09 21:02:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:14,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385510860] [2025-01-09 21:02:14,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:14,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:02:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:02:14,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:14,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385510860] [2025-01-09 21:02:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385510860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:14,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:02:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254620145] [2025-01-09 21:02:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:02:14,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:14,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:02:14,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:02:14,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183 [2025-01-09 21:02:14,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 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) [2025-01-09 21:02:14,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:14,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183 [2025-01-09 21:02:14,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:14,464 INFO L124 PetriNetUnfolderBase]: 13/317 cut-off events. [2025-01-09 21:02:14,464 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:02:14,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 317 events. 13/317 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1155 event pairs, 6 based on Foata normal form. 22/285 useless extension candidates. Maximal degree in co-relation 312. Up to 21 conditions per place. [2025-01-09 21:02:14,468 INFO L140 encePairwiseOnDemand]: 168/183 looper letters, 7 selfloop transitions, 0 changer transitions 0/164 dead transitions. [2025-01-09 21:02:14,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 348 flow [2025-01-09 21:02:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:02:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:02:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 342 transitions. [2025-01-09 21:02:14,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-01-09 21:02:14,478 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 368 flow. Second operand 2 states and 342 transitions. [2025-01-09 21:02:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 348 flow [2025-01-09 21:02:14,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:14,485 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 332 flow [2025-01-09 21:02:14,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=332, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-01-09 21:02:14,489 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -13 predicate places. [2025-01-09 21:02:14,489 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 332 flow [2025-01-09 21:02:14,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 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) [2025-01-09 21:02:14,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:14,490 INFO L206 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] [2025-01-09 21:02:14,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:02:14,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1617864077, now seen corresponding path program 1 times [2025-01-09 21:02:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142669251] [2025-01-09 21:02:14,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:14,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:02:14,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:02:14,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:14,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142669251] [2025-01-09 21:02:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142669251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520148155] [2025-01-09 21:02:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:14,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:14,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:14,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:14,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2025-01-09 21:02:14,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:14,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:14,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:14,682 INFO L124 PetriNetUnfolderBase]: 63/594 cut-off events. [2025-01-09 21:02:14,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:14,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 594 events. 63/594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3247 event pairs, 29 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 716. Up to 81 conditions per place. [2025-01-09 21:02:14,690 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-01-09 21:02:14,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 372 flow [2025-01-09 21:02:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:14,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-01-09 21:02:14,694 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 332 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:14,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 372 flow [2025-01-09 21:02:14,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:14,699 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 334 flow [2025-01-09 21:02:14,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-01-09 21:02:14,700 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -12 predicate places. [2025-01-09 21:02:14,701 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 334 flow [2025-01-09 21:02:14,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2025-01-09 21:02:14,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:14,701 INFO L206 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] [2025-01-09 21:02:14,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:02:14,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash -333755420, now seen corresponding path program 1 times [2025-01-09 21:02:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645001119] [2025-01-09 21:02:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:14,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:02:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:02:14,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:14,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:14,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645001119] [2025-01-09 21:02:14,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645001119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:14,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72412557] [2025-01-09 21:02:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:14,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:14,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:14,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:14,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2025-01-09 21:02:14,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:14,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:14,879 INFO L124 PetriNetUnfolderBase]: 50/334 cut-off events. [2025-01-09 21:02:14,879 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:02:14,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 334 events. 50/334 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1533 event pairs, 11 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 447. Up to 55 conditions per place. [2025-01-09 21:02:14,883 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-01-09 21:02:14,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2025-01-09 21:02:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:14,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-01-09 21:02:14,886 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 334 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:14,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2025-01-09 21:02:14,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:14,890 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 330 flow [2025-01-09 21:02:14,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-01-09 21:02:14,893 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -14 predicate places. [2025-01-09 21:02:14,893 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 330 flow [2025-01-09 21:02:14,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2025-01-09 21:02:14,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:14,894 INFO L206 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] [2025-01-09 21:02:14,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:02:14,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:14,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1956789223, now seen corresponding path program 1 times [2025-01-09 21:02:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:14,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-01-09 21:02:14,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:14,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:14,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:02:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:02:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-01-09 21:02:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701040537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912001461] [2025-01-09 21:02:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:14,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:14,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:14,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:14,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:14,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:14,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:14,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,044 INFO L124 PetriNetUnfolderBase]: 41/346 cut-off events. [2025-01-09 21:02:15,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 346 events. 41/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1665 event pairs, 26 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 428. Up to 59 conditions per place. [2025-01-09 21:02:15,047 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-01-09 21:02:15,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 364 flow [2025-01-09 21:02:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:15,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:15,049 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 330 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:15,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 364 flow [2025-01-09 21:02:15,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,051 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 328 flow [2025-01-09 21:02:15,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-01-09 21:02:15,052 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -15 predicate places. [2025-01-09 21:02:15,052 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 328 flow [2025-01-09 21:02:15,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:15,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,053 INFO L206 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] [2025-01-09 21:02:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:02:15,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1791913312, now seen corresponding path program 1 times [2025-01-09 21:02:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-01-09 21:02:15,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:02:15,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:02:15,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594497917] [2025-01-09 21:02:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594497917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263719609] [2025-01-09 21:02:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-01-09 21:02:15,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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) [2025-01-09 21:02:15,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-01-09 21:02:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,204 INFO L124 PetriNetUnfolderBase]: 65/510 cut-off events. [2025-01-09 21:02:15,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 510 events. 65/510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2800 event pairs, 24 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 626. Up to 87 conditions per place. [2025-01-09 21:02:15,208 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-01-09 21:02:15,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 366 flow [2025-01-09 21:02:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-01-09 21:02:15,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-01-09 21:02:15,210 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 328 flow. Second operand 3 states and 469 transitions. [2025-01-09 21:02:15,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 366 flow [2025-01-09 21:02:15,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,214 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 326 flow [2025-01-09 21:02:15,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2025-01-09 21:02:15,215 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -16 predicate places. [2025-01-09 21:02:15,215 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 326 flow [2025-01-09 21:02:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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) [2025-01-09 21:02:15,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,217 INFO L206 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] [2025-01-09 21:02:15,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:02:15,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -882814040, now seen corresponding path program 1 times [2025-01-09 21:02:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-01-09 21:02:15,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:02:15,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:02:15,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-01-09 21:02:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313014169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730767718] [2025-01-09 21:02:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:15,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:15,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:15,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,320 INFO L124 PetriNetUnfolderBase]: 37/358 cut-off events. [2025-01-09 21:02:15,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 358 events. 37/358 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1738 event pairs, 16 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 434. Up to 40 conditions per place. [2025-01-09 21:02:15,326 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-01-09 21:02:15,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 356 flow [2025-01-09 21:02:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:15,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:15,330 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 326 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:15,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 356 flow [2025-01-09 21:02:15,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,332 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 322 flow [2025-01-09 21:02:15,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-01-09 21:02:15,333 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -18 predicate places. [2025-01-09 21:02:15,334 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 322 flow [2025-01-09 21:02:15,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:15,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,334 INFO L206 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] [2025-01-09 21:02:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:02:15,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -740559985, now seen corresponding path program 1 times [2025-01-09 21:02:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261457353] [2025-01-09 21:02:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:02:15,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:02:15,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261457353] [2025-01-09 21:02:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261457353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108538122] [2025-01-09 21:02:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:15,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:15,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:15,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,444 INFO L124 PetriNetUnfolderBase]: 37/428 cut-off events. [2025-01-09 21:02:15,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 428 events. 37/428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2086 event pairs, 10 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 504. Up to 40 conditions per place. [2025-01-09 21:02:15,448 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:02:15,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 352 flow [2025-01-09 21:02:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:15,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:15,449 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 322 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:15,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 352 flow [2025-01-09 21:02:15,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,452 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 318 flow [2025-01-09 21:02:15,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-01-09 21:02:15,452 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-01-09 21:02:15,452 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 318 flow [2025-01-09 21:02:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:15,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,453 INFO L206 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] [2025-01-09 21:02:15,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:02:15,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1270440170, now seen corresponding path program 1 times [2025-01-09 21:02:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17192015] [2025-01-09 21:02:15,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:02:15,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:02:15,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17192015] [2025-01-09 21:02:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17192015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164213666] [2025-01-09 21:02:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:15,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2025-01-09 21:02:15,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:15,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,551 INFO L124 PetriNetUnfolderBase]: 52/363 cut-off events. [2025-01-09 21:02:15,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 363 events. 52/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1676 event pairs, 26 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 476. Up to 72 conditions per place. [2025-01-09 21:02:15,554 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:02:15,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 358 flow [2025-01-09 21:02:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:15,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-01-09 21:02:15,556 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 318 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:15,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 358 flow [2025-01-09 21:02:15,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,557 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 316 flow [2025-01-09 21:02:15,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2025-01-09 21:02:15,558 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-01-09 21:02:15,558 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 316 flow [2025-01-09 21:02:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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) [2025-01-09 21:02:15,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,559 INFO L206 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] [2025-01-09 21:02:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:02:15,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1224910392, now seen corresponding path program 1 times [2025-01-09 21:02:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928421416] [2025-01-09 21:02:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:02:15,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:02:15,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928421416] [2025-01-09 21:02:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928421416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:02:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690151316] [2025-01-09 21:02:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-01-09 21:02:15,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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) [2025-01-09 21:02:15,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-01-09 21:02:15,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,645 INFO L124 PetriNetUnfolderBase]: 25/567 cut-off events. [2025-01-09 21:02:15,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 567 events. 25/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2470 event pairs, 6 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 622. Up to 29 conditions per place. [2025-01-09 21:02:15,649 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:02:15,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 350 flow [2025-01-09 21:02:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-01-09 21:02:15,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-01-09 21:02:15,650 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 316 flow. Second operand 3 states and 483 transitions. [2025-01-09 21:02:15,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 350 flow [2025-01-09 21:02:15,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,652 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 324 flow [2025-01-09 21:02:15,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-01-09 21:02:15,653 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-01-09 21:02:15,653 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 324 flow [2025-01-09 21:02:15,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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) [2025-01-09 21:02:15,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,654 INFO L206 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] [2025-01-09 21:02:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:02:15,654 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1224909367, now seen corresponding path program 1 times [2025-01-09 21:02:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-01-09 21:02:15,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:02:15,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:02:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-01-09 21:02:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446833232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187380907] [2025-01-09 21:02:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-01-09 21:02:15,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2025-01-09 21:02:15,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-01-09 21:02:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,757 INFO L124 PetriNetUnfolderBase]: 57/553 cut-off events. [2025-01-09 21:02:15,758 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:02:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 553 events. 57/553 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2406 event pairs, 10 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 664. Up to 66 conditions per place. [2025-01-09 21:02:15,761 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 11 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2025-01-09 21:02:15,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 155 transitions, 352 flow [2025-01-09 21:02:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-01-09 21:02:15,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-01-09 21:02:15,763 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-01-09 21:02:15,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 155 transitions, 352 flow [2025-01-09 21:02:15,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:15,765 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 324 flow [2025-01-09 21:02:15,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2025-01-09 21:02:15,766 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-01-09 21:02:15,766 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 324 flow [2025-01-09 21:02:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2025-01-09 21:02:15,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,767 INFO L206 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] [2025-01-09 21:02:15,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:02:15,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 316874848, now seen corresponding path program 1 times [2025-01-09 21:02:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13398646] [2025-01-09 21:02:15,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:02:15,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:02:15,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13398646] [2025-01-09 21:02:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13398646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715989591] [2025-01-09 21:02:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-01-09 21:02:15,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2025-01-09 21:02:15,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-01-09 21:02:15,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,882 INFO L124 PetriNetUnfolderBase]: 65/561 cut-off events. [2025-01-09 21:02:15,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 561 events. 65/561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2491 event pairs, 14 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 700. Up to 72 conditions per place. [2025-01-09 21:02:15,885 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-01-09 21:02:15,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 352 flow [2025-01-09 21:02:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-01-09 21:02:15,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-01-09 21:02:15,887 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-01-09 21:02:15,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 352 flow [2025-01-09 21:02:15,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,889 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 318 flow [2025-01-09 21:02:15,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=157, PETRI_TRANSITIONS=151} [2025-01-09 21:02:15,889 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -23 predicate places. [2025-01-09 21:02:15,889 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 318 flow [2025-01-09 21:02:15,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2025-01-09 21:02:15,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,890 INFO L206 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] [2025-01-09 21:02:15,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:02:15,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1570994960, now seen corresponding path program 1 times [2025-01-09 21:02:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-01-09 21:02:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:02:15,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:02:15,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-01-09 21:02:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073072882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:15,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:15,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693636581] [2025-01-09 21:02:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:15,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:15,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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) [2025-01-09 21:02:15,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:15,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:15,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:15,972 INFO L124 PetriNetUnfolderBase]: 37/409 cut-off events. [2025-01-09 21:02:15,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:15,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 409 events. 37/409 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1533 event pairs, 24 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 500. Up to 55 conditions per place. [2025-01-09 21:02:15,976 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-01-09 21:02:15,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 352 flow [2025-01-09 21:02:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:15,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:15,977 INFO L175 Difference]: Start difference. First operand has 157 places, 151 transitions, 318 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:15,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 352 flow [2025-01-09 21:02:15,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:15,979 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 316 flow [2025-01-09 21:02:15,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=156, PETRI_TRANSITIONS=150} [2025-01-09 21:02:15,980 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -24 predicate places. [2025-01-09 21:02:15,980 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 316 flow [2025-01-09 21:02:15,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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) [2025-01-09 21:02:15,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:15,981 INFO L206 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] [2025-01-09 21:02:15,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:02:15,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:15,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1300269447, now seen corresponding path program 1 times [2025-01-09 21:02:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-01-09 21:02:15,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:02:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:02:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:15,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-01-09 21:02:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72362284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:16,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9584156] [2025-01-09 21:02:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:16,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:16,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:16,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:16,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:16,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 150 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-01-09 21:02:16,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:16,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:16,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:16,071 INFO L124 PetriNetUnfolderBase]: 61/567 cut-off events. [2025-01-09 21:02:16,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:16,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 567 events. 61/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2742 event pairs, 38 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 704. Up to 83 conditions per place. [2025-01-09 21:02:16,075 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-01-09 21:02:16,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 350 flow [2025-01-09 21:02:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:16,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:16,076 INFO L175 Difference]: Start difference. First operand has 156 places, 150 transitions, 316 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:16,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 350 flow [2025-01-09 21:02:16,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:16,078 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 314 flow [2025-01-09 21:02:16,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2025-01-09 21:02:16,078 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -25 predicate places. [2025-01-09 21:02:16,078 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 314 flow [2025-01-09 21:02:16,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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) [2025-01-09 21:02:16,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:16,080 INFO L206 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] [2025-01-09 21:02:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:02:16,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1447896771, now seen corresponding path program 1 times [2025-01-09 21:02:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159353126] [2025-01-09 21:02:16,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:16,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:02:16,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:02:16,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:16,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159353126] [2025-01-09 21:02:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159353126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:16,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:16,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954606034] [2025-01-09 21:02:16,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:16,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:16,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:16,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:16,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-01-09 21:02:16,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2025-01-09 21:02:16,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:16,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-01-09 21:02:16,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:16,173 INFO L124 PetriNetUnfolderBase]: 65/563 cut-off events. [2025-01-09 21:02:16,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:16,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 563 events. 65/563 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2802 event pairs, 42 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 720. Up to 91 conditions per place. [2025-01-09 21:02:16,176 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-01-09 21:02:16,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 350 flow [2025-01-09 21:02:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:02:16,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-01-09 21:02:16,178 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 314 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:02:16,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 350 flow [2025-01-09 21:02:16,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:16,180 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 312 flow [2025-01-09 21:02:16,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-01-09 21:02:16,180 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-01-09 21:02:16,180 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 312 flow [2025-01-09 21:02:16,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2025-01-09 21:02:16,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:16,181 INFO L206 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] [2025-01-09 21:02:16,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:02:16,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:16,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 64292726, now seen corresponding path program 1 times [2025-01-09 21:02:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:16,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-01-09 21:02:16,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:16,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:02:16,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:02:16,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:16,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-01-09 21:02:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554730533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046247536] [2025-01-09 21:02:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:16,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:16,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:16,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:16,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-01-09 21:02:16,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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) [2025-01-09 21:02:16,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:16,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-01-09 21:02:16,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:16,269 INFO L124 PetriNetUnfolderBase]: 51/535 cut-off events. [2025-01-09 21:02:16,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 535 events. 51/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2288 event pairs, 10 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 642. Up to 50 conditions per place. [2025-01-09 21:02:16,272 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 11 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-01-09 21:02:16,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 150 transitions, 342 flow [2025-01-09 21:02:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-01-09 21:02:16,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2025-01-09 21:02:16,274 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 312 flow. Second operand 3 states and 482 transitions. [2025-01-09 21:02:16,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 150 transitions, 342 flow [2025-01-09 21:02:16,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 150 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:16,276 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 316 flow [2025-01-09 21:02:16,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-01-09 21:02:16,276 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-01-09 21:02:16,276 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 316 flow [2025-01-09 21:02:16,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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) [2025-01-09 21:02:16,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:16,277 INFO L206 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] [2025-01-09 21:02:16,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:02:16,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2069992608, now seen corresponding path program 1 times [2025-01-09 21:02:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:16,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-01-09 21:02:16,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:16,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:02:16,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:02:16,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:16,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:16,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552668632] [2025-01-09 21:02:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552668632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:16,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690612780] [2025-01-09 21:02:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:16,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:16,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-01-09 21:02:16,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:16,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:16,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-01-09 21:02:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:16,375 INFO L124 PetriNetUnfolderBase]: 69/551 cut-off events. [2025-01-09 21:02:16,376 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:02:16,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 551 events. 69/551 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2739 event pairs, 46 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 720. Up to 99 conditions per place. [2025-01-09 21:02:16,379 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-01-09 21:02:16,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 352 flow [2025-01-09 21:02:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:02:16,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-01-09 21:02:16,380 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 316 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:02:16,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 352 flow [2025-01-09 21:02:16,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:16,383 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 316 flow [2025-01-09 21:02:16,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2025-01-09 21:02:16,383 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-01-09 21:02:16,383 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 316 flow [2025-01-09 21:02:16,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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) [2025-01-09 21:02:16,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:16,384 INFO L206 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] [2025-01-09 21:02:16,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:02:16,384 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1569385207, now seen corresponding path program 1 times [2025-01-09 21:02:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:16,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997652178] [2025-01-09 21:02:16,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:16,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:02:16,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:02:16,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:16,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:16,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:16,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997652178] [2025-01-09 21:02:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997652178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:16,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987922104] [2025-01-09 21:02:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:16,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:16,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:16,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:16,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-01-09 21:02:16,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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) [2025-01-09 21:02:16,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:16,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-01-09 21:02:16,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:16,474 INFO L124 PetriNetUnfolderBase]: 57/535 cut-off events. [2025-01-09 21:02:16,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:16,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 535 events. 57/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2443 event pairs, 42 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 692. Up to 91 conditions per place. [2025-01-09 21:02:16,476 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2025-01-09 21:02:16,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 354 flow [2025-01-09 21:02:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-01-09 21:02:16,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-01-09 21:02:16,478 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 316 flow. Second operand 3 states and 469 transitions. [2025-01-09 21:02:16,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 148 transitions, 354 flow [2025-01-09 21:02:16,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:16,479 INFO L231 Difference]: Finished difference. Result has 153 places, 0 transitions, 0 flow [2025-01-09 21:02:16,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=153, PETRI_TRANSITIONS=0} [2025-01-09 21:02:16,480 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -27 predicate places. [2025-01-09 21:02:16,480 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 0 transitions, 0 flow [2025-01-09 21:02:16,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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) [2025-01-09 21:02:16,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-01-09 21:02:16,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-01-09 21:02:16,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:02:16,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:02:16,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-01-09 21:02:16,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:02:16,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:02:16,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:02:16,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:02:16,486 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:16,490 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:02:16,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:02:16,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:02:16 BasicIcfg [2025-01-09 21:02:16,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:02:16,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:02:16,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:02:16,494 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:02:16,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:13" (3/4) ... [2025-01-09 21:02:16,495 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:02:16,497 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2025-01-09 21:02:16,497 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2025-01-09 21:02:16,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-09 21:02:16,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-09 21:02:16,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:02:16,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:02:16,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:02:16,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:02:16,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:02:16,554 INFO L158 Benchmark]: Toolchain (without parser) took 3459.22ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.3MB in the beginning and 59.1MB in the end (delta: 53.2MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2025-01-09 21:02:16,554 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:16,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.48ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 92.5MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:02:16,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:16,555 INFO L158 Benchmark]: Boogie Preprocessor took 24.42ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.6MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:16,555 INFO L158 Benchmark]: RCFGBuilder took 480.24ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 65.5MB in the end (delta: 24.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:16,556 INFO L158 Benchmark]: TraceAbstraction took 2498.25ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 64.4MB in the beginning and 65.7MB in the end (delta: -1.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-01-09 21:02:16,557 INFO L158 Benchmark]: Witness Printer took 59.74ms. Allocated memory is still 176.2MB. Free memory was 65.7MB in the beginning and 59.1MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:16,557 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.23ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.48ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 92.5MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.42ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.6MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 480.24ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 65.5MB in the end (delta: 24.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2498.25ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 64.4MB in the beginning and 65.7MB in the end (delta: -1.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 59.74ms. Allocated memory is still 176.2MB. Free memory was 65.7MB in the beginning and 59.1MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: 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 5 procedures, 236 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 515 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 51 mSDtfsCounter, 515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:02:16,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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