/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:38:04,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:38:04,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:38:04,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:38:04,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:38:04,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:38:04,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:38:04,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:38:04,365 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:38:04,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:38:04,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:38:04,368 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:38:04,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:38:04,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:38:04,370 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:38:04,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:38:04,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:38:04,371 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:38:04,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:38:04,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:38:04,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:38:04,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:38:04,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:38:04,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:38:04,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:38:04,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:38:04,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:38:04,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:38:04,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:38:04,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:38:04,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:38:04,571 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:38:04,572 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:38:04,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2023-12-09 15:38:05,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:38:05,675 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:38:05,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2023-12-09 15:38:05,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f43d8e6/c3a03847916346609d7e3ba1357977ab/FLAGaf9d9a308 [2023-12-09 15:38:05,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f43d8e6/c3a03847916346609d7e3ba1357977ab [2023-12-09 15:38:05,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:38:05,707 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:38:05,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:38:05,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:38:05,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:38:05,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ebce98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05, skipping insertion in model container [2023-12-09 15:38:05,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,739 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:38:05,879 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2023-12-09 15:38:05,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:38:05,894 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:38:05,908 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2023-12-09 15:38:05,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:38:05,921 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:38:05,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05 WrapperNode [2023-12-09 15:38:05,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:38:05,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:38:05,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:38:05,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:38:05,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,950 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 159 [2023-12-09 15:38:05,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:38:05,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:38:05,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:38:05,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:38:05,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:38:05,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:38:05,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:38:05,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:38:05,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (1/1) ... [2023-12-09 15:38:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:38:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:06,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:38:06,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:38:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:38:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:38:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:38:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:38:06,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:38:06,039 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:38:06,125 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:38:06,127 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:38:06,356 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:38:06,365 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:38:06,365 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:38:06,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:38:06 BoogieIcfgContainer [2023-12-09 15:38:06,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:38:06,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:38:06,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:38:06,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:38:06,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:38:05" (1/3) ... [2023-12-09 15:38:06,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7618be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:38:06, skipping insertion in model container [2023-12-09 15:38:06,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:05" (2/3) ... [2023-12-09 15:38:06,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7618be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:38:06, skipping insertion in model container [2023-12-09 15:38:06,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:38:06" (3/3) ... [2023-12-09 15:38:06,380 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2023-12-09 15:38:06,392 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:38:06,392 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:38:06,392 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:38:06,510 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:38:06,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 201 transitions, 416 flow [2023-12-09 15:38:06,595 INFO L124 PetriNetUnfolderBase]: 16/199 cut-off events. [2023-12-09 15:38:06,596 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:38:06,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 199 events. 16/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 176 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-12-09 15:38:06,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 201 transitions, 416 flow [2023-12-09 15:38:06,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 190 transitions, 392 flow [2023-12-09 15:38:06,611 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:38:06,623 INFO L362 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, mHoare=true, 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;@4ca6ca94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:38:06,624 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:38:06,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:38:06,653 INFO L124 PetriNetUnfolderBase]: 13/158 cut-off events. [2023-12-09 15:38:06,653 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:38:06,654 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:06,654 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:06,655 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:06,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash 643566064, now seen corresponding path program 1 times [2023-12-09 15:38:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117331179] [2023-12-09 15:38:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117331179] [2023-12-09 15:38:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117331179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:38:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035173571] [2023-12-09 15:38:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:07,118 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:38:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:38:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:38:07,141 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 201 [2023-12-09 15:38:07,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 190 transitions, 392 flow. Second operand has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 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) [2023-12-09 15:38:07,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:07,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 201 [2023-12-09 15:38:07,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:07,319 INFO L124 PetriNetUnfolderBase]: 22/300 cut-off events. [2023-12-09 15:38:07,319 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-12-09 15:38:07,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 300 events. 22/300 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 667 event pairs, 9 based on Foata normal form. 37/307 useless extension candidates. Maximal degree in co-relation 227. Up to 55 conditions per place. [2023-12-09 15:38:07,326 INFO L140 encePairwiseOnDemand]: 178/201 looper letters, 49 selfloop transitions, 9 changer transitions 5/181 dead transitions. [2023-12-09 15:38:07,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 181 transitions, 500 flow [2023-12-09 15:38:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:38:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:38:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1102 transitions. [2023-12-09 15:38:07,342 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6853233830845771 [2023-12-09 15:38:07,342 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1102 transitions. [2023-12-09 15:38:07,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1102 transitions. [2023-12-09 15:38:07,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:07,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1102 transitions. [2023-12-09 15:38:07,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.75) internal successors, (1102), 8 states have internal predecessors, (1102), 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) [2023-12-09 15:38:07,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 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) [2023-12-09 15:38:07,357 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 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) [2023-12-09 15:38:07,361 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 7 predicate places. [2023-12-09 15:38:07,361 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 500 flow [2023-12-09 15:38:07,362 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 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) [2023-12-09 15:38:07,362 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:07,362 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:07,362 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:38:07,362 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:07,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash 855636614, now seen corresponding path program 1 times [2023-12-09 15:38:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:07,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743970979] [2023-12-09 15:38:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743970979] [2023-12-09 15:38:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743970979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:07,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:38:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849017050] [2023-12-09 15:38:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:07,655 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:38:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:07,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:38:07,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:38:07,656 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 201 [2023-12-09 15:38:07,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-12-09 15:38:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 201 [2023-12-09 15:38:07,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:07,910 INFO L124 PetriNetUnfolderBase]: 121/794 cut-off events. [2023-12-09 15:38:07,910 INFO L125 PetriNetUnfolderBase]: For 252/257 co-relation queries the response was YES. [2023-12-09 15:38:07,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 794 events. 121/794 cut-off events. For 252/257 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4309 event pairs, 38 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 993. Up to 138 conditions per place. [2023-12-09 15:38:07,914 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 77 selfloop transitions, 5 changer transitions 11/218 dead transitions. [2023-12-09 15:38:07,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 218 transitions, 821 flow [2023-12-09 15:38:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:38:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:38:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1273 transitions. [2023-12-09 15:38:07,917 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-12-09 15:38:07,917 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1273 transitions. [2023-12-09 15:38:07,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1273 transitions. [2023-12-09 15:38:07,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:07,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1273 transitions. [2023-12-09 15:38:07,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.44444444444446) internal successors, (1273), 9 states have internal predecessors, (1273), 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) [2023-12-09 15:38:07,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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) [2023-12-09 15:38:07,923 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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) [2023-12-09 15:38:07,923 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 15 predicate places. [2023-12-09 15:38:07,924 INFO L500 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 821 flow [2023-12-09 15:38:07,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-12-09 15:38:07,924 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:07,925 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:07,925 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:38:07,925 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:07,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -395411964, now seen corresponding path program 1 times [2023-12-09 15:38:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:07,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708803164] [2023-12-09 15:38:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:07,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708803164] [2023-12-09 15:38:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708803164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:08,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:08,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:38:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055595226] [2023-12-09 15:38:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:08,068 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:08,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:38:08,070 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2023-12-09 15:38:08,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 218 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:08,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:08,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2023-12-09 15:38:08,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:08,248 INFO L124 PetriNetUnfolderBase]: 238/1248 cut-off events. [2023-12-09 15:38:08,251 INFO L125 PetriNetUnfolderBase]: For 777/805 co-relation queries the response was YES. [2023-12-09 15:38:08,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1248 events. 238/1248 cut-off events. For 777/805 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7631 event pairs, 99 based on Foata normal form. 0/1104 useless extension candidates. Maximal degree in co-relation 1911. Up to 240 conditions per place. [2023-12-09 15:38:08,257 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 31 selfloop transitions, 5 changer transitions 12/231 dead transitions. [2023-12-09 15:38:08,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 231 transitions, 965 flow [2023-12-09 15:38:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:38:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:38:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2023-12-09 15:38:08,259 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8616915422885573 [2023-12-09 15:38:08,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2023-12-09 15:38:08,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2023-12-09 15:38:08,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:08,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2023-12-09 15:38:08,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 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) [2023-12-09 15:38:08,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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) [2023-12-09 15:38:08,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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) [2023-12-09 15:38:08,264 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 19 predicate places. [2023-12-09 15:38:08,264 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 231 transitions, 965 flow [2023-12-09 15:38:08,265 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:08,265 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:08,265 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:08,265 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:38:08,265 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:08,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1713038918, now seen corresponding path program 2 times [2023-12-09 15:38:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117477180] [2023-12-09 15:38:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:08,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117477180] [2023-12-09 15:38:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117477180] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276320012] [2023-12-09 15:38:08,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:38:08,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:08,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:08,436 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) [2023-12-09 15:38:08,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:38:08,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:38:08,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:08,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:38:08,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:08,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:38:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276320012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:08,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:38:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-12-09 15:38:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187699791] [2023-12-09 15:38:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:08,640 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:38:08,643 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2023-12-09 15:38:08,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 231 transitions, 965 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:08,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:08,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2023-12-09 15:38:08,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:08,835 INFO L124 PetriNetUnfolderBase]: 272/1421 cut-off events. [2023-12-09 15:38:08,835 INFO L125 PetriNetUnfolderBase]: For 1202/1266 co-relation queries the response was YES. [2023-12-09 15:38:08,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 1421 events. 272/1421 cut-off events. For 1202/1266 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9143 event pairs, 87 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 2529. Up to 292 conditions per place. [2023-12-09 15:38:08,842 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 45 selfloop transitions, 5 changer transitions 14/247 dead transitions. [2023-12-09 15:38:08,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 247 transitions, 1158 flow [2023-12-09 15:38:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:38:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:38:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2023-12-09 15:38:08,844 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8743781094527363 [2023-12-09 15:38:08,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 703 transitions. [2023-12-09 15:38:08,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 703 transitions. [2023-12-09 15:38:08,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:08,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 703 transitions. [2023-12-09 15:38:08,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:08,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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) [2023-12-09 15:38:08,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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) [2023-12-09 15:38:08,849 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 22 predicate places. [2023-12-09 15:38:08,850 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 247 transitions, 1158 flow [2023-12-09 15:38:08,850 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:08,850 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:08,850 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:08,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:09,054 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:09,057 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:09,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 866814956, now seen corresponding path program 3 times [2023-12-09 15:38:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984480055] [2023-12-09 15:38:09,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984480055] [2023-12-09 15:38:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984480055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452817659] [2023-12-09 15:38:09,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:38:09,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:09,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:09,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:38:09,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:38:09,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:09,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:38:09,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:09,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452817659] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:38:09,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:38:09,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 10 [2023-12-09 15:38:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231316] [2023-12-09 15:38:09,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:38:09,548 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:38:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:09,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:38:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:38:09,550 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 201 [2023-12-09 15:38:09,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 247 transitions, 1158 flow. Second operand has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 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) [2023-12-09 15:38:09,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:09,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 201 [2023-12-09 15:38:09,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:10,206 INFO L124 PetriNetUnfolderBase]: 733/3434 cut-off events. [2023-12-09 15:38:10,206 INFO L125 PetriNetUnfolderBase]: For 3856/4312 co-relation queries the response was YES. [2023-12-09 15:38:10,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7778 conditions, 3434 events. 733/3434 cut-off events. For 3856/4312 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 27813 event pairs, 201 based on Foata normal form. 28/3125 useless extension candidates. Maximal degree in co-relation 6027. Up to 656 conditions per place. [2023-12-09 15:38:10,226 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 166 selfloop transitions, 73 changer transitions 22/440 dead transitions. [2023-12-09 15:38:10,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 440 transitions, 2852 flow [2023-12-09 15:38:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-09 15:38:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-12-09 15:38:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3436 transitions. [2023-12-09 15:38:10,231 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.854726368159204 [2023-12-09 15:38:10,231 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3436 transitions. [2023-12-09 15:38:10,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3436 transitions. [2023-12-09 15:38:10,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:10,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3436 transitions. [2023-12-09 15:38:10,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.8) internal successors, (3436), 20 states have internal predecessors, (3436), 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) [2023-12-09 15:38:10,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 201.0) internal successors, (4221), 21 states have internal predecessors, (4221), 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) [2023-12-09 15:38:10,242 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 201.0) internal successors, (4221), 21 states have internal predecessors, (4221), 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) [2023-12-09 15:38:10,243 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 41 predicate places. [2023-12-09 15:38:10,243 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 440 transitions, 2852 flow [2023-12-09 15:38:10,243 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 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) [2023-12-09 15:38:10,243 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:10,244 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:10,448 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:10,448 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:10,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1772796134, now seen corresponding path program 4 times [2023-12-09 15:38:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428850250] [2023-12-09 15:38:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:10,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:10,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428850250] [2023-12-09 15:38:10,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428850250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577198104] [2023-12-09 15:38:10,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:38:10,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:10,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:10,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:10,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:38:10,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:38:10,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:10,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-09 15:38:10,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:11,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:11,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:38:11,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2023-12-09 15:38:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577198104] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:38:12,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:38:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 19] total 37 [2023-12-09 15:38:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263005994] [2023-12-09 15:38:12,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:38:12,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-09 15:38:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-09 15:38:12,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2023-12-09 15:38:12,788 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-12-09 15:38:12,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 440 transitions, 2852 flow. Second operand has 37 states, 37 states have (on average 87.78378378378379) internal successors, (3248), 37 states have internal predecessors, (3248), 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) [2023-12-09 15:38:12,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:12,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-12-09 15:38:12,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:19,435 INFO L124 PetriNetUnfolderBase]: 12319/26745 cut-off events. [2023-12-09 15:38:19,435 INFO L125 PetriNetUnfolderBase]: For 30336/30578 co-relation queries the response was YES. [2023-12-09 15:38:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74971 conditions, 26745 events. 12319/26745 cut-off events. For 30336/30578 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 252885 event pairs, 738 based on Foata normal form. 48/24977 useless extension candidates. Maximal degree in co-relation 62948. Up to 5292 conditions per place. [2023-12-09 15:38:19,656 INFO L140 encePairwiseOnDemand]: 156/201 looper letters, 990 selfloop transitions, 280 changer transitions 242/1583 dead transitions. [2023-12-09 15:38:19,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1583 transitions, 12624 flow [2023-12-09 15:38:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-12-09 15:38:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2023-12-09 15:38:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 9252 transitions. [2023-12-09 15:38:19,672 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4468917548181423 [2023-12-09 15:38:19,673 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 9252 transitions. [2023-12-09 15:38:19,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 9252 transitions. [2023-12-09 15:38:19,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:19,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 9252 transitions. [2023-12-09 15:38:19,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 89.8252427184466) internal successors, (9252), 103 states have internal predecessors, (9252), 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) [2023-12-09 15:38:19,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 201.0) internal successors, (20904), 104 states have internal predecessors, (20904), 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) [2023-12-09 15:38:19,737 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 201.0) internal successors, (20904), 104 states have internal predecessors, (20904), 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) [2023-12-09 15:38:19,738 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 143 predicate places. [2023-12-09 15:38:19,738 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 1583 transitions, 12624 flow [2023-12-09 15:38:19,740 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 87.78378378378379) internal successors, (3248), 37 states have internal predecessors, (3248), 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) [2023-12-09 15:38:19,740 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:19,740 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:19,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:19,957 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:19,958 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:19,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash 770404434, now seen corresponding path program 1 times [2023-12-09 15:38:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:19,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608094912] [2023-12-09 15:38:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:20,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608094912] [2023-12-09 15:38:20,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608094912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:20,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:20,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:38:20,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499638727] [2023-12-09 15:38:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:20,055 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:38:20,057 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2023-12-09 15:38:20,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 1583 transitions, 12624 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:20,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:20,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2023-12-09 15:38:20,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:23,072 INFO L124 PetriNetUnfolderBase]: 12185/26276 cut-off events. [2023-12-09 15:38:23,072 INFO L125 PetriNetUnfolderBase]: For 36288/36466 co-relation queries the response was YES. [2023-12-09 15:38:23,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77442 conditions, 26276 events. 12185/26276 cut-off events. For 36288/36466 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 245781 event pairs, 727 based on Foata normal form. 21/24530 useless extension candidates. Maximal degree in co-relation 65710. Up to 5292 conditions per place. [2023-12-09 15:38:23,198 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 483 selfloop transitions, 23 changer transitions 264/1577 dead transitions. [2023-12-09 15:38:23,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1577 transitions, 13691 flow [2023-12-09 15:38:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:38:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:38:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 891 transitions. [2023-12-09 15:38:23,200 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8865671641791045 [2023-12-09 15:38:23,200 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 891 transitions. [2023-12-09 15:38:23,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 891 transitions. [2023-12-09 15:38:23,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:23,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 891 transitions. [2023-12-09 15:38:23,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 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) [2023-12-09 15:38:23,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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) [2023-12-09 15:38:23,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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) [2023-12-09 15:38:23,203 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 147 predicate places. [2023-12-09 15:38:23,203 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 1577 transitions, 13691 flow [2023-12-09 15:38:23,203 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:23,203 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:23,203 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:23,203 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:38:23,203 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:23,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -80598960, now seen corresponding path program 2 times [2023-12-09 15:38:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942009319] [2023-12-09 15:38:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942009319] [2023-12-09 15:38:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942009319] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459208395] [2023-12-09 15:38:23,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:38:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:23,616 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:23,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:38:23,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:38:23,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:23,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:38:23,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:23,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:23,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459208395] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:23,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:38:23,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14, 5] total 15 [2023-12-09 15:38:23,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993502500] [2023-12-09 15:38:23,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:23,903 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:23,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-09 15:38:23,904 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2023-12-09 15:38:23,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1577 transitions, 13691 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:23,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:23,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2023-12-09 15:38:23,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:27,165 INFO L124 PetriNetUnfolderBase]: 12194/26336 cut-off events. [2023-12-09 15:38:27,165 INFO L125 PetriNetUnfolderBase]: For 45809/45993 co-relation queries the response was YES. [2023-12-09 15:38:27,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81293 conditions, 26336 events. 12194/26336 cut-off events. For 45809/45993 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 246523 event pairs, 718 based on Foata normal form. 21/24610 useless extension candidates. Maximal degree in co-relation 69137. Up to 5292 conditions per place. [2023-12-09 15:38:27,336 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 405 selfloop transitions, 142 changer transitions 263/1611 dead transitions. [2023-12-09 15:38:27,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1611 transitions, 15389 flow [2023-12-09 15:38:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:38:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:38:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 719 transitions. [2023-12-09 15:38:27,338 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8942786069651741 [2023-12-09 15:38:27,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 719 transitions. [2023-12-09 15:38:27,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 719 transitions. [2023-12-09 15:38:27,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:27,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 719 transitions. [2023-12-09 15:38:27,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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) [2023-12-09 15:38:27,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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) [2023-12-09 15:38:27,340 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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) [2023-12-09 15:38:27,340 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 149 predicate places. [2023-12-09 15:38:27,341 INFO L500 AbstractCegarLoop]: Abstraction has has 330 places, 1611 transitions, 15389 flow [2023-12-09 15:38:27,341 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:27,341 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:27,341 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:27,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:27,545 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:27,546 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:27,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1643371914, now seen corresponding path program 1 times [2023-12-09 15:38:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781300271] [2023-12-09 15:38:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:38:27,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781300271] [2023-12-09 15:38:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781300271] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563057799] [2023-12-09 15:38:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:27,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:27,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:38:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:28,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-09 15:38:28,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:29,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:30,441 INFO L349 Elim1Store]: treesize reduction 5, result has 91.8 percent of original size [2023-12-09 15:38:30,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 75 [2023-12-09 15:38:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563057799] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:38:31,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:38:31,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29, 25] total 55 [2023-12-09 15:38:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837520198] [2023-12-09 15:38:31,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:38:31,168 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-09 15:38:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:31,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-09 15:38:31,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2023-12-09 15:38:31,175 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 201 [2023-12-09 15:38:31,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1611 transitions, 15389 flow. Second operand has 55 states, 55 states have (on average 68.45454545454545) internal successors, (3765), 55 states have internal predecessors, (3765), 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) [2023-12-09 15:38:31,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:31,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 201 [2023-12-09 15:38:31,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:34,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [111#L37-1true, thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,204 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,204 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,204 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,204 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 33#L37-1true, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,205 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,205 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,205 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,205 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][396], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 2197#(and (or (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) 0) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), thread2Thread1of1ForFork1InUse, 23#L38-1true]) [2023-12-09 15:38:34,205 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,206 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,206 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,206 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-12-09 15:38:34,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][397], [4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 133#L38-1true, 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,568 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is not cut-off event [2023-12-09 15:38:34,568 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is not cut-off event [2023-12-09 15:38:34,568 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is not cut-off event [2023-12-09 15:38:34,568 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is not cut-off event [2023-12-09 15:38:34,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,569 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,569 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,569 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,569 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,570 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,570 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,570 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,570 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,573 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,573 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,573 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,573 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,573 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,574 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,574 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,574 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-12-09 15:38:34,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:34,575 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,575 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,575 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:34,575 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,025 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:35,025 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,025 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,025 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,025 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,025 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:35,026 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,026 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,026 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,026 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,026 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,029 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:35,029 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,029 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:35,030 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:35,030 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-09 15:38:36,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 33#L37-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,437 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [111#L37-1true, thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,438 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,438 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][795], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 2250#(and (or (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) 0) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse, 23#L38-1true]) [2023-12-09 15:38:36,439 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,439 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,439 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,439 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 111#L37-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,444 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 33#L37-1true, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,444 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,444 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,445 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][800], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse, 23#L38-1true, 2252#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) 0) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0))]) [2023-12-09 15:38:36,445 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,445 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,445 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,445 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-12-09 15:38:36,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][794], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 133#L38-1true, 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,736 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,736 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,736 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,736 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,737 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,737 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,737 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,740 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,740 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,741 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,741 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,742 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,742 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,742 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][801], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 133#L38-1true, 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,743 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,743 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,743 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,743 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-12-09 15:38:36,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,743 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,744 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,744 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,748 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,748 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,748 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,748 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,748 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,748 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 13#L51true, 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,749 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,749 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:36,749 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,749 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,750 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,750 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:36,750 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,250 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,250 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,250 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,251 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,251 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,251 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,253 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,254 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,254 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,254 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,256 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 13#L51true, 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,256 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,256 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,256 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,256 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,256 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,256 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,257 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,257 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,257 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,257 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,257 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 13#L51true, 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,261 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:37,261 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:37,261 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-12-09 15:38:43,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][846], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 145#L37-3true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:43,340 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-12-09 15:38:43,340 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-12-09 15:38:43,340 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-12-09 15:38:43,340 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-12-09 15:38:43,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][2072], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 199#(<= 1 ~size~0), 12#L38-4true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:43,818 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2023-12-09 15:38:43,818 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-12-09 15:38:43,818 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-12-09 15:38:43,818 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-12-09 15:38:43,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][846], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 62#L63-2true, 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:43,822 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-12-09 15:38:43,822 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-12-09 15:38:43,822 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-12-09 15:38:43,822 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-12-09 15:38:44,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([518] L64-->L64-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ v_~f~0.offset_3 (* v_~x2~0_5 4))) |v_thread2Thread1of1ForFork1_#t~mem5#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_5, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_5, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem5#1][1958], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 71#L64-1true, 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 13#L51true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:44,510 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,510 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,510 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,510 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][846], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 178#L64true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-12-09 15:38:44,511 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,511 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,511 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-12-09 15:38:44,511 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-12-09 15:39:42,346 INFO L124 PetriNetUnfolderBase]: 70877/134250 cut-off events. [2023-12-09 15:39:42,346 INFO L125 PetriNetUnfolderBase]: For 266742/267254 co-relation queries the response was YES. [2023-12-09 15:39:42,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482455 conditions, 134250 events. 70877/134250 cut-off events. For 266742/267254 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 1375121 event pairs, 4964 based on Foata normal form. 72/125469 useless extension candidates. Maximal degree in co-relation 438093. Up to 62016 conditions per place. [2023-12-09 15:39:43,524 INFO L140 encePairwiseOnDemand]: 129/201 looper letters, 5322 selfloop transitions, 1950 changer transitions 1348/8977 dead transitions. [2023-12-09 15:39:43,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 8977 transitions, 74726 flow [2023-12-09 15:39:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 578 states. [2023-12-09 15:39:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2023-12-09 15:39:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 41615 transitions. [2023-12-09 15:39:43,574 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.35820034774225756 [2023-12-09 15:39:43,574 INFO L72 ComplementDD]: Start complementDD. Operand 578 states and 41615 transitions. [2023-12-09 15:39:43,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 41615 transitions. [2023-12-09 15:39:43,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:43,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 578 states and 41615 transitions. [2023-12-09 15:39:43,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 579 states, 578 states have (on average 71.99826989619378) internal successors, (41615), 578 states have internal predecessors, (41615), 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) [2023-12-09 15:39:43,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 579 states, 579 states have (on average 201.0) internal successors, (116379), 579 states have internal predecessors, (116379), 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) [2023-12-09 15:39:43,802 INFO L81 ComplementDD]: Finished complementDD. Result has 579 states, 579 states have (on average 201.0) internal successors, (116379), 579 states have internal predecessors, (116379), 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) [2023-12-09 15:39:43,803 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 726 predicate places. [2023-12-09 15:39:43,803 INFO L500 AbstractCegarLoop]: Abstraction has has 907 places, 8977 transitions, 74726 flow [2023-12-09 15:39:43,804 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 68.45454545454545) internal successors, (3765), 55 states have internal predecessors, (3765), 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) [2023-12-09 15:39:43,804 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:43,804 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:39:43,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-09 15:39:44,009 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:44,010 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:39:44,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1976641498, now seen corresponding path program 2 times [2023-12-09 15:39:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:44,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143211249] [2023-12-09 15:39:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:39:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143211249] [2023-12-09 15:39:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143211249] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:39:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506233482] [2023-12-09 15:39:44,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:39:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:44,700 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:39:44,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:39:44,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:39:44,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:39:44,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-09 15:39:44,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:39:45,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:39:45,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:39:45,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:39:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:39:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:46,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:39:50,411 WARN L854 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_193))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse2 (select .cse1 (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* (select .cse1 (+ (* .cse2 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< c_~size~0 (+ ~x2~0 1)) (< c_~size~0 (+ .cse2 1)) (< .cse2 0) (< ~x2~0 0)))))) is different from false [2023-12-09 15:39:50,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:50,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 96 [2023-12-09 15:39:50,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:50,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 692 treesize of output 628 [2023-12-09 15:39:51,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 263 treesize of output 223 [2023-12-09 15:39:51,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:51,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 45 [2023-12-09 15:39:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506233482] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:39:52,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:39:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 33, 31] total 77 [2023-12-09 15:39:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939370506] [2023-12-09 15:39:52,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:39:52,095 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-12-09 15:39:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-12-09 15:39:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=5311, Unknown=50, NotChecked=148, Total=5852 [2023-12-09 15:39:52,099 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2023-12-09 15:39:52,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 8977 transitions, 74726 flow. Second operand has 77 states, 77 states have (on average 43.01298701298701) internal successors, (3312), 77 states have internal predecessors, (3312), 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) [2023-12-09 15:39:52,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:52,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2023-12-09 15:39:52,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:53,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:39:55,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:39:57,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:40:00,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-09 15:42:12,487 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:42:12,487 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:42:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 654 states. [2023-12-09 15:42:12,726 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:42:12,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-09 15:42:12,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:42:12,932 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (77states, 37/201 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 441020 conditions, 98932 events (56173/98931 cut-off events. For 188393/188951 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 1017254 event pairs, 709 based on Foata normal form. 118/96509 useless extension candidates. Maximal degree in co-relation 318330. Up to 21457 conditions per place.). [2023-12-09 15:42:12,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:42:12,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:42:12,934 INFO L457 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1] [2023-12-09 15:42:12,937 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:42:12,937 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:42:12,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:42:12 BasicIcfg [2023-12-09 15:42:12,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:42:12,940 INFO L158 Benchmark]: Toolchain (without parser) took 247232.62ms. Allocated memory was 207.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 147.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2023-12-09 15:42:12,940 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:42:12,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.35ms. Allocated memory is still 207.6MB. Free memory was 147.2MB in the beginning and 135.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:42:12,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.22ms. Allocated memory is still 207.6MB. Free memory was 135.4MB in the beginning and 133.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:42:12,941 INFO L158 Benchmark]: Boogie Preprocessor took 21.05ms. Allocated memory is still 207.6MB. Free memory was 133.1MB in the beginning and 131.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:42:12,941 INFO L158 Benchmark]: RCFGBuilder took 394.11ms. Allocated memory was 207.6MB in the beginning and 250.6MB in the end (delta: 43.0MB). Free memory was 131.5MB in the beginning and 205.9MB in the end (delta: -74.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2023-12-09 15:42:12,941 INFO L158 Benchmark]: TraceAbstraction took 246563.28ms. Allocated memory was 250.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 205.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2023-12-09 15:42:12,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.35ms. Allocated memory is still 207.6MB. Free memory was 147.2MB in the beginning and 135.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.22ms. Allocated memory is still 207.6MB. Free memory was 135.4MB in the beginning and 133.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.05ms. Allocated memory is still 207.6MB. Free memory was 133.1MB in the beginning and 131.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.11ms. Allocated memory was 207.6MB in the beginning and 250.6MB in the end (delta: 43.0MB). Free memory was 131.5MB in the beginning and 205.9MB in the end (delta: -74.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * TraceAbstraction took 246563.28ms. Allocated memory was 250.6MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 205.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (77states, 37/201 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 441020 conditions, 98932 events (56173/98931 cut-off events. For 188393/188951 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 1017254 event pairs, 709 based on Foata normal form. 118/96509 useless extension candidates. Maximal degree in co-relation 318330. Up to 21457 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (77states, 37/201 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 441020 conditions, 98932 events (56173/98931 cut-off events. For 188393/188951 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 1017254 event pairs, 709 based on Foata normal form. 118/96509 useless extension candidates. Maximal degree in co-relation 318330. Up to 21457 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (77states, 37/201 universal loopers) in iteration 10,while PetriNetUnfolder was constructing finite prefix that currently has 441020 conditions, 98932 events (56173/98931 cut-off events. For 188393/188951 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 1017254 event pairs, 709 based on Foata normal form. 118/96509 useless extension candidates. Maximal degree in co-relation 318330. Up to 21457 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 265 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 246.4s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 228.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 18336 SdHoareTripleChecker+Valid, 35.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18336 mSDsluCounter, 54311 SdHoareTripleChecker+Invalid, 31.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6094 IncrementalHoareTripleChecker+Unchecked, 52468 mSDsCounter, 1042 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52504 IncrementalHoareTripleChecker+Invalid, 59677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1042 mSolverCounterUnsat, 1843 mSDtfsCounter, 52504 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3607 GetRequests, 2081 SyntacticMatches, 3 SemanticMatches, 1523 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392071 ImplicationChecksByTransitivity, 90.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74726occurred in iteration=9, InterpolantAutomatonStates: 736, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 2262 NumberOfCodeBlocks, 2249 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3017 ConstructedInterpolants, 138 QuantifiedInterpolants, 26395 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1790 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 28/252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown