./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:33:22,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:33:22,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:33:22,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:33:22,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:33:22,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:33:22,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:33:22,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:33:22,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:33:22,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:33:22,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:33:22,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:33:22,306 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:33:22,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:33:22,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:33:22,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:33:22,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:33:22,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:33:22,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:33:22,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:33:22,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:33:22,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:33:22,310 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:33:22,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:33:22,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:33:22,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:33:22,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:33:22,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:33:22,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:33:22,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:33:22,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:33:22,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:22,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:33:22,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:33:22,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:33:22,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:33:22,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:33:22,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:33:22,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:33:22,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:33:22,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:33:22,315 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c [2024-11-10 14:33:22,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:33:22,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:33:22,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:33:22,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:33:22,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:33:22,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2024-11-10 14:33:24,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:33:24,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:33:24,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2024-11-10 14:33:24,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf40620c/b8c4645523b64fbf9b32db1819a14e80/FLAG14c713c5a [2024-11-10 14:33:24,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cf40620c/b8c4645523b64fbf9b32db1819a14e80 [2024-11-10 14:33:24,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:33:24,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:33:24,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:24,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:33:24,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:33:24,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:24" (1/1) ... [2024-11-10 14:33:24,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db4f248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:24, skipping insertion in model container [2024-11-10 14:33:24,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:24" (1/1) ... [2024-11-10 14:33:24,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:33:24,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:24,930 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:33:24,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:25,022 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:33:25,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25 WrapperNode [2024-11-10 14:33:25,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:25,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:25,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:33:25,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:33:25,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,095 INFO L138 Inliner]: procedures = 252, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2024-11-10 14:33:25,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:25,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:33:25,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:33:25,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:33:25,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:33:25,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:33:25,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:33:25,149 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:33:25,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (1/1) ... [2024-11-10 14:33:25,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:25,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:33:25,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:33:25,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:33:25,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:33:25,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:33:25,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:33:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:33:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:33:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:33:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:33:25,236 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:33:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:33:25,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:33:25,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:33:25,238 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:33:25,386 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:33:25,390 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:33:25,615 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:33:25,616 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:33:25,755 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:33:25,755 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:33:25,828 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:33:25,828 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:33:25,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:25 BoogieIcfgContainer [2024-11-10 14:33:25,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:33:25,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:33:25,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:33:25,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:33:25,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:24" (1/3) ... [2024-11-10 14:33:25,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5f82b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:25, skipping insertion in model container [2024-11-10 14:33:25,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:25" (2/3) ... [2024-11-10 14:33:25,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5f82b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:25, skipping insertion in model container [2024-11-10 14:33:25,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:25" (3/3) ... [2024-11-10 14:33:25,841 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2024-11-10 14:33:25,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:33:25,860 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-10 14:33:25,861 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:33:25,957 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:33:26,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 222 transitions, 451 flow [2024-11-10 14:33:26,157 INFO L124 PetriNetUnfolderBase]: 26/294 cut-off events. [2024-11-10 14:33:26,157 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:33:26,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 294 events. 26/294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1049 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 183. Up to 4 conditions per place. [2024-11-10 14:33:26,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 222 transitions, 451 flow [2024-11-10 14:33:26,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 222 transitions, 451 flow [2024-11-10 14:33:26,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:26,200 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;@73f1b2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:26,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-10 14:33:26,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:26,220 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2024-11-10 14:33:26,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:26,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:26,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:26,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:33:26,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1562635186, now seen corresponding path program 1 times [2024-11-10 14:33:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123474358] [2024-11-10 14:33:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:26,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123474358] [2024-11-10 14:33:26,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123474358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:26,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:26,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:26,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559380050] [2024-11-10 14:33:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:26,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:26,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 222 [2024-11-10 14:33:26,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 222 transitions, 451 flow. Second operand has 2 states, 2 states have (on average 184.0) internal successors, (368), 2 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:26,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:26,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 222 [2024-11-10 14:33:26,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:26,728 INFO L124 PetriNetUnfolderBase]: 80/902 cut-off events. [2024-11-10 14:33:26,728 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 902 events. 80/902 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5552 event pairs, 72 based on Foata normal form. 163/977 useless extension candidates. Maximal degree in co-relation 961. Up to 171 conditions per place. [2024-11-10 14:33:26,736 INFO L140 encePairwiseOnDemand]: 204/222 looper letters, 20 selfloop transitions, 0 changer transitions 0/202 dead transitions. [2024-11-10 14:33:26,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 451 flow [2024-11-10 14:33:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 404 transitions. [2024-11-10 14:33:26,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-10 14:33:26,757 INFO L175 Difference]: Start difference. First operand has 205 places, 222 transitions, 451 flow. Second operand 2 states and 404 transitions. [2024-11-10 14:33:26,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 451 flow [2024-11-10 14:33:26,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 451 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:26,767 INFO L231 Difference]: Finished difference. Result has 204 places, 202 transitions, 411 flow [2024-11-10 14:33:26,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=411, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2024-11-10 14:33:26,775 INFO L277 CegarLoopForPetriNet]: 205 programPoint places, -1 predicate places. [2024-11-10 14:33:26,775 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 411 flow [2024-11-10 14:33:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 184.0) internal successors, (368), 2 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:26,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:26,776 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:33:26,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:33:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -841749961, now seen corresponding path program 1 times [2024-11-10 14:33:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459710331] [2024-11-10 14:33:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459710331] [2024-11-10 14:33:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459710331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:26,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443613116] [2024-11-10 14:33:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:26,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:26,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 222 [2024-11-10 14:33:26,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:26,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:26,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 222 [2024-11-10 14:33:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:27,249 INFO L124 PetriNetUnfolderBase]: 122/1078 cut-off events. [2024-11-10 14:33:27,249 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:27,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 1078 events. 122/1078 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7066 event pairs, 99 based on Foata normal form. 1/969 useless extension candidates. Maximal degree in co-relation 1348. Up to 254 conditions per place. [2024-11-10 14:33:27,257 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 36 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2024-11-10 14:33:27,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 214 transitions, 511 flow [2024-11-10 14:33:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2024-11-10 14:33:27,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8558558558558559 [2024-11-10 14:33:27,264 INFO L175 Difference]: Start difference. First operand has 204 places, 202 transitions, 411 flow. Second operand 3 states and 570 transitions. [2024-11-10 14:33:27,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 214 transitions, 511 flow [2024-11-10 14:33:27,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 214 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:27,272 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 419 flow [2024-11-10 14:33:27,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2024-11-10 14:33:27,275 INFO L277 CegarLoopForPetriNet]: 205 programPoint places, 2 predicate places. [2024-11-10 14:33:27,275 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 419 flow [2024-11-10 14:33:27,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:27,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:27,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:27,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:33:27,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:33:27,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash 937631235, now seen corresponding path program 1 times [2024-11-10 14:33:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:27,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44253709] [2024-11-10 14:33:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44253709] [2024-11-10 14:33:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44253709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299183626] [2024-11-10 14:33:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:27,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:27,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:28,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 222 [2024-11-10 14:33:28,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 222 [2024-11-10 14:33:28,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:28,366 INFO L124 PetriNetUnfolderBase]: 254/1813 cut-off events. [2024-11-10 14:33:28,367 INFO L125 PetriNetUnfolderBase]: For 17/20 co-relation queries the response was YES. [2024-11-10 14:33:28,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1813 events. 254/1813 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13864 event pairs, 166 based on Foata normal form. 0/1624 useless extension candidates. Maximal degree in co-relation 2374. Up to 387 conditions per place. [2024-11-10 14:33:28,377 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 80 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2024-11-10 14:33:28,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 249 transitions, 683 flow [2024-11-10 14:33:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1076 transitions. [2024-11-10 14:33:28,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8078078078078078 [2024-11-10 14:33:28,381 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 419 flow. Second operand 6 states and 1076 transitions. [2024-11-10 14:33:28,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 249 transitions, 683 flow [2024-11-10 14:33:28,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 249 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:28,388 INFO L231 Difference]: Finished difference. Result has 209 places, 201 transitions, 423 flow [2024-11-10 14:33:28,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=209, PETRI_TRANSITIONS=201} [2024-11-10 14:33:28,390 INFO L277 CegarLoopForPetriNet]: 205 programPoint places, 4 predicate places. [2024-11-10 14:33:28,391 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 201 transitions, 423 flow [2024-11-10 14:33:28,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:28,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:28,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:33:28,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:33:28,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 119069237, now seen corresponding path program 1 times [2024-11-10 14:33:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:28,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015712900] [2024-11-10 14:33:28,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015712900] [2024-11-10 14:33:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015712900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:28,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526850929] [2024-11-10 14:33:28,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:28,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:28,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:28,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:28,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 222 [2024-11-10 14:33:28,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 201 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 222 [2024-11-10 14:33:28,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:28,680 INFO L124 PetriNetUnfolderBase]: 170/1666 cut-off events. [2024-11-10 14:33:28,681 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:33:28,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 1666 events. 170/1666 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 13090 event pairs, 12 based on Foata normal form. 0/1497 useless extension candidates. Maximal degree in co-relation 2049. Up to 189 conditions per place. [2024-11-10 14:33:28,693 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 41 selfloop transitions, 3 changer transitions 0/221 dead transitions. [2024-11-10 14:33:28,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 221 transitions, 554 flow [2024-11-10 14:33:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2024-11-10 14:33:28,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8738738738738738 [2024-11-10 14:33:28,695 INFO L175 Difference]: Start difference. First operand has 209 places, 201 transitions, 423 flow. Second operand 3 states and 582 transitions. [2024-11-10 14:33:28,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 221 transitions, 554 flow [2024-11-10 14:33:28,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 221 transitions, 544 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:28,700 INFO L231 Difference]: Finished difference. Result has 208 places, 203 transitions, 435 flow [2024-11-10 14:33:28,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=208, PETRI_TRANSITIONS=203} [2024-11-10 14:33:28,702 INFO L277 CegarLoopForPetriNet]: 205 programPoint places, 3 predicate places. [2024-11-10 14:33:28,702 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 203 transitions, 435 flow [2024-11-10 14:33:28,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:28,703 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:28,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:33:28,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:33:28,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1864655114, now seen corresponding path program 1 times [2024-11-10 14:33:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:28,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937618272] [2024-11-10 14:33:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937618272] [2024-11-10 14:33:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937618272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:28,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065611957] [2024-11-10 14:33:28,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:28,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:28,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:28,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:33:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:33:28,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:28,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065611957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-10 14:33:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192651123] [2024-11-10 14:33:28,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:28,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:28,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:28,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 222 [2024-11-10 14:33:28,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 203 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:28,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 222 [2024-11-10 14:33:28,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:29,239 INFO L124 PetriNetUnfolderBase]: 278/2227 cut-off events. [2024-11-10 14:33:29,239 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-10 14:33:29,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 2227 events. 278/2227 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 18752 event pairs, 204 based on Foata normal form. 0/1958 useless extension candidates. Maximal degree in co-relation 2890. Up to 497 conditions per place. [2024-11-10 14:33:29,253 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 39 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2024-11-10 14:33:29,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 218 transitions, 557 flow [2024-11-10 14:33:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2024-11-10 14:33:29,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8543543543543544 [2024-11-10 14:33:29,255 INFO L175 Difference]: Start difference. First operand has 208 places, 203 transitions, 435 flow. Second operand 3 states and 569 transitions. [2024-11-10 14:33:29,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 218 transitions, 557 flow [2024-11-10 14:33:29,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 218 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:29,263 INFO L231 Difference]: Finished difference. Result has 210 places, 206 transitions, 465 flow [2024-11-10 14:33:29,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=210, PETRI_TRANSITIONS=206} [2024-11-10 14:33:29,266 INFO L277 CegarLoopForPetriNet]: 205 programPoint places, 5 predicate places. [2024-11-10 14:33:29,266 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 206 transitions, 465 flow [2024-11-10 14:33:29,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:29,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,267 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:33:29,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:29,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:33:29,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 389306621, now seen corresponding path program 1 times [2024-11-10 14:33:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069248653] [2024-11-10 14:33:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:29,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:29,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:29,546 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:29,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2024-11-10 14:33:29,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2024-11-10 14:33:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2024-11-10 14:33:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2024-11-10 14:33:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2024-11-10 14:33:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2024-11-10 14:33:29,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2024-11-10 14:33:29,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2024-11-10 14:33:29,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2024-11-10 14:33:29,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2024-11-10 14:33:29,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2024-11-10 14:33:29,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2024-11-10 14:33:29,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2024-11-10 14:33:29,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2024-11-10 14:33:29,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2024-11-10 14:33:29,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2024-11-10 14:33:29,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2024-11-10 14:33:29,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:33:29,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,558 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:29,558 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:33:29,603 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:33:29,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 332 transitions, 680 flow [2024-11-10 14:33:29,675 INFO L124 PetriNetUnfolderBase]: 48/505 cut-off events. [2024-11-10 14:33:29,676 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 505 events. 48/505 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2178 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 314. Up to 8 conditions per place. [2024-11-10 14:33:29,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 303 places, 332 transitions, 680 flow [2024-11-10 14:33:29,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 332 transitions, 680 flow [2024-11-10 14:33:29,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:29,696 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;@73f1b2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:29,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-10 14:33:29,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:29,702 INFO L124 PetriNetUnfolderBase]: 1/50 cut-off events. [2024-11-10 14:33:29,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:29,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,702 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash -213930242, now seen corresponding path program 1 times [2024-11-10 14:33:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069694978] [2024-11-10 14:33:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069694978] [2024-11-10 14:33:29,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069694978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:29,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:29,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928078893] [2024-11-10 14:33:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:29,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:33:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:33:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:33:29,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 332 [2024-11-10 14:33:29,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 332 transitions, 680 flow. Second operand has 2 states, 2 states have (on average 268.0) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:29,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:29,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 332 [2024-11-10 14:33:29,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:31,863 INFO L124 PetriNetUnfolderBase]: 2234/12609 cut-off events. [2024-11-10 14:33:31,864 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-10 14:33:31,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16116 conditions, 12609 events. 2234/12609 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 148834 event pairs, 2124 based on Foata normal form. 3387/14773 useless extension candidates. Maximal degree in co-relation 14803. Up to 3434 conditions per place. [2024-11-10 14:33:31,973 INFO L140 encePairwiseOnDemand]: 302/332 looper letters, 34 selfloop transitions, 0 changer transitions 0/300 dead transitions. [2024-11-10 14:33:31,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 684 flow [2024-11-10 14:33:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:33:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:33:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 598 transitions. [2024-11-10 14:33:31,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9006024096385542 [2024-11-10 14:33:31,976 INFO L175 Difference]: Start difference. First operand has 303 places, 332 transitions, 680 flow. Second operand 2 states and 598 transitions. [2024-11-10 14:33:31,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 684 flow [2024-11-10 14:33:31,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:31,984 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 616 flow [2024-11-10 14:33:31,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=616, PETRI_PLACES=302, PETRI_TRANSITIONS=300} [2024-11-10 14:33:31,986 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, -1 predicate places. [2024-11-10 14:33:31,987 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 616 flow [2024-11-10 14:33:31,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 268.0) internal successors, (536), 2 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:31,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:31,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:31,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:33:31,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:31,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -80703049, now seen corresponding path program 1 times [2024-11-10 14:33:31,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:31,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541410503] [2024-11-10 14:33:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541410503] [2024-11-10 14:33:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541410503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331188169] [2024-11-10 14:33:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:32,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 332 [2024-11-10 14:33:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 300 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:32,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 332 [2024-11-10 14:33:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:34,074 INFO L124 PetriNetUnfolderBase]: 3460/17377 cut-off events. [2024-11-10 14:33:34,074 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2024-11-10 14:33:34,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22929 conditions, 17377 events. 3460/17377 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 217605 event pairs, 1584 based on Foata normal form. 1/15765 useless extension candidates. Maximal degree in co-relation 22924. Up to 5465 conditions per place. [2024-11-10 14:33:34,227 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 51 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-11-10 14:33:34,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 313 transitions, 748 flow [2024-11-10 14:33:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2024-11-10 14:33:34,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8403614457831325 [2024-11-10 14:33:34,231 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 616 flow. Second operand 3 states and 837 transitions. [2024-11-10 14:33:34,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 313 transitions, 748 flow [2024-11-10 14:33:34,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 313 transitions, 748 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:34,240 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 628 flow [2024-11-10 14:33:34,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2024-11-10 14:33:34,243 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, 2 predicate places. [2024-11-10 14:33:34,243 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 628 flow [2024-11-10 14:33:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:34,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:33:34,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2135683325, now seen corresponding path program 1 times [2024-11-10 14:33:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731896634] [2024-11-10 14:33:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731896634] [2024-11-10 14:33:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731896634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:34,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:34,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658209526] [2024-11-10 14:33:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:34,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:34,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:34,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:34,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 332 [2024-11-10 14:33:34,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 250.5) internal successors, (1503), 6 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:34,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:34,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 332 [2024-11-10 14:33:34,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:37,279 INFO L124 PetriNetUnfolderBase]: 6760/20494 cut-off events. [2024-11-10 14:33:37,279 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2024-11-10 14:33:37,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31623 conditions, 20494 events. 6760/20494 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 239382 event pairs, 804 based on Foata normal form. 0/19234 useless extension candidates. Maximal degree in co-relation 31616. Up to 7803 conditions per place. [2024-11-10 14:33:37,409 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 142 selfloop transitions, 6 changer transitions 0/396 dead transitions. [2024-11-10 14:33:37,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 396 transitions, 1114 flow [2024-11-10 14:33:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1642 transitions. [2024-11-10 14:33:37,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8242971887550201 [2024-11-10 14:33:37,414 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 628 flow. Second operand 6 states and 1642 transitions. [2024-11-10 14:33:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 396 transitions, 1114 flow [2024-11-10 14:33:37,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 396 transitions, 1112 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:37,420 INFO L231 Difference]: Finished difference. Result has 308 places, 300 transitions, 636 flow [2024-11-10 14:33:37,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=308, PETRI_TRANSITIONS=300} [2024-11-10 14:33:37,423 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, 5 predicate places. [2024-11-10 14:33:37,423 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 300 transitions, 636 flow [2024-11-10 14:33:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.5) internal successors, (1503), 6 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:37,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:37,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:33:37,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:37,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1688730989, now seen corresponding path program 1 times [2024-11-10 14:33:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232016963] [2024-11-10 14:33:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232016963] [2024-11-10 14:33:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232016963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357023847] [2024-11-10 14:33:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:37,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:37,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 332 [2024-11-10 14:33:37,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 300 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:37,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:37,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 332 [2024-11-10 14:33:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:40,718 INFO L124 PetriNetUnfolderBase]: 6249/32202 cut-off events. [2024-11-10 14:33:40,718 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2024-11-10 14:33:40,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42160 conditions, 32202 events. 6249/32202 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 447431 event pairs, 2376 based on Foata normal form. 0/28815 useless extension candidates. Maximal degree in co-relation 42153. Up to 5556 conditions per place. [2024-11-10 14:33:40,929 INFO L140 encePairwiseOnDemand]: 325/332 looper letters, 74 selfloop transitions, 5 changer transitions 0/338 dead transitions. [2024-11-10 14:33:40,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 338 transitions, 881 flow [2024-11-10 14:33:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-11-10 14:33:40,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8644578313253012 [2024-11-10 14:33:40,932 INFO L175 Difference]: Start difference. First operand has 308 places, 300 transitions, 636 flow. Second operand 3 states and 861 transitions. [2024-11-10 14:33:40,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 338 transitions, 881 flow [2024-11-10 14:33:40,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 338 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:40,938 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 668 flow [2024-11-10 14:33:40,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2024-11-10 14:33:40,939 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, 4 predicate places. [2024-11-10 14:33:40,940 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 668 flow [2024-11-10 14:33:40,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:40,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:40,940 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:40,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:33:40,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:40,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2069206722, now seen corresponding path program 1 times [2024-11-10 14:33:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568564119] [2024-11-10 14:33:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568564119] [2024-11-10 14:33:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568564119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522690895] [2024-11-10 14:33:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:41,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:41,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:41,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:33:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:41,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:33:41,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:41,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522690895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-10 14:33:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598011767] [2024-11-10 14:33:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:41,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:41,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:41,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:41,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:41,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 332 [2024-11-10 14:33:41,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:41,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:41,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 332 [2024-11-10 14:33:41,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:45,478 INFO L124 PetriNetUnfolderBase]: 9743/43520 cut-off events. [2024-11-10 14:33:45,478 INFO L125 PetriNetUnfolderBase]: For 2189/2218 co-relation queries the response was YES. [2024-11-10 14:33:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60733 conditions, 43520 events. 9743/43520 cut-off events. For 2189/2218 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 619624 event pairs, 7040 based on Foata normal form. 24/38690 useless extension candidates. Maximal degree in co-relation 60725. Up to 12782 conditions per place. [2024-11-10 14:33:45,894 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 68 selfloop transitions, 8 changer transitions 0/335 dead transitions. [2024-11-10 14:33:45,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 335 transitions, 892 flow [2024-11-10 14:33:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2024-11-10 14:33:45,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8493975903614458 [2024-11-10 14:33:45,896 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 668 flow. Second operand 3 states and 846 transitions. [2024-11-10 14:33:45,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 335 transitions, 892 flow [2024-11-10 14:33:45,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 335 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:45,906 INFO L231 Difference]: Finished difference. Result has 309 places, 311 transitions, 724 flow [2024-11-10 14:33:45,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=309, PETRI_TRANSITIONS=311} [2024-11-10 14:33:45,907 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, 6 predicate places. [2024-11-10 14:33:45,907 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 311 transitions, 724 flow [2024-11-10 14:33:45,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:45,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:45,908 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:45,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:33:46,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 14:33:46,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:46,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1640919143, now seen corresponding path program 1 times [2024-11-10 14:33:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022606878] [2024-11-10 14:33:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022606878] [2024-11-10 14:33:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022606878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:46,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875396766] [2024-11-10 14:33:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:46,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:46,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:46,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:46,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:33:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:46,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:33:46,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:46,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 14:33:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:46,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875396766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:46,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:46,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-10 14:33:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458358707] [2024-11-10 14:33:46,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:46,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:46,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 332 [2024-11-10 14:33:46,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 311 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:46,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:46,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 332 [2024-11-10 14:33:46,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:49,616 INFO L124 PetriNetUnfolderBase]: 4997/30672 cut-off events. [2024-11-10 14:33:49,616 INFO L125 PetriNetUnfolderBase]: For 1071/1116 co-relation queries the response was YES. [2024-11-10 14:33:49,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40541 conditions, 30672 events. 4997/30672 cut-off events. For 1071/1116 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 440990 event pairs, 2925 based on Foata normal form. 69/28163 useless extension candidates. Maximal degree in co-relation 40532. Up to 7053 conditions per place. [2024-11-10 14:33:49,864 INFO L140 encePairwiseOnDemand]: 314/332 looper letters, 47 selfloop transitions, 18 changer transitions 0/339 dead transitions. [2024-11-10 14:33:49,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 339 transitions, 909 flow [2024-11-10 14:33:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:33:49,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8694779116465864 [2024-11-10 14:33:49,878 INFO L175 Difference]: Start difference. First operand has 309 places, 311 transitions, 724 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:33:49,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 339 transitions, 909 flow [2024-11-10 14:33:49,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 339 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:49,898 INFO L231 Difference]: Finished difference. Result has 310 places, 324 transitions, 810 flow [2024-11-10 14:33:49,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=310, PETRI_TRANSITIONS=324} [2024-11-10 14:33:49,899 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, 7 predicate places. [2024-11-10 14:33:49,900 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 324 transitions, 810 flow [2024-11-10 14:33:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:49,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:49,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:49,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:33:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:50,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:33:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash -112760127, now seen corresponding path program 1 times [2024-11-10 14:33:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985550398] [2024-11-10 14:33:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985550398] [2024-11-10 14:33:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985550398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259064688] [2024-11-10 14:33:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:50,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:50,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 332 [2024-11-10 14:33:50,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 324 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:50,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:50,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 332 [2024-11-10 14:33:50,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:04,788 INFO L124 PetriNetUnfolderBase]: 39028/138209 cut-off events. [2024-11-10 14:34:04,788 INFO L125 PetriNetUnfolderBase]: For 23495/24176 co-relation queries the response was YES. [2024-11-10 14:34:05,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229452 conditions, 138209 events. 39028/138209 cut-off events. For 23495/24176 co-relation queries the response was YES. Maximal size of possible extension queue 3463. Compared 2167624 event pairs, 13510 based on Foata normal form. 24/125059 useless extension candidates. Maximal degree in co-relation 229442. Up to 32979 conditions per place. [2024-11-10 14:34:05,892 INFO L140 encePairwiseOnDemand]: 297/332 looper letters, 132 selfloop transitions, 26 changer transitions 0/398 dead transitions. [2024-11-10 14:34:05,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 398 transitions, 1369 flow [2024-11-10 14:34:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:34:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:34:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2024-11-10 14:34:05,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8363453815261044 [2024-11-10 14:34:05,895 INFO L175 Difference]: Start difference. First operand has 310 places, 324 transitions, 810 flow. Second operand 3 states and 833 transitions. [2024-11-10 14:34:05,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 398 transitions, 1369 flow [2024-11-10 14:34:05,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 398 transitions, 1333 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:34:05,950 INFO L231 Difference]: Finished difference. Result has 313 places, 350 transitions, 1018 flow [2024-11-10 14:34:05,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=313, PETRI_TRANSITIONS=350} [2024-11-10 14:34:05,951 INFO L277 CegarLoopForPetriNet]: 303 programPoint places, 10 predicate places. [2024-11-10 14:34:05,952 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 350 transitions, 1018 flow [2024-11-10 14:34:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:05,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:05,953 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:34:05,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:34:05,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:34:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 397389007, now seen corresponding path program 1 times [2024-11-10 14:34:05,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:05,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679227292] [2024-11-10 14:34:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:34:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679227292] [2024-11-10 14:34:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679227292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:34:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:34:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:34:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319241695] [2024-11-10 14:34:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:34:06,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:34:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:34:06,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:34:06,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 332 [2024-11-10 14:34:06,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 350 transitions, 1018 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:34:06,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:06,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 332 [2024-11-10 14:34:06,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:10,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([966] L906-3-->L906: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][258], [691#(= |#race~global~0| 0), Black: 318#true, 302#true, 304#true, 117#L897-15true, 263#L906true, 306#true, Black: 660#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 496#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|), Black: 689#true, 694#true, Black: 310#(= |ULTIMATE.start_main_~i~0#1| 0), 163#L916-2true]) [2024-11-10 14:34:10,974 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-10 14:34:10,974 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:34:10,974 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:34:10,974 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-10 14:34:12,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([966] L906-3-->L906: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][258], [Black: 318#true, 162#L897-10true, 302#true, 304#true, 263#L906true, 306#true, Black: 660#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 496#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|), Black: 691#(= |#race~global~0| 0), 694#true, 689#true, Black: 310#(= |ULTIMATE.start_main_~i~0#1| 0), 163#L916-2true]) [2024-11-10 14:34:12,543 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-11-10 14:34:12,543 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:34:12,543 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:34:12,543 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:34:13,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([966] L906-3-->L906: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][258], [Black: 318#true, 302#true, 213#L897-4true, 304#true, 263#L906true, 306#true, Black: 660#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 496#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|), Black: 691#(= |#race~global~0| 0), 694#true, 689#true, Black: 310#(= |ULTIMATE.start_main_~i~0#1| 0), 163#L916-2true]) [2024-11-10 14:34:13,894 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-10 14:34:13,894 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:34:13,894 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:34:13,894 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:34:15,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([966] L906-3-->L906: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][258], [Black: 318#true, 302#true, 213#L897-4true, 304#true, 263#L906true, 306#true, Black: 660#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 496#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|), Black: 691#(= |#race~global~0| 0), 689#true, 694#true, Black: 310#(= |ULTIMATE.start_main_~i~0#1| 0), 129#L917true]) [2024-11-10 14:34:15,002 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-11-10 14:34:15,003 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-10 14:34:15,003 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-10 14:34:15,003 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event