/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 05:00:02,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 05:00:02,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 05:00:02,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 05:00:02,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 05:00:02,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 05:00:02,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 05:00:02,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 05:00:02,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 05:00:02,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 05:00:02,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 05:00:02,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 05:00:02,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 05:00:02,631 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 05:00:02,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 05:00:02,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 05:00:02,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 05:00:02,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 05:00:02,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 05:00:02,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 05:00:02,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 05:00:02,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 05:00:02,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 05:00:02,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 05:00:02,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 05:00:02,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 05:00:02,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 05:00:02,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 05:00:02,635 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 05:00:02,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 05:00:02,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:00:02,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 05:00:02,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 05:00:02,636 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 05:00:02,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 05:00:02,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 05:00:02,637 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 05:00:02,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 05:00:02,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 05:00:02,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 05:00:02,638 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 05:00:02,638 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/UGemCutter-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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-03 05:00:02,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 05:00:02,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 05:00:02,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 05:00:02,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 05:00:02,910 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 05:00:02,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2024-05-03 05:00:04,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 05:00:04,255 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 05:00:04,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2024-05-03 05:00:04,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b1befca1a/f6f66ef9303d44a4a015caf6cc88830c/FLAG91e4c5246 [2024-05-03 05:00:04,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b1befca1a/f6f66ef9303d44a4a015caf6cc88830c [2024-05-03 05:00:04,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 05:00:04,293 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 05:00:04,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 05:00:04,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 05:00:04,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 05:00:04,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcbb832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04, skipping insertion in model container [2024-05-03 05:00:04,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,344 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 05:00:04,469 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c[2087,2100] [2024-05-03 05:00:04,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:00:04,479 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 05:00:04,491 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c[2087,2100] [2024-05-03 05:00:04,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:00:04,510 INFO L206 MainTranslator]: Completed translation [2024-05-03 05:00:04,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04 WrapperNode [2024-05-03 05:00:04,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 05:00:04,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 05:00:04,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 05:00:04,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 05:00:04,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,541 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2024-05-03 05:00:04,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 05:00:04,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 05:00:04,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 05:00:04,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 05:00:04,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 05:00:04,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 05:00:04,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 05:00:04,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 05:00:04,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (1/1) ... [2024-05-03 05:00:04,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:00:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:04,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 05:00:04,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 05:00:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 05:00:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 05:00:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 05:00:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-03 05:00:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 05:00:04,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 05:00:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 05:00:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 05:00:04,648 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 05:00:04,760 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 05:00:04,762 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 05:00:04,986 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 05:00:05,042 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 05:00:05,042 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-03 05:00:05,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:00:05 BoogieIcfgContainer [2024-05-03 05:00:05,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 05:00:05,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 05:00:05,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 05:00:05,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 05:00:05,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 05:00:04" (1/3) ... [2024-05-03 05:00:05,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35646976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:00:05, skipping insertion in model container [2024-05-03 05:00:05,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:00:04" (2/3) ... [2024-05-03 05:00:05,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35646976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:00:05, skipping insertion in model container [2024-05-03 05:00:05,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:00:05" (3/3) ... [2024-05-03 05:00:05,049 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2024-05-03 05:00:05,056 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 05:00:05,063 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 05:00:05,064 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 05:00:05,064 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 05:00:05,127 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 05:00:05,162 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:00:05,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:00:05,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:05,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:00:05,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 05:00:05,213 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:00:05,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 05:00:05,234 INFO L357 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2a95d0ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:00:05,234 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:00:05,242 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:05,339 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,339 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,339 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,350 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,350 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,350 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,360 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,360 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,360 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,377 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,377 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,377 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,382 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 128 states. [2024-05-03 05:00:05,382 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:05,385 INFO L78 Accepts]: Start accepts. Automaton has currently 137 states, but on-demand construction may add more states Word has length 64 [2024-05-03 05:00:05,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:00:05,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:00:05,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:00:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1144373803, now seen corresponding path program 1 times [2024-05-03 05:00:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:00:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810680526] [2024-05-03 05:00:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:05,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:00:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:00:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810680526] [2024-05-03 05:00:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810680526] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:00:05,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:00:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 05:00:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861845318] [2024-05-03 05:00:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:00:05,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 05:00:05,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:00:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 05:00:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 05:00:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:05,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:00:05,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:00:05,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:05,630 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:05,663 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,664 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,664 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,671 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,671 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,671 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,678 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,678 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,678 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,686 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:05,686 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:05,686 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:05,692 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 136 states. [2024-05-03 05:00:05,692 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:05,693 INFO L78 Accepts]: Start accepts. Automaton has currently 145 states, but on-demand construction may add more states Word has length 62 [2024-05-03 05:00:05,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:00:05,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 05:00:05,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:00:05,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:00:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -332283311, now seen corresponding path program 1 times [2024-05-03 05:00:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:00:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961754014] [2024-05-03 05:00:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:05,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:00:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:00:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961754014] [2024-05-03 05:00:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961754014] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:00:06,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:00:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-03 05:00:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341643157] [2024-05-03 05:00:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:00:06,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-03 05:00:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:00:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-03 05:00:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-05-03 05:00:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:06,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:00:06,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:00:06,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:06,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:06,523 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:06,788 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:06,789 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:06,789 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:06,832 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 114 states. [2024-05-03 05:00:06,833 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:06,834 INFO L78 Accepts]: Start accepts. Automaton has currently 123 states, but on-demand construction may add more states Word has length 67 [2024-05-03 05:00:06,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:00:06,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 05:00:06,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:00:06,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:00:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash 233227766, now seen corresponding path program 1 times [2024-05-03 05:00:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:00:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390258348] [2024-05-03 05:00:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:06,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:00:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:07,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:00:07,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390258348] [2024-05-03 05:00:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390258348] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:00:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940277175] [2024-05-03 05:00:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:07,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:00:07,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:07,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:00:07,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 05:00:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:07,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2024-05-03 05:00:07,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:00:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:07,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:00:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940277175] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:00:08,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:00:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 35 [2024-05-03 05:00:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936864948] [2024-05-03 05:00:08,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:00:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-03 05:00:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:00:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-03 05:00:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2024-05-03 05:00:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:08,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:00:08,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:00:08,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:08,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:08,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:08,302 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:08,640 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:08,641 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:08,641 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:08,705 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 131 states. [2024-05-03 05:00:08,705 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-03 05:00:08,709 INFO L78 Accepts]: Start accepts. Automaton has currently 140 states, but on-demand construction may add more states Word has length 72 [2024-05-03 05:00:08,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:00:08,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 05:00:08,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-03 05:00:08,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:00:08,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:00:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash -311737999, now seen corresponding path program 2 times [2024-05-03 05:00:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:00:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249500929] [2024-05-03 05:00:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:00:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:09,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:00:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249500929] [2024-05-03 05:00:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249500929] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:00:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456379136] [2024-05-03 05:00:09,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:00:09,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:00:09,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:09,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:00:09,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 05:00:09,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:00:09,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:00:09,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-03 05:00:09,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:00:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:09,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:00:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456379136] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:00:10,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:00:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 46 [2024-05-03 05:00:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068139278] [2024-05-03 05:00:10,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:00:10,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-03 05:00:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:00:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-03 05:00:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2024-05-03 05:00:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:10,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:00:10,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 46 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:00:10,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:10,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:10,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-03 05:00:10,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:10,401 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:11,088 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 136 states. [2024-05-03 05:00:11,088 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-03 05:00:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-03 05:00:11,089 INFO L78 Accepts]: Start accepts. Automaton has currently 137 states, but on-demand construction may add more states Word has length 82 [2024-05-03 05:00:11,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:00:11,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 05:00:11,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:00:11,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:00:11,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:00:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1935124335, now seen corresponding path program 3 times [2024-05-03 05:00:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:00:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426797724] [2024-05-03 05:00:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:00:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-03 05:00:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:00:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426797724] [2024-05-03 05:00:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426797724] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:00:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861701397] [2024-05-03 05:00:11,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:00:11,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:00:11,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:11,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:00:11,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 05:00:11,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-03 05:00:11,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:00:11,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-03 05:00:11,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:00:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:12,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:00:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861701397] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:00:13,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:00:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 60 [2024-05-03 05:00:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118938455] [2024-05-03 05:00:13,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:00:13,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-05-03 05:00:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:00:13,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-05-03 05:00:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=3218, Unknown=0, NotChecked=0, Total=3540 [2024-05-03 05:00:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:13,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:00:13,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.0) internal successors, (180), 60 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:00:13,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:13,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:13,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-03 05:00:13,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-03 05:00:13,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:13,313 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:14,778 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:14,778 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:14,778 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:15,305 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 193 states. [2024-05-03 05:00:15,306 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-03 05:00:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:00:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-03 05:00:15,306 INFO L78 Accepts]: Start accepts. Automaton has currently 208 states, but on-demand construction may add more states Word has length 102 [2024-05-03 05:00:15,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:00:15,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 05:00:15,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:00:15,510 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:00:15,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:00:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1064639601, now seen corresponding path program 1 times [2024-05-03 05:00:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:00:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565770038] [2024-05-03 05:00:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:00:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-05-03 05:00:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:00:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565770038] [2024-05-03 05:00:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565770038] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:00:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637745192] [2024-05-03 05:00:16,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:00:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:00:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:16,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:00:16,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 05:00:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:00:16,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 59 conjunts are in the unsatisfiable core [2024-05-03 05:00:16,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:00:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:00:16,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:00:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-05-03 05:00:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637745192] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:00:17,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:00:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35, 21] total 62 [2024-05-03 05:00:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078411282] [2024-05-03 05:00:17,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:00:17,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-05-03 05:00:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:00:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-05-03 05:00:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3549, Unknown=0, NotChecked=0, Total=3782 [2024-05-03 05:00:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:17,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:00:17,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 62 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:00:17,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-03 05:00:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-03 05:00:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 05:00:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-03 05:00:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:17,273 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:18,552 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:18,552 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:18,552 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:18,997 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:18,998 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:18,998 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,003 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:19,005 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,005 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,361 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:19,361 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,361 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,371 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:19,371 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,371 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,477 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:19,477 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,477 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,504 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:19,504 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,504 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,529 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:19,529 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:19,530 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,170 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:20,170 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,170 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,536 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:20,537 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,537 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,638 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:20,638 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,638 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,834 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:20,834 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:20,834 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,008 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:21,008 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,008 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,012 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:21,012 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:21,012 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,038 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:21,038 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,038 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,042 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:21,042 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:21,042 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:26,987 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:26,988 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:26,988 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:26,989 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:26,989 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:26,990 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,148 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:27,149 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,149 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,167 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:27,167 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,167 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:27,195 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,195 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,207 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:27,207 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,207 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,215 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:27,215 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,215 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,720 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:27,720 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:27,720 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,880 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,880 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,880 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,889 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,889 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,889 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,892 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,892 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,892 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,895 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,895 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,896 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,974 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,974 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,974 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,994 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,994 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,994 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,996 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,996 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,996 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,999 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:32,999 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:32,999 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,001 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,001 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,001 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,012 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,012 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,013 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,018 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,018 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,018 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,025 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,025 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,025 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,034 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,034 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,034 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,054 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,054 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,054 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,241 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,241 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,241 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,248 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,248 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,248 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,317 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,318 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,318 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,334 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,335 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,335 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,455 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,455 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,455 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,459 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,459 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,459 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,460 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,461 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,461 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,464 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,464 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,464 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,467 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,467 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,467 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,471 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,471 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,472 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,475 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,475 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,475 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,477 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,477 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,477 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,478 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,478 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,478 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,489 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,489 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,489 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,493 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,493 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,493 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,499 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,499 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,499 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,507 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,507 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,507 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,523 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,523 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,523 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,673 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,673 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,673 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,679 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,680 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,680 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,688 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,688 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,688 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,702 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,703 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,703 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,835 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,835 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,835 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,839 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,839 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,839 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,841 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,841 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,841 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,844 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,844 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,844 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,848 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,848 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,848 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,852 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,852 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,852 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,854 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,854 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,854 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,856 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,857 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,857 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,925 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,925 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,926 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,937 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,937 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,937 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,948 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,948 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,948 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,955 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,956 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,956 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,965 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,966 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,966 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,984 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:33,984 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:33,984 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,180 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:34,180 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,180 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,186 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:34,186 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,186 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:34,195 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,195 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,208 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:34,209 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,209 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,810 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:34,811 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,811 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,981 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:34,981 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:34,981 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,018 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,019 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,019 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,054 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,054 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,054 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,088 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,088 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,088 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,121 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,121 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,121 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~i~0, thread2Thread1of1ForFork0_#t~post3#1, ~N1~0, ~N2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~counter~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork1_#t~post1] [2024-05-03 05:00:35,138 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 6299 states. [2024-05-03 05:00:35,139 INFO L212 cStratifiedReduction]: Copied states 90 times. [2024-05-03 05:00:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:00:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-03 05:00:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-03 05:00:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-05-03 05:00:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2024-05-03 05:00:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2024-05-03 05:00:35,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 05:00:35,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-03 05:00:35,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-03 05:00:35,364 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-05-03 05:00:35,366 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-05-03 05:00:35,370 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:00:35,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:00:35,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:35,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:00:35,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-03 05:00:35,396 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:00:35,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-03 05:00:35,397 INFO L357 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2a95d0ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:00:35,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:00:35,397 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:35,408 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,408 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:35,408 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:35,413 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,413 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:35,413 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:35,415 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,415 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:35,415 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:35,416 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,416 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:35,416 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:35,418 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,418 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:35,418 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:35,419 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:00:35,419 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:00:35,419 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:00:35,419 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 91 states. [2024-05-03 05:00:35,419 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:35,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-03 05:00:35,420 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 05:00:35,421 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-05-03 05:00:35,422 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:00:35,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:00:35,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:00:35,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:00:35,427 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:00:35,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-03 05:00:35,427 INFO L357 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2a95d0ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:00:35,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:00:35,427 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:00:35,428 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 31 states. [2024-05-03 05:00:35,428 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:00:35,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-03 05:00:35,429 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 05:00:35,429 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-05-03 05:00:35,430 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 05:00:35,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 05:00:35,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:00:35 BasicIcfg [2024-05-03 05:00:35,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 05:00:35,433 INFO L158 Benchmark]: Toolchain (without parser) took 31140.32ms. Allocated memory was 296.7MB in the beginning and 805.3MB in the end (delta: 508.6MB). Free memory was 225.8MB in the beginning and 288.4MB in the end (delta: -62.5MB). Peak memory consumption was 447.0MB. Max. memory is 8.0GB. [2024-05-03 05:00:35,433 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 296.7MB. Free memory is still 263.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:00:35,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.79ms. Allocated memory is still 296.7MB. Free memory was 225.6MB in the beginning and 214.3MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-03 05:00:35,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 296.7MB. Free memory was 214.3MB in the beginning and 212.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 05:00:35,433 INFO L158 Benchmark]: Boogie Preprocessor took 16.67ms. Allocated memory is still 296.7MB. Free memory was 212.4MB in the beginning and 211.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 05:00:35,434 INFO L158 Benchmark]: RCFGBuilder took 483.65ms. Allocated memory is still 296.7MB. Free memory was 211.1MB in the beginning and 263.4MB in the end (delta: -52.3MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2024-05-03 05:00:35,434 INFO L158 Benchmark]: TraceAbstraction took 30388.16ms. Allocated memory was 296.7MB in the beginning and 805.3MB in the end (delta: 508.6MB). Free memory was 262.4MB in the beginning and 288.4MB in the end (delta: -26.0MB). Peak memory consumption was 482.6MB. Max. memory is 8.0GB. [2024-05-03 05:00:35,435 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2024-05-03 05:00:35,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 296.7MB. Free memory is still 263.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.79ms. Allocated memory is still 296.7MB. Free memory was 225.6MB in the beginning and 214.3MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 296.7MB. Free memory was 214.3MB in the beginning and 212.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.67ms. Allocated memory is still 296.7MB. Free memory was 212.4MB in the beginning and 211.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 483.65ms. Allocated memory is still 296.7MB. Free memory was 211.1MB in the beginning and 263.4MB in the end (delta: -52.3MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. * TraceAbstraction took 30388.16ms. Allocated memory was 296.7MB in the beginning and 805.3MB in the end (delta: 508.6MB). Free memory was 262.4MB in the beginning and 288.4MB in the end (delta: -26.0MB). Peak memory consumption was 482.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10295, independent: 9461, independent conditional: 9461, independent unconditional: 0, dependent: 834, dependent conditional: 834, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9481, independent: 9461, independent conditional: 9461, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9481, independent: 9461, independent conditional: 9461, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9601, independent: 9461, independent conditional: 0, independent unconditional: 9461, dependent: 140, dependent conditional: 120, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9601, independent: 9461, independent conditional: 0, independent unconditional: 9461, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9601, independent: 9461, independent conditional: 0, independent unconditional: 9461, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9481, independent: 9461, independent conditional: 0, independent unconditional: 9461, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9481, independent: 9461, independent conditional: 0, independent unconditional: 9461, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9601, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 9481, unknown conditional: 0, unknown unconditional: 9481] , Statistics on independence cache: Total cache size (in pairs): 9481, Positive cache size: 9461, Positive conditional cache size: 0, Positive unconditional cache size: 9461, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 120, Maximal queried relation: 6, Independence queries for same thread: 814 - StatisticsResult: Reduction benchmarks 34.9ms Time before loop, 92.3ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 128, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 24.9ms Time before loop, 37.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 136, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 237.2ms Time before loop, 71.7ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 114, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 292.5ms Time before loop, 110.9ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 131, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 623.9ms Time before loop, 62.7ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 2, Reduction States: 136, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1301.3ms Time before loop, 690.4ms Time in loop, 2.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 193, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1179.2ms Time before loop, 16686.2ms Time in loop, 17.9s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 84, Reduction States: 6299, Duplicate States: 90, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 109, Transitions: 118, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 109, Transitions: 120, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 84, Transitions: 89, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 95, Transitions: 101, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 89, Transitions: 92, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 131, Transitions: 138, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 6150, Transitions: 7368, Traversal time: 17.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 11, RedundantProofs: 1, ProvenStates: 922, Times there's more than one choice: 882, Avg number of choices: 5.6214750542299345 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 51, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 45, unknown conditional: 0, unknown unconditional: 45] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 6 - StatisticsResult: Reduction benchmarks 1.6ms Time before loop, 21.0ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 91, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 92, Transitions: 104, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Reduction benchmarks 0.8ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 31, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 32, Transitions: 32, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 106 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 21.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 561, 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.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1081 ConstructedInterpolants, 0 QuantifiedInterpolants, 7703 SizeOfPredicates, 68 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 103/390 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 106 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 106 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-03 05:00:35,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Ended with exit code 0 [2024-05-03 05:00:35,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-05-03 05:00:35,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-03 05:00:36,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...