./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.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_06-cond_racing1.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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:32:30,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:32:30,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:32:30,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:32:30,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:32:30,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:32:30,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:32:30,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:32:30,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:32:30,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:32:30,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:32:30,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:32:30,181 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:32:30,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:32:30,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:32:30,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:32:30,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:32:30,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:32:30,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:32:30,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:32:30,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:32:30,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:32:30,189 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:32:30,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:32:30,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:32:30,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:32:30,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:32:30,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:32:30,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:32:30,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:32:30,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:32:30,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:30,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:32:30,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:32:30,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:32:30,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:32:30,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:32:30,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:32:30,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:32:30,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:32:30,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:32:30,194 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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2024-11-10 14:32:30,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:32:30,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:32:30,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:32:30,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:32:30,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:32:30,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-10 14:32:31,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:32:32,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:32:32,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-10 14:32:32,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d50eb531/dae7ceec50494ce3a71e603c56aaa380/FLAG943c35b3f [2024-11-10 14:32:32,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d50eb531/dae7ceec50494ce3a71e603c56aaa380 [2024-11-10 14:32:32,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:32:32,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:32:32,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:32,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:32:32,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:32:32,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a55f145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32, skipping insertion in model container [2024-11-10 14:32:32,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:32:32,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:32,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:32:32,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:32,821 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:32:32,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32 WrapperNode [2024-11-10 14:32:32,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:32,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:32,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:32:32,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:32:32,830 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:32:32" (1/1) ... [2024-11-10 14:32:32,856 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:32:32" (1/1) ... [2024-11-10 14:32:32,886 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-10 14:32:32,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:32,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:32:32,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:32:32,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:32:32,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:32:32,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:32:32,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:32:32,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:32:32,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (1/1) ... [2024-11-10 14:32:32,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:32,980 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:32:32,987 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:32:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:32:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:32:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:32:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:32:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:32:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:32:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:32:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:32:33,042 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:32:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:32:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:32:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:32:33,045 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:32:33,219 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:32:33,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:32:33,451 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:32:33,452 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:32:33,499 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:32:33,499 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:32:33,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:32:33,534 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:32:33,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:33 BoogieIcfgContainer [2024-11-10 14:32:33,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:32:33,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:32:33,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:32:33,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:32:33,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:32:32" (1/3) ... [2024-11-10 14:32:33,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185a67e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:33, skipping insertion in model container [2024-11-10 14:32:33,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:32" (2/3) ... [2024-11-10 14:32:33,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185a67e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:33, skipping insertion in model container [2024-11-10 14:32:33,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:33" (3/3) ... [2024-11-10 14:32:33,544 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2024-11-10 14:32:33,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:32:33,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:32:33,557 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:32:33,613 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:32:33,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 166 transitions, 339 flow [2024-11-10 14:32:33,734 INFO L124 PetriNetUnfolderBase]: 25/238 cut-off events. [2024-11-10 14:32:33,735 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:32:33,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 238 events. 25/238 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 715 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 124. Up to 6 conditions per place. [2024-11-10 14:32:33,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 166 transitions, 339 flow [2024-11-10 14:32:33,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 166 transitions, 339 flow [2024-11-10 14:32:33,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:33,777 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;@1f36d12e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:33,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 14:32:33,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:33,798 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2024-11-10 14:32:33,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:33,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:33,801 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] [2024-11-10 14:32:33,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:33,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2123364355, now seen corresponding path program 1 times [2024-11-10 14:32:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002917508] [2024-11-10 14:32:33,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:34,794 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:32:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002917508] [2024-11-10 14:32:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002917508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278442914] [2024-11-10 14:32:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:34,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:35,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 166 [2024-11-10 14:32:35,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 166 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 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:32:35,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 166 [2024-11-10 14:32:35,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,316 INFO L124 PetriNetUnfolderBase]: 129/867 cut-off events. [2024-11-10 14:32:35,316 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:32:35,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 867 events. 129/867 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5279 event pairs, 40 based on Foata normal form. 152/929 useless extension candidates. Maximal degree in co-relation 1001. Up to 188 conditions per place. [2024-11-10 14:32:35,324 INFO L140 encePairwiseOnDemand]: 148/166 looper letters, 48 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-11-10 14:32:35,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 175 transitions, 463 flow [2024-11-10 14:32:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2024-11-10 14:32:35,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8313253012048193 [2024-11-10 14:32:35,348 INFO L175 Difference]: Start difference. First operand has 153 places, 166 transitions, 339 flow. Second operand 6 states and 828 transitions. [2024-11-10 14:32:35,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 175 transitions, 463 flow [2024-11-10 14:32:35,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 175 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:35,356 INFO L231 Difference]: Finished difference. Result has 155 places, 151 transitions, 319 flow [2024-11-10 14:32:35,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=155, PETRI_TRANSITIONS=151} [2024-11-10 14:32:35,363 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 2 predicate places. [2024-11-10 14:32:35,363 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 319 flow [2024-11-10 14:32:35,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 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:32:35,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:35,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:32:35,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:35,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1203701937, now seen corresponding path program 1 times [2024-11-10 14:32:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136000562] [2024-11-10 14:32:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:35,407 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:32:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:35,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136000562] [2024-11-10 14:32:35,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136000562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:35,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:35,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288753823] [2024-11-10 14:32:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:35,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 166 [2024-11-10 14:32:35,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:32:35,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 166 [2024-11-10 14:32:35,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,548 INFO L124 PetriNetUnfolderBase]: 67/664 cut-off events. [2024-11-10 14:32:35,549 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:32:35,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 664 events. 67/664 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3638 event pairs, 29 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 724. Up to 116 conditions per place. [2024-11-10 14:32:35,555 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 22 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-10 14:32:35,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 379 flow [2024-11-10 14:32:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2024-11-10 14:32:35,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8634538152610441 [2024-11-10 14:32:35,558 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 319 flow. Second operand 3 states and 430 transitions. [2024-11-10 14:32:35,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 157 transitions, 379 flow [2024-11-10 14:32:35,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 157 transitions, 369 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:35,563 INFO L231 Difference]: Finished difference. Result has 153 places, 151 transitions, 317 flow [2024-11-10 14:32:35,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=153, PETRI_TRANSITIONS=151} [2024-11-10 14:32:35,564 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2024-11-10 14:32:35,564 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 151 transitions, 317 flow [2024-11-10 14:32:35,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:32:35,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:32:35,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:35,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash 321602459, now seen corresponding path program 1 times [2024-11-10 14:32:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096223014] [2024-11-10 14:32:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:35,617 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:32:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:35,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096223014] [2024-11-10 14:32:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096223014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:35,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:35,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488679203] [2024-11-10 14:32:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:35,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:35,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 166 [2024-11-10 14:32:35,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 151 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:32:35,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 166 [2024-11-10 14:32:35,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:35,795 INFO L124 PetriNetUnfolderBase]: 134/911 cut-off events. [2024-11-10 14:32:35,795 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:32:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 911 events. 134/911 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5560 event pairs, 33 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1113. Up to 130 conditions per place. [2024-11-10 14:32:35,800 INFO L140 encePairwiseOnDemand]: 157/166 looper letters, 30 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-10 14:32:35,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 418 flow [2024-11-10 14:32:35,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2024-11-10 14:32:35,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614457831325302 [2024-11-10 14:32:35,802 INFO L175 Difference]: Start difference. First operand has 153 places, 151 transitions, 317 flow. Second operand 3 states and 429 transitions. [2024-11-10 14:32:35,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 418 flow [2024-11-10 14:32:35,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 164 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:35,806 INFO L231 Difference]: Finished difference. Result has 153 places, 153 transitions, 351 flow [2024-11-10 14:32:35,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=153, PETRI_TRANSITIONS=153} [2024-11-10 14:32:35,807 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2024-11-10 14:32:35,807 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 153 transitions, 351 flow [2024-11-10 14:32:35,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:32:35,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:35,808 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] [2024-11-10 14:32:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:32:35,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:35,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1581728777, now seen corresponding path program 1 times [2024-11-10 14:32:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:35,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736779592] [2024-11-10 14:32:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:35,854 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:32:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736779592] [2024-11-10 14:32:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736779592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593851545] [2024-11-10 14:32:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:35,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:35,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 166 [2024-11-10 14:32:35,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 153 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:32:35,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:35,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 166 [2024-11-10 14:32:35,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:36,032 INFO L124 PetriNetUnfolderBase]: 139/983 cut-off events. [2024-11-10 14:32:36,033 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-10 14:32:36,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 983 events. 139/983 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6297 event pairs, 57 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1281. Up to 220 conditions per place. [2024-11-10 14:32:36,039 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 27 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2024-11-10 14:32:36,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 160 transitions, 431 flow [2024-11-10 14:32:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2024-11-10 14:32:36,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8534136546184738 [2024-11-10 14:32:36,041 INFO L175 Difference]: Start difference. First operand has 153 places, 153 transitions, 351 flow. Second operand 3 states and 425 transitions. [2024-11-10 14:32:36,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 160 transitions, 431 flow [2024-11-10 14:32:36,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 160 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:36,046 INFO L231 Difference]: Finished difference. Result has 155 places, 156 transitions, 371 flow [2024-11-10 14:32:36,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=155, PETRI_TRANSITIONS=156} [2024-11-10 14:32:36,048 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 2 predicate places. [2024-11-10 14:32:36,048 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 156 transitions, 371 flow [2024-11-10 14:32:36,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:32:36,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:36,049 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, 1, 1, 1] [2024-11-10 14:32:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:32:36,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-10 14:32:36,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1199061986, now seen corresponding path program 1 times [2024-11-10 14:32:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:36,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623349821] [2024-11-10 14:32:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:36,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:36,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:36,141 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:36,142 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-10 14:32:36,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-10 14:32:36,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-10 14:32:36,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-10 14:32:36,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-10 14:32:36,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-10 14:32:36,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-10 14:32:36,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-10 14:32:36,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-10 14:32:36,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-10 14:32:36,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-10 14:32:36,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-10 14:32:36,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:32:36,148 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 14:32:36,151 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:36,151 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:32:36,178 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:32:36,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 217 transitions, 450 flow [2024-11-10 14:32:36,224 INFO L124 PetriNetUnfolderBase]: 43/390 cut-off events. [2024-11-10 14:32:36,224 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:32:36,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 390 events. 43/390 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1357 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 240. Up to 9 conditions per place. [2024-11-10 14:32:36,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 217 transitions, 450 flow [2024-11-10 14:32:36,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 217 transitions, 450 flow [2024-11-10 14:32:36,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:36,233 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;@1f36d12e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:36,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:32:36,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:36,261 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2024-11-10 14:32:36,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:36,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:36,262 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] [2024-11-10 14:32:36,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:36,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -741757700, now seen corresponding path program 1 times [2024-11-10 14:32:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:36,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841768716] [2024-11-10 14:32:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:36,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:36,550 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:32:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841768716] [2024-11-10 14:32:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841768716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:36,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141176608] [2024-11-10 14:32:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:36,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:36,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:36,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 217 [2024-11-10 14:32:36,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 217 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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:32:36,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:36,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 217 [2024-11-10 14:32:36,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:37,528 INFO L124 PetriNetUnfolderBase]: 1710/6320 cut-off events. [2024-11-10 14:32:37,529 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-10 14:32:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9035 conditions, 6320 events. 1710/6320 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 61965 event pairs, 222 based on Foata normal form. 1927/7657 useless extension candidates. Maximal degree in co-relation 1185. Up to 1840 conditions per place. [2024-11-10 14:32:37,576 INFO L140 encePairwiseOnDemand]: 193/217 looper letters, 80 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2024-11-10 14:32:37,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 244 transitions, 674 flow [2024-11-10 14:32:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1112 transitions. [2024-11-10 14:32:37,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8540706605222734 [2024-11-10 14:32:37,579 INFO L175 Difference]: Start difference. First operand has 199 places, 217 transitions, 450 flow. Second operand 6 states and 1112 transitions. [2024-11-10 14:32:37,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 244 transitions, 674 flow [2024-11-10 14:32:37,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 244 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:37,583 INFO L231 Difference]: Finished difference. Result has 201 places, 196 transitions, 418 flow [2024-11-10 14:32:37,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=201, PETRI_TRANSITIONS=196} [2024-11-10 14:32:37,585 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 2 predicate places. [2024-11-10 14:32:37,585 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 196 transitions, 418 flow [2024-11-10 14:32:37,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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:32:37,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:37,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:37,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:32:37,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:37,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2125413743, now seen corresponding path program 1 times [2024-11-10 14:32:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:37,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129412990] [2024-11-10 14:32:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:37,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:37,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129412990] [2024-11-10 14:32:37,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129412990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:37,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:37,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:37,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131083913] [2024-11-10 14:32:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:37,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:37,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 217 [2024-11-10 14:32:37,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 196 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:32:37,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:37,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 217 [2024-11-10 14:32:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:38,271 INFO L124 PetriNetUnfolderBase]: 987/5297 cut-off events. [2024-11-10 14:32:38,272 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-11-10 14:32:38,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 5297 events. 987/5297 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 52273 event pairs, 666 based on Foata normal form. 1/4721 useless extension candidates. Maximal degree in co-relation 5154. Up to 1468 conditions per place. [2024-11-10 14:32:38,310 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 31 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-11-10 14:32:38,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 203 transitions, 500 flow [2024-11-10 14:32:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-11-10 14:32:38,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8448540706605223 [2024-11-10 14:32:38,312 INFO L175 Difference]: Start difference. First operand has 201 places, 196 transitions, 418 flow. Second operand 3 states and 550 transitions. [2024-11-10 14:32:38,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 203 transitions, 500 flow [2024-11-10 14:32:38,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 203 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:38,316 INFO L231 Difference]: Finished difference. Result has 199 places, 197 transitions, 420 flow [2024-11-10 14:32:38,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=199, PETRI_TRANSITIONS=197} [2024-11-10 14:32:38,318 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 0 predicate places. [2024-11-10 14:32:38,318 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 197 transitions, 420 flow [2024-11-10 14:32:38,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:32:38,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:38,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:38,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:32:38,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:38,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2067936227, now seen corresponding path program 1 times [2024-11-10 14:32:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910633655] [2024-11-10 14:32:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:38,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910633655] [2024-11-10 14:32:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910633655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:38,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:38,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650639849] [2024-11-10 14:32:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:38,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:38,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:38,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:38,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 217 [2024-11-10 14:32:38,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 197 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:32:38,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:38,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 217 [2024-11-10 14:32:38,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:39,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 197#true, 212#true]) [2024-11-10 14:32:39,264 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is not cut-off event [2024-11-10 14:32:39,264 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-10 14:32:39,264 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-10 14:32:39,264 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-10 14:32:39,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 16#t_funENTRYtrue, 197#true, 212#true]) [2024-11-10 14:32:39,777 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-10 14:32:39,777 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-10 14:32:39,777 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:39,778 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:39,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 88#L938true, 197#true, 212#true]) [2024-11-10 14:32:39,778 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-10 14:32:39,778 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-10 14:32:39,778 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:32:39,778 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:32:39,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 157#t_funENTRYtrue, 198#true, 212#true]) [2024-11-10 14:32:39,786 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-10 14:32:39,786 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:39,786 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:39,786 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-10 14:32:39,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, 24#L938true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true]) [2024-11-10 14:32:39,820 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-11-10 14:32:39,820 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:32:39,820 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:32:39,820 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:32:40,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 141#L939-36true, 197#true, 212#true]) [2024-11-10 14:32:40,013 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-10 14:32:40,013 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:32:40,013 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:32:40,013 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:32:40,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 96#L939-36true, 198#true, 212#true]) [2024-11-10 14:32:40,019 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-10 14:32:40,019 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:32:40,019 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:32:40,019 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:32:40,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 208#true, 139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 19#L939-34true, 197#true]) [2024-11-10 14:32:40,058 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-11-10 14:32:40,058 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:32:40,058 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:32:40,058 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-10 14:32:40,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 31#L939-33true, 197#true]) [2024-11-10 14:32:40,081 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-11-10 14:32:40,081 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:32:40,081 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:32:40,081 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:32:40,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 19#L939-34true, 197#true, 212#true]) [2024-11-10 14:32:40,081 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is not cut-off event [2024-11-10 14:32:40,082 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-11-10 14:32:40,082 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-11-10 14:32:40,082 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-11-10 14:32:40,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 166#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 197#true, 212#true]) [2024-11-10 14:32:40,082 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-11-10 14:32:40,082 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:32:40,082 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:32:40,082 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:32:40,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 31#L939-33true, 197#true, 212#true]) [2024-11-10 14:32:40,107 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-11-10 14:32:40,107 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-10 14:32:40,107 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2024-11-10 14:32:40,107 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-10 14:32:40,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [5#L939-29true, 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 197#true, 212#true]) [2024-11-10 14:32:40,167 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-10 14:32:40,167 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:32:40,167 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-10 14:32:40,167 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-10 14:32:40,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [38#L939-29true, 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true]) [2024-11-10 14:32:40,188 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-11-10 14:32:40,188 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-10 14:32:40,188 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-10 14:32:40,188 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-10 14:32:40,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 104#L939-23true, 197#true, 212#true]) [2024-11-10 14:32:40,228 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:32:40,229 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:32:40,229 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:32:40,229 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:32:40,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 121#L939-23true, 212#true]) [2024-11-10 14:32:40,239 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2024-11-10 14:32:40,239 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2024-11-10 14:32:40,239 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-11-10 14:32:40,239 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-11-10 14:32:40,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 190#L939-17true, 197#true, 212#true]) [2024-11-10 14:32:40,262 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-10 14:32:40,262 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:32:40,263 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:32:40,263 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:32:40,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 135#L939-17true, 198#true, 212#true]) [2024-11-10 14:32:40,270 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is not cut-off event [2024-11-10 14:32:40,270 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is not cut-off event [2024-11-10 14:32:40,270 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-11-10 14:32:40,270 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-11-10 14:32:40,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 134#L939-15true]) [2024-11-10 14:32:40,270 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:32:40,271 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:32:40,271 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,271 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 22#L939-15true, 197#true, 212#true]) [2024-11-10 14:32:40,282 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-11-10 14:32:40,282 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-10 14:32:40,282 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-10 14:32:40,282 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-10 14:32:40,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 155#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 197#true, 212#true]) [2024-11-10 14:32:40,282 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,282 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,282 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:32:40,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 148#L939-14true]) [2024-11-10 14:32:40,283 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 134#L939-15true, 212#true]) [2024-11-10 14:32:40,283 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-10 14:32:40,283 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-10 14:32:40,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true, 94#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-10 14:32:40,284 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,284 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,284 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:32:40,284 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 159#L939-14true, 197#true, 212#true]) [2024-11-10 14:32:40,351 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2024-11-10 14:32:40,351 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2024-11-10 14:32:40,352 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-10 14:32:40,352 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-10 14:32:40,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 148#L939-14true, 212#true]) [2024-11-10 14:32:40,352 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2024-11-10 14:32:40,352 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-10 14:32:40,352 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2024-11-10 14:32:40,352 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-10 14:32:40,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, 42#L939-10true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true]) [2024-11-10 14:32:40,375 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2024-11-10 14:32:40,375 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-10 14:32:40,375 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-10 14:32:40,375 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is not cut-off event [2024-11-10 14:32:40,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 159#L939-14true, 197#true]) [2024-11-10 14:32:40,384 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 22#L939-15true, 197#true]) [2024-11-10 14:32:40,384 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:40,384 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:32:40,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 99#L939-10true, 197#true, 212#true]) [2024-11-10 14:32:40,385 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2024-11-10 14:32:40,385 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:32:40,385 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:32:40,385 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:32:40,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 73#L939-4true, 197#true, 212#true]) [2024-11-10 14:32:40,389 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-10 14:32:40,389 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-10 14:32:40,389 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-10 14:32:40,389 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-10 14:32:40,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 131#L939-4true, 198#true, 212#true]) [2024-11-10 14:32:40,393 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2024-11-10 14:32:40,393 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is not cut-off event [2024-11-10 14:32:40,393 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-10 14:32:40,393 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-10 14:32:40,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 12#L940true, 197#true, 212#true]) [2024-11-10 14:32:40,401 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-10 14:32:40,401 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:32:40,401 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:32:40,401 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-10 14:32:40,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 11#L940true, 198#true, 212#true]) [2024-11-10 14:32:40,404 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is not cut-off event [2024-11-10 14:32:40,404 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-10 14:32:40,404 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-10 14:32:40,404 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-10 14:32:40,424 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 197#true, 212#true]) [2024-11-10 14:32:40,424 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-11-10 14:32:40,424 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-10 14:32:40,424 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-10 14:32:40,424 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-10 14:32:40,424 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-10 14:32:40,431 INFO L124 PetriNetUnfolderBase]: 4692/16173 cut-off events. [2024-11-10 14:32:40,431 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2024-11-10 14:32:40,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23487 conditions, 16173 events. 4692/16173 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 183380 event pairs, 1302 based on Foata normal form. 0/14298 useless extension candidates. Maximal degree in co-relation 23425. Up to 3640 conditions per place. [2024-11-10 14:32:40,546 INFO L140 encePairwiseOnDemand]: 198/217 looper letters, 58 selfloop transitions, 14 changer transitions 0/230 dead transitions. [2024-11-10 14:32:40,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 641 flow [2024-11-10 14:32:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2024-11-10 14:32:40,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8509984639016898 [2024-11-10 14:32:40,548 INFO L175 Difference]: Start difference. First operand has 199 places, 197 transitions, 420 flow. Second operand 3 states and 554 transitions. [2024-11-10 14:32:40,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 641 flow [2024-11-10 14:32:40,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:32:40,553 INFO L231 Difference]: Finished difference. Result has 202 places, 211 transitions, 540 flow [2024-11-10 14:32:40,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=202, PETRI_TRANSITIONS=211} [2024-11-10 14:32:40,554 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 3 predicate places. [2024-11-10 14:32:40,555 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 211 transitions, 540 flow [2024-11-10 14:32:40,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:32:40,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:40,556 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] [2024-11-10 14:32:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:32:40,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:40,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -374566072, now seen corresponding path program 1 times [2024-11-10 14:32:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577368237] [2024-11-10 14:32:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:40,609 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:32:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577368237] [2024-11-10 14:32:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577368237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656212074] [2024-11-10 14:32:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:40,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 217 [2024-11-10 14:32:40,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 211 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:32:40,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:40,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 217 [2024-11-10 14:32:40,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:41,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-10 14:32:41,696 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is not cut-off event [2024-11-10 14:32:41,696 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-10 14:32:41,696 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-10 14:32:41,696 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-10 14:32:42,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 16#t_funENTRYtrue, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-10 14:32:42,419 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-10 14:32:42,419 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:42,419 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-10 14:32:42,420 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:42,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 157#t_funENTRYtrue, 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,425 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-10 14:32:42,425 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:42,425 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-10 14:32:42,425 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:32:42,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, 24#L938true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,449 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-11-10 14:32:42,449 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:32:42,449 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:32:42,449 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:32:42,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 96#L939-36true, 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,535 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-10 14:32:42,535 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:32:42,535 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:32:42,535 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:32:42,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 114#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 199#true, Black: 214#(= |#race~global~0| 0), 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,662 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2024-11-10 14:32:42,662 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:32:42,662 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:32:42,663 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:32:42,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, 8#L939-26true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,791 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-11-10 14:32:42,791 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2024-11-10 14:32:42,791 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-11-10 14:32:42,792 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-11-10 14:32:42,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 198#true, 217#true, 121#L939-23true, 212#true]) [2024-11-10 14:32:42,792 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:32:42,792 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:32:42,792 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:32:42,792 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:32:42,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 135#L939-17true, 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,858 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-10 14:32:42,858 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:32:42,858 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:32:42,858 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-10 14:32:42,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 212#true, 134#L939-15true, 198#true, 217#true]) [2024-11-10 14:32:42,884 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:32:42,884 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:42,884 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:42,884 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:32:42,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, 42#L939-10true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,934 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-10 14:32:42,934 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:32:42,934 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:32:42,934 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-10 14:32:42,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 99#L939-10true, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-10 14:32:42,944 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2024-11-10 14:32:42,944 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is not cut-off event [2024-11-10 14:32:42,944 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-10 14:32:42,944 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-10 14:32:42,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [214#(= |#race~global~0| 0), 139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, Black: 212#true, 22#L939-15true, 197#true, 217#true]) [2024-11-10 14:32:42,962 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-10 14:32:42,962 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:42,962 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:32:42,962 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-10 14:32:42,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 131#L939-4true, 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,968 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-10 14:32:42,968 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-10 14:32:42,968 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-10 14:32:42,968 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-10 14:32:42,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, Black: 214#(= |#race~global~0| 0), 73#L939-4true, 197#true, 217#true, 212#true]) [2024-11-10 14:32:42,976 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2024-11-10 14:32:42,976 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is not cut-off event [2024-11-10 14:32:42,976 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-10 14:32:42,976 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-10 14:32:42,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 11#L940true, 198#true, 217#true, 212#true]) [2024-11-10 14:32:42,995 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-10 14:32:42,995 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:32:42,995 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-10 14:32:42,995 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:32:42,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, Black: 214#(= |#race~global~0| 0), 12#L940true, 197#true, 217#true, 212#true]) [2024-11-10 14:32:42,999 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is not cut-off event [2024-11-10 14:32:42,999 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-10 14:32:42,999 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-10 14:32:42,999 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-10 14:32:43,009 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-10 14:32:43,010 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-11-10 14:32:43,010 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-10 14:32:43,010 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-10 14:32:43,010 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-10 14:32:43,010 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-10 14:32:43,034 INFO L124 PetriNetUnfolderBase]: 4837/19352 cut-off events. [2024-11-10 14:32:43,035 INFO L125 PetriNetUnfolderBase]: For 4548/4745 co-relation queries the response was YES. [2024-11-10 14:32:43,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30772 conditions, 19352 events. 4837/19352 cut-off events. For 4548/4745 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 238307 event pairs, 2184 based on Foata normal form. 49/17354 useless extension candidates. Maximal degree in co-relation 15688. Up to 6095 conditions per place. [2024-11-10 14:32:43,179 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 52 selfloop transitions, 14 changer transitions 0/235 dead transitions. [2024-11-10 14:32:43,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 235 transitions, 758 flow [2024-11-10 14:32:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2024-11-10 14:32:43,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417818740399385 [2024-11-10 14:32:43,182 INFO L175 Difference]: Start difference. First operand has 202 places, 211 transitions, 540 flow. Second operand 3 states and 548 transitions. [2024-11-10 14:32:43,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 235 transitions, 758 flow [2024-11-10 14:32:43,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 235 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:43,196 INFO L231 Difference]: Finished difference. Result has 204 places, 223 transitions, 638 flow [2024-11-10 14:32:43,198 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=204, PETRI_TRANSITIONS=223} [2024-11-10 14:32:43,199 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 5 predicate places. [2024-11-10 14:32:43,199 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 223 transitions, 638 flow [2024-11-10 14:32:43,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:32:43,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:43,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:32:43,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1576991182, now seen corresponding path program 1 times [2024-11-10 14:32:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634212185] [2024-11-10 14:32:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:43,308 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:32:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634212185] [2024-11-10 14:32:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634212185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:32:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720962574] [2024-11-10 14:32:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:32:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:43,312 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:32:43,314 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:32:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:43,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:32:43,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:32:43,522 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:32:43,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:32:43,585 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:32:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720962574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:32:43,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:32:43,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:32:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632867369] [2024-11-10 14:32:43,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:32:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:32:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:32:43,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:32:43,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 217 [2024-11-10 14:32:43,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 223 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 171.1) internal successors, (1711), 10 states have internal predecessors, (1711), 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:32:43,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:43,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 217 [2024-11-10 14:32:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:44,247 INFO L124 PetriNetUnfolderBase]: 703/3085 cut-off events. [2024-11-10 14:32:44,247 INFO L125 PetriNetUnfolderBase]: For 379/396 co-relation queries the response was YES. [2024-11-10 14:32:44,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 3085 events. 703/3085 cut-off events. For 379/396 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 26746 event pairs, 14 based on Foata normal form. 106/3053 useless extension candidates. Maximal degree in co-relation 2369. Up to 478 conditions per place. [2024-11-10 14:32:44,267 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 72 selfloop transitions, 7 changer transitions 0/218 dead transitions. [2024-11-10 14:32:44,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 218 transitions, 740 flow [2024-11-10 14:32:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:32:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:32:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1602 transitions. [2024-11-10 14:32:44,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8202764976958525 [2024-11-10 14:32:44,275 INFO L175 Difference]: Start difference. First operand has 204 places, 223 transitions, 638 flow. Second operand 9 states and 1602 transitions. [2024-11-10 14:32:44,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 218 transitions, 740 flow [2024-11-10 14:32:44,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 218 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:44,283 INFO L231 Difference]: Finished difference. Result has 158 places, 162 transitions, 464 flow [2024-11-10 14:32:44,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=464, PETRI_PLACES=158, PETRI_TRANSITIONS=162} [2024-11-10 14:32:44,284 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -41 predicate places. [2024-11-10 14:32:44,284 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 464 flow [2024-11-10 14:32:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 171.1) internal successors, (1711), 10 states have internal predecessors, (1711), 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:32:44,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:44,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:32:44,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 14:32:44,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1569013903, now seen corresponding path program 1 times [2024-11-10 14:32:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715338993] [2024-11-10 14:32:44,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:32:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715338993] [2024-11-10 14:32:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715338993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119832971] [2024-11-10 14:32:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:44,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:44,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 217 [2024-11-10 14:32:44,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:32:44,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:44,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 217 [2024-11-10 14:32:44,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:44,737 INFO L124 PetriNetUnfolderBase]: 260/1337 cut-off events. [2024-11-10 14:32:44,737 INFO L125 PetriNetUnfolderBase]: For 459/480 co-relation queries the response was YES. [2024-11-10 14:32:44,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 1337 events. 260/1337 cut-off events. For 459/480 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8996 event pairs, 132 based on Foata normal form. 7/1250 useless extension candidates. Maximal degree in co-relation 2299. Up to 459 conditions per place. [2024-11-10 14:32:44,746 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 42 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2024-11-10 14:32:44,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 176 transitions, 616 flow [2024-11-10 14:32:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2024-11-10 14:32:44,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8202764976958525 [2024-11-10 14:32:44,749 INFO L175 Difference]: Start difference. First operand has 158 places, 162 transitions, 464 flow. Second operand 3 states and 534 transitions. [2024-11-10 14:32:44,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 176 transitions, 616 flow [2024-11-10 14:32:44,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 176 transitions, 601 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:44,754 INFO L231 Difference]: Finished difference. Result has 157 places, 170 transitions, 547 flow [2024-11-10 14:32:44,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=157, PETRI_TRANSITIONS=170} [2024-11-10 14:32:44,754 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -42 predicate places. [2024-11-10 14:32:44,755 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 170 transitions, 547 flow [2024-11-10 14:32:44,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:32:44,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:44,755 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:32:44,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1075319650, now seen corresponding path program 1 times [2024-11-10 14:32:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458666982] [2024-11-10 14:32:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:44,793 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:32:44,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:44,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458666982] [2024-11-10 14:32:44,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458666982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:44,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:44,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:44,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938779195] [2024-11-10 14:32:44,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:44,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:44,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:44,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:44,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:44,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 217 [2024-11-10 14:32:44,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 170 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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:32:44,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:44,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 217 [2024-11-10 14:32:44,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:45,053 INFO L124 PetriNetUnfolderBase]: 291/1412 cut-off events. [2024-11-10 14:32:45,053 INFO L125 PetriNetUnfolderBase]: For 1152/1187 co-relation queries the response was YES. [2024-11-10 14:32:45,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1412 events. 291/1412 cut-off events. For 1152/1187 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9665 event pairs, 134 based on Foata normal form. 9/1343 useless extension candidates. Maximal degree in co-relation 2759. Up to 501 conditions per place. [2024-11-10 14:32:45,061 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 49 selfloop transitions, 12 changer transitions 0/185 dead transitions. [2024-11-10 14:32:45,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 185 transitions, 736 flow [2024-11-10 14:32:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2024-11-10 14:32:45,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8218125960061444 [2024-11-10 14:32:45,064 INFO L175 Difference]: Start difference. First operand has 157 places, 170 transitions, 547 flow. Second operand 3 states and 535 transitions. [2024-11-10 14:32:45,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 185 transitions, 736 flow [2024-11-10 14:32:45,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 185 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:45,069 INFO L231 Difference]: Finished difference. Result has 159 places, 178 transitions, 633 flow [2024-11-10 14:32:45,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=159, PETRI_TRANSITIONS=178} [2024-11-10 14:32:45,071 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -40 predicate places. [2024-11-10 14:32:45,071 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 178 transitions, 633 flow [2024-11-10 14:32:45,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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:32:45,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:45,072 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:45,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:32:45,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:32:45,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2067034676, now seen corresponding path program 1 times [2024-11-10 14:32:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020646058] [2024-11-10 14:32:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:45,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:45,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:45,129 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:45,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-10 14:32:45,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-10 14:32:45,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-10 14:32:45,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-10 14:32:45,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:32:45,131 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:45,132 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:45,132 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:32:45,159 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:32:45,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 268 transitions, 563 flow [2024-11-10 14:32:45,223 INFO L124 PetriNetUnfolderBase]: 66/589 cut-off events. [2024-11-10 14:32:45,223 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:32:45,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 589 events. 66/589 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2243 event pairs, 1 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 398. Up to 16 conditions per place. [2024-11-10 14:32:45,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 268 transitions, 563 flow [2024-11-10 14:32:45,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 268 transitions, 563 flow [2024-11-10 14:32:45,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:45,234 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;@1f36d12e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:45,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:32:45,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:45,241 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2024-11-10 14:32:45,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:45,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:45,242 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] [2024-11-10 14:32:45,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:45,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1529095288, now seen corresponding path program 1 times [2024-11-10 14:32:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307547785] [2024-11-10 14:32:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:45,508 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:32:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307547785] [2024-11-10 14:32:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307547785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921837674] [2024-11-10 14:32:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:45,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:45,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:45,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:45,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 268 [2024-11-10 14:32:45,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 268 transitions, 563 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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:32:45,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:45,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 268 [2024-11-10 14:32:45,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:51,948 INFO L124 PetriNetUnfolderBase]: 18812/52887 cut-off events. [2024-11-10 14:32:51,948 INFO L125 PetriNetUnfolderBase]: For 1015/1015 co-relation queries the response was YES. [2024-11-10 14:32:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79300 conditions, 52887 events. 18812/52887 cut-off events. For 1015/1015 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 660566 event pairs, 2581 based on Foata normal form. 20346/68729 useless extension candidates. Maximal degree in co-relation 9096. Up to 18109 conditions per place. [2024-11-10 14:32:52,364 INFO L140 encePairwiseOnDemand]: 238/268 looper letters, 112 selfloop transitions, 5 changer transitions 0/313 dead transitions. [2024-11-10 14:32:52,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 313 transitions, 887 flow [2024-11-10 14:32:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1396 transitions. [2024-11-10 14:32:52,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8681592039800995 [2024-11-10 14:32:52,370 INFO L175 Difference]: Start difference. First operand has 245 places, 268 transitions, 563 flow. Second operand 6 states and 1396 transitions. [2024-11-10 14:32:52,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 313 transitions, 887 flow [2024-11-10 14:32:52,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 313 transitions, 887 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:52,383 INFO L231 Difference]: Finished difference. Result has 247 places, 241 transitions, 519 flow [2024-11-10 14:32:52,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=247, PETRI_TRANSITIONS=241} [2024-11-10 14:32:52,384 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 2 predicate places. [2024-11-10 14:32:52,384 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 241 transitions, 519 flow [2024-11-10 14:32:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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:32:52,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:52,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:52,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:32:52,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1367999215, now seen corresponding path program 1 times [2024-11-10 14:32:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039005809] [2024-11-10 14:32:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:52,422 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:32:52,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:52,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039005809] [2024-11-10 14:32:52,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039005809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:52,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:52,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718217676] [2024-11-10 14:32:52,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:52,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:52,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 268 [2024-11-10 14:32:52,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 241 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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:32:52,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:52,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 268 [2024-11-10 14:32:52,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:56,863 INFO L124 PetriNetUnfolderBase]: 10334/38429 cut-off events. [2024-11-10 14:32:56,864 INFO L125 PetriNetUnfolderBase]: For 1822/1822 co-relation queries the response was YES. [2024-11-10 14:32:56,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53572 conditions, 38429 events. 10334/38429 cut-off events. For 1822/1822 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 500348 event pairs, 8306 based on Foata normal form. 1/34733 useless extension candidates. Maximal degree in co-relation 38941. Up to 14117 conditions per place. [2024-11-10 14:32:57,094 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 39 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-11-10 14:32:57,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 617 flow [2024-11-10 14:32:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-10 14:32:57,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.832089552238806 [2024-11-10 14:32:57,097 INFO L175 Difference]: Start difference. First operand has 247 places, 241 transitions, 519 flow. Second operand 3 states and 669 transitions. [2024-11-10 14:32:57,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 617 flow [2024-11-10 14:32:57,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 248 transitions, 605 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:57,103 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 521 flow [2024-11-10 14:32:57,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2024-11-10 14:32:57,104 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 0 predicate places. [2024-11-10 14:32:57,104 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 521 flow [2024-11-10 14:32:57,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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:32:57,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:57,105 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:32:57,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:32:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1178763584, now seen corresponding path program 1 times [2024-11-10 14:32:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986683098] [2024-11-10 14:32:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:57,139 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:32:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986683098] [2024-11-10 14:32:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986683098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427109865] [2024-11-10 14:32:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:57,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 268 [2024-11-10 14:32:57,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:32:57,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:57,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 268 [2024-11-10 14:32:57,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand