/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/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:02:40,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:02:40,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:02:40,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:02:40,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:02:40,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:02:40,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:02:40,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:02:40,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:02:40,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:02:40,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:02:40,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:02:40,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:02:40,393 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:02:40,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:02:40,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:02:40,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:02:40,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:02:40,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:02:40,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:02:40,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:02:40,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:02:40,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:02:40,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:02:40,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:02:40,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:02:40,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:02:40,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:02:40,398 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:02:40,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:02:40,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:02:40,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:02:40,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:02:40,399 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:02:40,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:02:40,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:02:40,400 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:02:40,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:02:40,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:02:40,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:02:40,400 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:02:40,401 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-30 16:02:40,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:02:40,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:02:40,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:02:40,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:02:40,606 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:02:40,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-05-30 16:02:41,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:02:41,916 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:02:41,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-05-30 16:02:41,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aca90838f/d315776e56e74f6d84bb3fed94018d36/FLAG613226220 [2024-05-30 16:02:41,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aca90838f/d315776e56e74f6d84bb3fed94018d36 [2024-05-30 16:02:41,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:02:41,955 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:02:41,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:02:41,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:02:41,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:02:41,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:02:41" (1/1) ... [2024-05-30 16:02:41,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268be79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:41, skipping insertion in model container [2024-05-30 16:02:41,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:02:41" (1/1) ... [2024-05-30 16:02:41,986 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:02:42,141 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/clever.wvr.c[2133,2146] [2024-05-30 16:02:42,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:02:42,153 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:02:42,169 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/clever.wvr.c[2133,2146] [2024-05-30 16:02:42,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:02:42,180 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:02:42,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42 WrapperNode [2024-05-30 16:02:42,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:02:42,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:02:42,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:02:42,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:02:42,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,239 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-05-30 16:02:42,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:02:42,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:02:42,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:02:42,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:02:42,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:02:42,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:02:42,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:02:42,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:02:42,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (1/1) ... [2024-05-30 16:02:42,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:02:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:02:42,318 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-30 16:02:42,326 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-30 16:02:42,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:02:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:02:42,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:02:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:02:42,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:02:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:02:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:02:42,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:02:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:02:42,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:02:42,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:02:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:02:42,371 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:02:42,488 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:02:42,490 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:02:42,722 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:02:42,733 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:02:42,733 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 16:02:42,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:02:42 BoogieIcfgContainer [2024-05-30 16:02:42,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:02:42,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:02:42,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:02:42,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:02:42,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:02:41" (1/3) ... [2024-05-30 16:02:42,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cf417b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:02:42, skipping insertion in model container [2024-05-30 16:02:42,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:02:42" (2/3) ... [2024-05-30 16:02:42,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cf417b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:02:42, skipping insertion in model container [2024-05-30 16:02:42,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:02:42" (3/3) ... [2024-05-30 16:02:42,742 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-05-30 16:02:42,751 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:02:42,760 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:02:42,761 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:02:42,761 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:02:42,838 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:02:42,881 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:02:42,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:02:42,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:02:42,888 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-30 16:02:42,893 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-30 16:02:42,938 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:02:42,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:02:42,955 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;@100d4d9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:02:42,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:02:42,964 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:43,071 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,071 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,071 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,084 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,084 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,084 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,097 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,097 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,097 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,110 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,110 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,110 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,130 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,130 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,131 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,141 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,142 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,142 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,168 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,168 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,168 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,181 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,181 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,181 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,191 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,191 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,191 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,211 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,211 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,211 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,213 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,213 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,213 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,221 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,222 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,222 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,228 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 228 states. [2024-05-30 16:02:43,228 INFO L212 cStratifiedReduction]: Copied states 11 times. [2024-05-30 16:02:43,231 INFO L78 Accepts]: Start accepts. Automaton has currently 223 states, but on-demand construction may add more states Word has length 89 [2024-05-30 16:02:43,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:02:43,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:02:43,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:02:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1202478194, now seen corresponding path program 1 times [2024-05-30 16:02:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:02:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846841434] [2024-05-30 16:02:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:02:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:43,551 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-30 16:02:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:02:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846841434] [2024-05-30 16:02:43,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846841434] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:02:43,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:02:43,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:02:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773131842] [2024-05-30 16:02:43,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:02:43,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:02:43,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:02:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:02:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:02:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:43,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:02:43,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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-30 16:02:43,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:43,589 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:43,615 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,615 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,615 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,623 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,623 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,623 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,631 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,631 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,631 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,636 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,637 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,637 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,644 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,644 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,645 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,652 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,652 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,653 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,659 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,659 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,659 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,666 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,666 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,673 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,673 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,673 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,684 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,684 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,685 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,686 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,686 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,686 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,692 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:43,692 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:43,692 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:43,707 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 263 states. [2024-05-30 16:02:43,707 INFO L212 cStratifiedReduction]: Copied states 11 times. [2024-05-30 16:02:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:43,708 INFO L78 Accepts]: Start accepts. Automaton has currently 264 states, but on-demand construction may add more states Word has length 86 [2024-05-30 16:02:43,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:02:43,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:02:43,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:02:43,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:02:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1421900411, now seen corresponding path program 1 times [2024-05-30 16:02:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:02:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194178106] [2024-05-30 16:02:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:02:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:44,459 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-30 16:02:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:02:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194178106] [2024-05-30 16:02:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194178106] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:02:44,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:02:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 16:02:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093797386] [2024-05-30 16:02:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:02:44,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:02:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:02:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:02:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:02:44,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:44,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:02:44,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-30 16:02:44,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:44,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:44,472 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:44,606 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:44,606 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:44,607 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:44,615 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:44,616 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:44,616 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:44,630 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:44,631 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:44,631 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:44,651 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 232 states. [2024-05-30 16:02:44,651 INFO L212 cStratifiedReduction]: Copied states 3 times. [2024-05-30 16:02:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:44,652 INFO L78 Accepts]: Start accepts. Automaton has currently 240 states, but on-demand construction may add more states Word has length 99 [2024-05-30 16:02:44,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:02:44,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:02:44,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:02:44,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:02:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash -612193069, now seen corresponding path program 1 times [2024-05-30 16:02:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:02:44,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120654322] [2024-05-30 16:02:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:02:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:02:44,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:02:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120654322] [2024-05-30 16:02:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120654322] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:02:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128407873] [2024-05-30 16:02:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:44,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:02:44,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:02:44,955 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-30 16:02:44,972 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-30 16:02:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:45,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-30 16:02:45,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:02:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:02:45,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:02:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:02:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128407873] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:02:45,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:02:45,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-05-30 16:02:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438321103] [2024-05-30 16:02:45,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:02:45,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-30 16:02:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:02:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-30 16:02:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-30 16:02:45,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:45,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:02:45,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-30 16:02:45,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:45,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:45,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:45,428 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:45,547 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,547 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:45,547 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:02:45,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,552 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,577 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,578 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:45,578 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,580 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,580 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,581 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,585 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,585 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,585 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,591 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,592 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,595 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,595 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,595 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,599 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,600 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,600 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,615 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,615 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:45,615 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,618 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,618 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,619 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,623 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,623 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,623 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,632 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,633 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,633 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,633 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,633 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:45,633 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,638 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,638 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,638 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,644 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,644 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,644 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:45,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,658 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:45,678 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 385 states. [2024-05-30 16:02:45,678 INFO L212 cStratifiedReduction]: Copied states 44 times. [2024-05-30 16:02:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:02:45,679 INFO L78 Accepts]: Start accepts. Automaton has currently 360 states, but on-demand construction may add more states Word has length 104 [2024-05-30 16:02:45,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:02:45,690 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-30 16:02:45,888 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-30 16:02:45,889 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:02:45,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:02:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 919159833, now seen corresponding path program 1 times [2024-05-30 16:02:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:02:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605819459] [2024-05-30 16:02:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:02:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:02:47,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:02:47,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605819459] [2024-05-30 16:02:47,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605819459] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:02:47,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003924057] [2024-05-30 16:02:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:02:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:02:47,034 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-30 16:02:47,051 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-30 16:02:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:47,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-30 16:02:47,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:02:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:02:47,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:02:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:02:48,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003924057] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:02:48,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:02:48,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 39 [2024-05-30 16:02:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220648795] [2024-05-30 16:02:48,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:02:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-30 16:02:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:02:48,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-30 16:02:48,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2024-05-30 16:02:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:48,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:02:48,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.641025641025641) internal successors, (220), 39 states have internal predecessors, (220), 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-30 16:02:48,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:48,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:02:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:48,474 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:50,155 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,156 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:50,156 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,158 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,158 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,158 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,162 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,166 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,167 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,167 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,169 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,170 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,170 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,187 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,187 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,187 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,192 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,192 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,192 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,196 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,196 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:50,196 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,200 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,205 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,205 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,205 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,213 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,213 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,213 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,214 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,214 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:50,214 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,217 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,217 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,217 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,220 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,220 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,221 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,223 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:50,224 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,224 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:50,276 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 411 states. [2024-05-30 16:02:50,277 INFO L212 cStratifiedReduction]: Copied states 36 times. [2024-05-30 16:02:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:02:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:02:50,277 INFO L78 Accepts]: Start accepts. Automaton has currently 402 states, but on-demand construction may add more states Word has length 118 [2024-05-30 16:02:50,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:02:50,289 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-30 16:02:50,487 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-30 16:02:50,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:02:50,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:02:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1834551417, now seen corresponding path program 2 times [2024-05-30 16:02:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:02:50,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647783768] [2024-05-30 16:02:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:02:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:02:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:02:51,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647783768] [2024-05-30 16:02:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647783768] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:02:51,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689131188] [2024-05-30 16:02:51,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:02:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:02:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:02:51,696 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-30 16:02:51,721 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-30 16:02:51,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:02:51,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:02:51,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjunts are in the unsatisfiable core [2024-05-30 16:02:51,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:02:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:02:53,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:02:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-30 16:02:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689131188] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:02:54,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:02:54,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 17] total 53 [2024-05-30 16:02:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919574648] [2024-05-30 16:02:54,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:02:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-05-30 16:02:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:02:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-05-30 16:02:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2564, Unknown=0, NotChecked=0, Total=2756 [2024-05-30 16:02:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:54,086 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:02:54,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.320754716981132) internal successors, (229), 53 states have internal predecessors, (229), 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-30 16:02:54,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:54,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:54,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:02:54,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:02:54,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:54,087 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:57,258 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:57,258 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:57,258 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,261 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:57,261 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,261 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,273 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:57,273 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,273 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,555 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:57,555 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,555 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:57,632 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 385 states. [2024-05-30 16:02:57,632 INFO L212 cStratifiedReduction]: Copied states 7 times. [2024-05-30 16:02:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:02:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:02:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:02:57,633 INFO L78 Accepts]: Start accepts. Automaton has currently 401 states, but on-demand construction may add more states Word has length 138 [2024-05-30 16:02:57,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:02:57,643 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-30 16:02:57,834 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-30 16:02:57,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:02:57,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:02:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash 330981506, now seen corresponding path program 3 times [2024-05-30 16:02:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:02:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907610904] [2024-05-30 16:02:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:02:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:02:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:02:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:02:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:02:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907610904] [2024-05-30 16:02:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907610904] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:02:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172855483] [2024-05-30 16:02:58,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:02:58,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:02:58,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:02:58,025 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-30 16:02:58,050 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-30 16:02:58,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 16:02:58,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:02:58,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 16:02:58,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:02:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-05-30 16:02:58,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:02:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-05-30 16:02:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172855483] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:02:58,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:02:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2024-05-30 16:02:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283831043] [2024-05-30 16:02:58,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:02:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-30 16:02:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:02:58,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-30 16:02:58,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2024-05-30 16:02:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:58,773 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:02:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.10344827586207) internal successors, (264), 29 states have internal predecessors, (264), 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-30 16:02:58,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:58,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:02:58,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:02:58,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:02:58,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:02:58,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:02:58,774 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:02:59,381 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,381 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:59,381 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,383 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,383 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,383 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,388 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,388 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,388 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,884 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,885 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:02:59,885 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,887 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,888 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,888 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:02:59,960 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,960 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,960 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,963 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,964 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,964 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,969 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,969 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,970 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,973 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:02:59,974 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:02:59,974 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,119 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:00,119 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:00,119 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,121 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:00,121 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,121 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,125 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:00,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,125 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,142 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:00,142 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,142 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,147 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:00,147 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,147 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:00,183 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 574 states. [2024-05-30 16:03:00,183 INFO L212 cStratifiedReduction]: Copied states 37 times. [2024-05-30 16:03:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:00,184 INFO L78 Accepts]: Start accepts. Automaton has currently 602 states, but on-demand construction may add more states Word has length 157 [2024-05-30 16:03:00,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:03:00,195 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-30 16:03:00,391 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-30 16:03:00,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:03:00,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:03:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash -415592150, now seen corresponding path program 4 times [2024-05-30 16:03:00,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:03:00,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012845780] [2024-05-30 16:03:00,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:03:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:03:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 30 proven. 139 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:03:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012845780] [2024-05-30 16:03:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012845780] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:03:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127092447] [2024-05-30 16:03:00,681 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:03:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:00,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:03:00,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:03:00,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 16:03:00,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:03:00,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:03:00,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-30 16:03:00,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:03:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 53 proven. 116 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:00,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:03:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 31 proven. 138 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127092447] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:03:01,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:03:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2024-05-30 16:03:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147646210] [2024-05-30 16:03:01,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:03:01,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-30 16:03:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:03:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-30 16:03:01,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-05-30 16:03:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:01,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:03:01,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 28 states have internal predecessors, (189), 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-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:01,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:01,127 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:03:01,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:01,352 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,354 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,355 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,355 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,359 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,359 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,359 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,504 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,504 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:01,504 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,506 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,506 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,506 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,509 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,509 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,509 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,512 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,512 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,512 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,524 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,524 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,524 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,534 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,534 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:01,534 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,537 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,537 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,537 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,540 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,541 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,541 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,546 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,546 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,546 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,550 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:01,550 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,550 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:01,578 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 610 states. [2024-05-30 16:03:01,578 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:03:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:01,579 INFO L78 Accepts]: Start accepts. Automaton has currently 646 states, but on-demand construction may add more states Word has length 164 [2024-05-30 16:03:01,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:03:01,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-30 16:03:01,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:01,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:03:01,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:03:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1424360617, now seen corresponding path program 5 times [2024-05-30 16:03:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:03:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086543012] [2024-05-30 16:03:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:03:01,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:03:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:04,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:03:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086543012] [2024-05-30 16:03:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086543012] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:03:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026094003] [2024-05-30 16:03:04,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:03:04,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:04,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:03:04,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:03:04,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 16:03:04,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-05-30 16:03:04,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:03:04,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-30 16:03:04,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:03:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:07,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:03:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 1 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026094003] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:03:10,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:03:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 33] total 93 [2024-05-30 16:03:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054535919] [2024-05-30 16:03:10,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:03:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2024-05-30 16:03:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:03:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2024-05-30 16:03:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=8232, Unknown=0, NotChecked=0, Total=8556 [2024-05-30 16:03:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:10,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:03:10,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 4.10752688172043) internal successors, (382), 93 states have internal predecessors, (382), 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-30 16:03:10,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:10,838 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:03:15,239 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,239 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:15,239 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,241 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,241 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,241 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,251 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,252 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,252 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,268 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,268 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:15,269 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,270 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,271 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,271 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,273 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,273 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,273 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,275 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,275 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,275 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,279 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,279 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,280 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,288 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,288 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:15,288 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,290 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,290 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,290 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,294 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,294 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,294 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,300 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,300 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,300 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,303 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:15,303 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,303 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:15,409 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 632 states. [2024-05-30 16:03:15,410 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:15,410 INFO L78 Accepts]: Start accepts. Automaton has currently 668 states, but on-demand construction may add more states Word has length 171 [2024-05-30 16:03:15,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:03:15,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 16:03:15,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-30 16:03:15,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:03:15,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:03:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1510198852, now seen corresponding path program 6 times [2024-05-30 16:03:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:03:15,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619721458] [2024-05-30 16:03:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:03:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:03:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:15,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:03:15,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619721458] [2024-05-30 16:03:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619721458] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:03:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099948264] [2024-05-30 16:03:15,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:03:15,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:15,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:03:15,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:03:15,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 16:03:16,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-30 16:03:16,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:03:16,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-30 16:03:16,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:03:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 82 proven. 196 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:16,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:03:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 53 proven. 225 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099948264] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:03:16,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:03:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2024-05-30 16:03:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854866700] [2024-05-30 16:03:16,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:03:16,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-30 16:03:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:03:16,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-30 16:03:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2024-05-30 16:03:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:16,811 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:03:16,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.176470588235294) internal successors, (210), 34 states have internal predecessors, (210), 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-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:16,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:16,812 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:03:17,125 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:17,125 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,127 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,127 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,127 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,131 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,131 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,131 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,323 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,324 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:17,324 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,326 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,326 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,326 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,328 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,329 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,329 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,331 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,332 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,332 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,335 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,335 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,336 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,346 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,346 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:17,346 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,348 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,348 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,349 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,352 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,359 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,359 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,359 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,363 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:17,363 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,363 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:17,376 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 654 states. [2024-05-30 16:03:17,376 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:03:17,377 INFO L78 Accepts]: Start accepts. Automaton has currently 690 states, but on-demand construction may add more states Word has length 178 [2024-05-30 16:03:17,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:03:17,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-30 16:03:17,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:17,585 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:03:17,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:03:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash -72355195, now seen corresponding path program 7 times [2024-05-30 16:03:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:03:17,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259290875] [2024-05-30 16:03:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:03:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:03:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:03:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259290875] [2024-05-30 16:03:20,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259290875] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:03:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273626029] [2024-05-30 16:03:20,095 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:03:20,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:20,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:03:20,096 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:03:20,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 16:03:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:20,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 78 conjunts are in the unsatisfiable core [2024-05-30 16:03:20,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:03:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:23,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:03:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 1 proven. 349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273626029] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:03:26,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:03:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 38] total 100 [2024-05-30 16:03:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991077731] [2024-05-30 16:03:26,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:03:26,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-05-30 16:03:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:03:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-05-30 16:03:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=9588, Unknown=0, NotChecked=0, Total=9900 [2024-05-30 16:03:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:26,686 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:03:26,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 3.71) internal successors, (371), 100 states have internal predecessors, (371), 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-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:26,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:03:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:26,688 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:03:33,574 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,574 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:33,574 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,576 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,584 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,584 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,641 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,642 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:33,642 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,644 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,644 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,644 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,646 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,646 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,646 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,648 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,648 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,648 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,651 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,651 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,651 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:33,657 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,659 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,659 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,659 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,662 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,662 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,662 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,667 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,667 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,669 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:33,669 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,670 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:33,775 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 676 states. [2024-05-30 16:03:33,775 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:03:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:03:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:33,776 INFO L78 Accepts]: Start accepts. Automaton has currently 712 states, but on-demand construction may add more states Word has length 185 [2024-05-30 16:03:33,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:03:33,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 16:03:33,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 16:03:33,978 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:03:33,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:03:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash -15952854, now seen corresponding path program 8 times [2024-05-30 16:03:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:03:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610814459] [2024-05-30 16:03:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:03:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:03:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 69 proven. 346 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:03:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610814459] [2024-05-30 16:03:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610814459] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:03:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12432468] [2024-05-30 16:03:34,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:03:34,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:03:34,408 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:03:34,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-30 16:03:34,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:03:34,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:03:34,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-30 16:03:34,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:03:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 118 proven. 297 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:34,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:03:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 82 proven. 333 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:03:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12432468] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:03:35,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:03:35,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2024-05-30 16:03:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585834246] [2024-05-30 16:03:35,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:03:35,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-05-30 16:03:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:03:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-05-30 16:03:35,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1331, Unknown=0, NotChecked=0, Total=1560 [2024-05-30 16:03:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:35,151 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:03:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.775) internal successors, (231), 40 states have internal predecessors, (231), 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-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:35,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:35,153 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:03:35,530 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,530 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:35,530 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,532 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,532 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,532 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,536 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,536 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,536 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,819 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,819 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:35,819 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,874 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,876 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,876 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,876 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,878 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,878 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,878 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,881 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,882 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,882 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,897 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,897 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:03:35,898 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,899 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,900 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,900 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,903 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,903 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,903 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,908 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,908 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,908 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,912 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:03:35,912 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,912 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:03:35,924 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 698 states. [2024-05-30 16:03:35,924 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:03:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:03:35,925 INFO L78 Accepts]: Start accepts. Automaton has currently 734 states, but on-demand construction may add more states Word has length 192 [2024-05-30 16:03:35,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:03:35,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-30 16:03:36,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-30 16:03:36,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:03:36,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:03:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash 646879319, now seen corresponding path program 9 times [2024-05-30 16:03:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:03:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271590508] [2024-05-30 16:03:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:03:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:03:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:03:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:03:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271590508] [2024-05-30 16:03:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271590508] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:03:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077994053] [2024-05-30 16:03:39,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:03:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:03:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:03:39,288 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:03:39,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-30 16:03:39,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-05-30 16:03:39,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:03:39,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 90 conjunts are in the unsatisfiable core [2024-05-30 16:03:39,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:03:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 1 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:44,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:03:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:03:51,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077994053] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:03:51,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:03:51,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 43] total 130 [2024-05-30 16:03:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789213644] [2024-05-30 16:03:51,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:03:51,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2024-05-30 16:03:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:03:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2024-05-30 16:03:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=16406, Unknown=0, NotChecked=0, Total=16770 [2024-05-30 16:03:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:51,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:03:51,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 3.6076923076923078) internal successors, (469), 130 states have internal predecessors, (469), 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-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:03:51,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:03:51,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:03:51,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:03:51,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:03:51,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:03:51,697 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:06,935 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,935 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:06,935 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:06,937 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,937 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:06,937 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:06,952 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,952 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:06,952 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:06,972 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:06,973 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:06,973 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,029 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,044 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,044 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,044 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,069 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,069 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:07,069 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,071 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,071 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,071 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,074 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,074 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,074 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,079 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,080 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,082 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:07,082 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,082 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:07,298 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 738 states. [2024-05-30 16:04:07,298 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:04:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:07,299 INFO L78 Accepts]: Start accepts. Automaton has currently 791 states, but on-demand construction may add more states Word has length 199 [2024-05-30 16:04:07,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:07,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 16:04:07,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:07,501 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:07,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 19461436, now seen corresponding path program 10 times [2024-05-30 16:04:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616641893] [2024-05-30 16:04:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 99 proven. 481 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:04:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616641893] [2024-05-30 16:04:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616641893] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696230606] [2024-05-30 16:04:08,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:04:08,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:08,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:08,089 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:04:08,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-30 16:04:08,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:04:08,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:04:08,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-30 16:04:08,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 161 proven. 419 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:04:08,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 118 proven. 462 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:04:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696230606] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:04:09,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:04:09,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2024-05-30 16:04:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898536611] [2024-05-30 16:04:09,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:04:09,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-30 16:04:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:09,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-30 16:04:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1777, Unknown=0, NotChecked=0, Total=2070 [2024-05-30 16:04:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:09,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:09,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.478260869565218) internal successors, (252), 46 states have internal predecessors, (252), 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-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:09,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:09,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:09,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:09,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:09,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:09,033 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:09,455 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,455 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:09,456 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,457 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,457 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,458 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,461 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,462 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,462 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,464 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,464 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,464 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,468 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,468 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,468 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,471 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,471 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,472 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,802 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,802 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:09,802 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,804 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,804 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,804 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,807 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,807 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,807 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,811 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,812 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,812 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,815 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:09,815 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,816 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:09,831 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 760 states. [2024-05-30 16:04:09,831 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:09,832 INFO L78 Accepts]: Start accepts. Automaton has currently 813 states, but on-demand construction may add more states Word has length 206 [2024-05-30 16:04:09,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:09,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-30 16:04:10,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-30 16:04:10,040 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:10,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1825062661, now seen corresponding path program 11 times [2024-05-30 16:04:10,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:10,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353855087] [2024-05-30 16:04:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:10,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:04:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353855087] [2024-05-30 16:04:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353855087] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936339148] [2024-05-30 16:04:14,217 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:04:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:14,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:14,218 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:04:14,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-30 16:04:14,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-05-30 16:04:14,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:04:14,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 102 conjunts are in the unsatisfiable core [2024-05-30 16:04:14,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:04:21,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 1 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:04:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936339148] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:04:29,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:04:29,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 48] total 144 [2024-05-30 16:04:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76686534] [2024-05-30 16:04:29,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:04:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 144 states [2024-05-30 16:04:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2024-05-30 16:04:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=20112, Unknown=0, NotChecked=0, Total=20592 [2024-05-30 16:04:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:29,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:29,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 144 states, 144 states have (on average 3.5277777777777777) internal successors, (508), 144 states have internal predecessors, (508), 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-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:29,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:29,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:29,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:29,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:29,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:29,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:29,591 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:40,858 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:40,859 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,860 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,861 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,861 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,865 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,866 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,866 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,877 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,878 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:40,878 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,879 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,879 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,880 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,881 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,881 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,881 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,883 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,883 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,883 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,886 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,886 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,886 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,892 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,892 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:40,892 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,894 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,894 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,894 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,897 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,898 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,898 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,903 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,903 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,903 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,905 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:40,905 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:40,905 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:41,068 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 764 states. [2024-05-30 16:04:41,068 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:04:41,069 INFO L78 Accepts]: Start accepts. Automaton has currently 800 states, but on-demand construction may add more states Word has length 213 [2024-05-30 16:04:41,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:41,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-30 16:04:41,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-30 16:04:41,276 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:41,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -313022678, now seen corresponding path program 12 times [2024-05-30 16:04:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688521332] [2024-05-30 16:04:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 136 proven. 637 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:04:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688521332] [2024-05-30 16:04:41,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688521332] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104971141] [2024-05-30 16:04:41,958 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:04:41,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:41,960 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:04:41,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-30 16:04:42,225 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-05-30 16:04:42,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:04:42,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-30 16:04:42,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 211 proven. 562 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:04:42,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:04:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 161 proven. 612 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:04:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104971141] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:04:43,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:04:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2024-05-30 16:04:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845154321] [2024-05-30 16:04:43,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:04:43,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-05-30 16:04:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:04:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-05-30 16:04:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2287, Unknown=0, NotChecked=0, Total=2652 [2024-05-30 16:04:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:43,093 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:04:43,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.25) internal successors, (273), 52 states have internal predecessors, (273), 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-30 16:04:43,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:43,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:43,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:43,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:04:43,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:43,094 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:04:43,610 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,611 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:43,611 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,612 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,612 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,612 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,615 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,615 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,615 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,992 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,992 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:43,992 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,994 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,994 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,994 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,996 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,996 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,999 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:43,999 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:43,999 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,003 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:44,003 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,003 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,014 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:44,014 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:04:44,014 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,016 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:44,016 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,016 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,019 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:44,019 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,019 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,025 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:44,025 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,025 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,029 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:04:44,029 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,029 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:04:44,042 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 786 states. [2024-05-30 16:04:44,042 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:04:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:04:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:04:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:04:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:04:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:04:44,044 INFO L78 Accepts]: Start accepts. Automaton has currently 822 states, but on-demand construction may add more states Word has length 220 [2024-05-30 16:04:44,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:04:44,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-05-30 16:04:44,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-30 16:04:44,251 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:04:44,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:04:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1412965719, now seen corresponding path program 13 times [2024-05-30 16:04:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:04:44,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783409935] [2024-05-30 16:04:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:04:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:04:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 887 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:04:49,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:04:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783409935] [2024-05-30 16:04:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783409935] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:04:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099199671] [2024-05-30 16:04:49,138 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:04:49,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:04:49,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:04:49,139 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:04:49,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-30 16:04:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:04:49,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 114 conjunts are in the unsatisfiable core [2024-05-30 16:04:49,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:04:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 0 proven. 887 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:04:57,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:05:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 1 proven. 886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:05:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099199671] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:05:07,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:05:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 53] total 161 [2024-05-30 16:05:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102240393] [2024-05-30 16:05:07,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:05:07,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 161 states [2024-05-30 16:05:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:05:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2024-05-30 16:05:07,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=25228, Unknown=0, NotChecked=0, Total=25760 [2024-05-30 16:05:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:07,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:05:07,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 161 states, 161 states have (on average 3.4161490683229814) internal successors, (550), 161 states have internal predecessors, (550), 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-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:05:07,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:05:07,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:07,467 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:05:21,175 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,176 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:21,176 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,177 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,177 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,177 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,181 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,181 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,181 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,198 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,198 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:21,198 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,199 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,199 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,200 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,202 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,202 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,202 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,205 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,205 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,205 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,208 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,208 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,209 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,214 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,215 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:21,215 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,216 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,216 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,217 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,220 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,220 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,220 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,225 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,225 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,225 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,228 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:21,228 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,228 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:21,434 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 808 states. [2024-05-30 16:05:21,434 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:05:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:05:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:05:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:05:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:05:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:05:21,436 INFO L78 Accepts]: Start accepts. Automaton has currently 844 states, but on-demand construction may add more states Word has length 227 [2024-05-30 16:05:21,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:05:21,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-30 16:05:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-30 16:05:21,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:05:21,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:05:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1315432636, now seen corresponding path program 14 times [2024-05-30 16:05:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:05:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031199689] [2024-05-30 16:05:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:05:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:05:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:05:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 180 proven. 814 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:05:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:05:22,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031199689] [2024-05-30 16:05:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031199689] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:05:22,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266472221] [2024-05-30 16:05:22,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:05:22,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:05:22,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:05:22,455 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:05:22,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-30 16:05:22,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:05:22,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:05:22,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-30 16:05:22,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:05:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 268 proven. 726 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:05:23,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:05:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 211 proven. 783 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:05:23,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266472221] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:05:23,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:05:23,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 58 [2024-05-30 16:05:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117245407] [2024-05-30 16:05:23,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:05:23,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-05-30 16:05:23,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:05:23,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-05-30 16:05:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2861, Unknown=0, NotChecked=0, Total=3306 [2024-05-30 16:05:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:23,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:05:23,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 5.068965517241379) internal successors, (294), 58 states have internal predecessors, (294), 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-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:23,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:05:23,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:05:23,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:05:23,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:23,606 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:05:24,330 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,330 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:24,330 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,331 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,331 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,331 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,334 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,334 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,334 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,896 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,896 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:24,896 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,898 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,898 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,898 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,899 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,899 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,899 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,901 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,901 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,901 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,904 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,904 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,904 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,914 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,914 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:05:24,914 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,915 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,915 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,915 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,918 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,918 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,918 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,922 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,922 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,922 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,925 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:05:24,925 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,925 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:05:24,941 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 830 states. [2024-05-30 16:05:24,942 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:05:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:05:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:05:24,943 INFO L78 Accepts]: Start accepts. Automaton has currently 866 states, but on-demand construction may add more states Word has length 234 [2024-05-30 16:05:24,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:05:24,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-30 16:05:25,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-30 16:05:25,145 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:05:25,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:05:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 200825733, now seen corresponding path program 15 times [2024-05-30 16:05:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:05:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744856138] [2024-05-30 16:05:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:05:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:05:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:05:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:05:28,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:05:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744856138] [2024-05-30 16:05:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744856138] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:05:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335815705] [2024-05-30 16:05:28,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:05:28,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:05:28,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:05:28,416 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:05:28,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-05-30 16:05:28,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-05-30 16:05:28,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:05:28,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 126 conjunts are in the unsatisfiable core [2024-05-30 16:05:28,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:05:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 1 proven. 1121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:05:36,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:05:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:05:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335815705] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:05:44,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:05:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 66, 58] total 170 [2024-05-30 16:05:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978560965] [2024-05-30 16:05:44,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:05:44,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 170 states [2024-05-30 16:05:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:05:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2024-05-30 16:05:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=28288, Unknown=0, NotChecked=0, Total=28730 [2024-05-30 16:05:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:44,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:05:44,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 170 states, 170 states have (on average 3.2529411764705882) internal successors, (553), 170 states have internal predecessors, (553), 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-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:05:44,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:05:44,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:05:44,651 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:06:05,147 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,147 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:05,147 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,149 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,149 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,149 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,151 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,151 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,151 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,153 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,153 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,153 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,219 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,219 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,219 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,223 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,223 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,223 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,243 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,243 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:05,243 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,245 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,245 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,245 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,249 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,249 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,249 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,255 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,255 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,255 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,258 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:05,258 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,258 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:05,488 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 870 states. [2024-05-30 16:06:05,489 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:06:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:06:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:06:05,490 INFO L78 Accepts]: Start accepts. Automaton has currently 923 states, but on-demand construction may add more states Word has length 241 [2024-05-30 16:06:05,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:06:05,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-05-30 16:06:05,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-30 16:06:05,693 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:06:05,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:06:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1654142422, now seen corresponding path program 16 times [2024-05-30 16:06:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:06:05,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182586141] [2024-05-30 16:06:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:06:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:06:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:06:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 231 proven. 1012 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:06:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:06:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182586141] [2024-05-30 16:06:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182586141] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:06:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474230215] [2024-05-30 16:06:06,454 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:06:06,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:06:06,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:06:06,455 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:06:06,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-30 16:06:06,612 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:06:06,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:06:06,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-30 16:06:06,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:06:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 332 proven. 911 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:06:07,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:06:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 268 proven. 975 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:06:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474230215] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:06:07,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:06:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 64 [2024-05-30 16:06:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584846952] [2024-05-30 16:06:07,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:06:07,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-30 16:06:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:06:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-30 16:06:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=3499, Unknown=0, NotChecked=0, Total=4032 [2024-05-30 16:06:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:07,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:06:07,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.921875) internal successors, (315), 64 states have internal predecessors, (315), 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-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:06:07,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:07,837 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:06:08,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:08,543 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:08,543 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,545 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:08,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,545 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,548 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:08,548 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,548 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,551 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:08,551 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,551 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,554 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:08,554 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,554 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,556 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:08,556 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:08,556 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,117 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:09,118 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:09,118 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,119 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:09,119 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,119 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,122 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:09,122 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,122 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,127 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:09,127 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,127 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,131 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:09,132 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,132 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:09,145 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 892 states. [2024-05-30 16:06:09,145 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:06:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:06:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:06:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:06:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:06:09,147 INFO L78 Accepts]: Start accepts. Automaton has currently 945 states, but on-demand construction may add more states Word has length 248 [2024-05-30 16:06:09,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:06:09,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-05-30 16:06:09,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:06:09,350 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:06:09,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:06:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash 994746967, now seen corresponding path program 17 times [2024-05-30 16:06:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:06:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100969507] [2024-05-30 16:06:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:06:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:06:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:06:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 0 proven. 1385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:06:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:06:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100969507] [2024-05-30 16:06:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100969507] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:06:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589769668] [2024-05-30 16:06:15,175 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:06:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:06:15,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:06:15,184 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:06:15,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-30 16:06:15,487 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-05-30 16:06:15,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:06:15,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 138 conjunts are in the unsatisfiable core [2024-05-30 16:06:15,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:06:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 0 proven. 1385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:06:25,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:06:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 1 proven. 1384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:06:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589769668] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:06:39,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:06:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 63] total 195 [2024-05-30 16:06:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080800690] [2024-05-30 16:06:39,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:06:39,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 195 states [2024-05-30 16:06:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:06:39,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2024-05-30 16:06:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=37194, Unknown=0, NotChecked=0, Total=37830 [2024-05-30 16:06:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:39,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:06:39,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 195 states, 195 states have (on average 3.2512820512820513) internal successors, (634), 195 states have internal predecessors, (634), 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-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:06:39,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:06:39,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:39,780 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:06:57,854 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,854 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:57,855 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,856 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,856 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,856 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,860 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,860 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,861 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,873 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,873 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:57,873 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,875 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,876 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,877 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,877 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,878 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,878 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,878 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,881 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,881 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,881 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,886 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,886 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:06:57,886 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,887 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,887 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,887 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,891 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,891 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,891 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,896 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,896 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,896 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,898 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:06:57,898 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:57,898 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:06:58,098 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 896 states. [2024-05-30 16:06:58,098 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:06:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:06:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:06:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:06:58,100 INFO L78 Accepts]: Start accepts. Automaton has currently 932 states, but on-demand construction may add more states Word has length 255 [2024-05-30 16:06:58,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:06:58,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-05-30 16:06:58,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:06:58,303 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:06:58,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:06:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1351420988, now seen corresponding path program 18 times [2024-05-30 16:06:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:06:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33152852] [2024-05-30 16:06:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:06:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:06:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:06:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 289 proven. 1231 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:06:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:06:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33152852] [2024-05-30 16:06:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33152852] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:06:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039314908] [2024-05-30 16:06:59,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:06:59,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:06:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:06:59,305 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:06:59,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-05-30 16:06:59,521 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2024-05-30 16:06:59,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:06:59,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-30 16:06:59,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:07:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 403 proven. 1117 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:07:00,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:07:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 332 proven. 1188 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:07:01,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039314908] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:07:01,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:07:01,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 70 [2024-05-30 16:07:01,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537959153] [2024-05-30 16:07:01,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:07:01,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-05-30 16:07:01,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:07:01,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-05-30 16:07:01,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=4201, Unknown=0, NotChecked=0, Total=4830 [2024-05-30 16:07:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:01,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:07:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.8) internal successors, (336), 70 states have internal predecessors, (336), 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-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:01,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:07:01,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:01,027 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:07:01,837 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:01,837 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:01,837 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:01,839 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:01,839 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:01,839 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:01,843 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:01,843 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:01,843 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,536 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,536 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:02,536 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,538 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,538 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,538 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,539 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,539 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,540 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,542 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,542 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,542 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,545 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,545 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,554 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,554 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:02,554 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,555 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,555 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,555 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,558 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,558 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,558 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,564 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,564 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,565 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,568 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:02,569 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,569 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:02,580 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 918 states. [2024-05-30 16:07:02,580 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:07:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:07:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:07:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:07:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:07:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:07:02,582 INFO L78 Accepts]: Start accepts. Automaton has currently 954 states, but on-demand construction may add more states Word has length 262 [2024-05-30 16:07:02,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:07:02,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-05-30 16:07:02,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-30 16:07:02,788 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:07:02,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:07:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1292283, now seen corresponding path program 19 times [2024-05-30 16:07:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:07:02,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641189937] [2024-05-30 16:07:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:07:02,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:07:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:07:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 0 proven. 1676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:07:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:07:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641189937] [2024-05-30 16:07:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641189937] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:07:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120609934] [2024-05-30 16:07:06,891 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:07:06,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:07:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:07:06,892 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:07:06,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-05-30 16:07:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:07:07,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 150 conjunts are in the unsatisfiable core [2024-05-30 16:07:07,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:07:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 0 proven. 1676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:07:16,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:07:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 1 proven. 1675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:07:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120609934] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:07:20,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:07:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 78, 68] total 151 [2024-05-30 16:07:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28918249] [2024-05-30 16:07:20,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:07:20,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 151 states [2024-05-30 16:07:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:07:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2024-05-30 16:07:20,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=22217, Unknown=0, NotChecked=0, Total=22650 [2024-05-30 16:07:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:20,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:07:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 151 states, 151 states have (on average 3.2450331125827816) internal successors, (490), 151 states have internal predecessors, (490), 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-30 16:07:20,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:20,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:07:20,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:07:20,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:07:20,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:07:20,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:07:20,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:20,249 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:07:34,543 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,544 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:34,544 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,545 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,545 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,549 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,549 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,549 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,562 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,562 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:34,562 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,563 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,563 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,566 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,566 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,566 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,568 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,568 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,569 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,571 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,572 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,572 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:34,576 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,578 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,578 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,578 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,581 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,581 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,581 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,587 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,587 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,587 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,588 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:34,588 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,589 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:34,747 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 940 states. [2024-05-30 16:07:34,748 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:07:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:07:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:07:34,750 INFO L78 Accepts]: Start accepts. Automaton has currently 976 states, but on-demand construction may add more states Word has length 269 [2024-05-30 16:07:34,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:07:34,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-05-30 16:07:34,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:07:34,954 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:07:34,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:07:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash 428408106, now seen corresponding path program 20 times [2024-05-30 16:07:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:07:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214207944] [2024-05-30 16:07:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:07:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:07:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:07:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1832 backedges. 354 proven. 1471 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:07:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:07:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214207944] [2024-05-30 16:07:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214207944] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:07:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484639989] [2024-05-30 16:07:35,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:07:35,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:07:35,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:07:35,942 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:07:35,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-05-30 16:07:36,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:07:36,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:07:36,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 48 conjunts are in the unsatisfiable core [2024-05-30 16:07:36,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:07:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1832 backedges. 481 proven. 1344 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:07:36,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:07:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1832 backedges. 403 proven. 1422 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:07:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484639989] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:07:37,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:07:37,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 76 [2024-05-30 16:07:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790157422] [2024-05-30 16:07:37,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:07:37,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-05-30 16:07:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:07:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-05-30 16:07:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=4967, Unknown=0, NotChecked=0, Total=5700 [2024-05-30 16:07:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:37,579 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:07:37,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.697368421052632) internal successors, (357), 76 states have internal predecessors, (357), 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-30 16:07:37,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:07:37,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:07:37,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:37,581 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:07:38,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:38,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:38,552 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:38,554 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:38,554 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:38,554 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:38,556 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:38,556 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:38,556 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,297 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,297 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:39,297 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,298 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,298 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,298 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,300 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,300 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,300 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,302 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,302 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,302 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,305 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,305 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,305 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,316 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,316 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:07:39,316 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,317 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,317 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,317 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,320 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,320 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,320 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,324 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,324 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,324 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,327 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:07:39,327 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,327 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:07:39,339 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 962 states. [2024-05-30 16:07:39,339 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:07:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:07:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:07:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:07:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:07:39,341 INFO L78 Accepts]: Start accepts. Automaton has currently 998 states, but on-demand construction may add more states Word has length 276 [2024-05-30 16:07:39,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:07:39,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-05-30 16:07:39,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-05-30 16:07:39,545 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:07:39,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:07:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -470151337, now seen corresponding path program 21 times [2024-05-30 16:07:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:07:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200857171] [2024-05-30 16:07:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:07:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:07:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:07:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 0 proven. 1995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:07:47,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:07:47,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200857171] [2024-05-30 16:07:47,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200857171] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:07:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355961834] [2024-05-30 16:07:47,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:07:47,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:07:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:07:47,317 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:07:47,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-05-30 16:07:48,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-05-30 16:07:48,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:07:48,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 163 conjunts are in the unsatisfiable core [2024-05-30 16:07:48,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:08:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 1 proven. 1994 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:08:03,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:08:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 0 proven. 1995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:08:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355961834] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:08:29,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:08:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 85, 84] total 244 [2024-05-30 16:08:29,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101790252] [2024-05-30 16:08:29,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:08:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 244 states [2024-05-30 16:08:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:08:29,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2024-05-30 16:08:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=58584, Unknown=0, NotChecked=0, Total=59292 [2024-05-30 16:08:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:08:29,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:08:29,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 244 states, 244 states have (on average 2.9549180327868854) internal successors, (721), 244 states have internal predecessors, (721), 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-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:08:29,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:08:29,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:08:29,482 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:09:18,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:09:49,375 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,376 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:09:49,376 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,377 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,377 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,377 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,379 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,379 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,379 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,381 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,381 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,381 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,478 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,479 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,479 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,483 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,484 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,578 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,578 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:09:49,578 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,580 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,580 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,580 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,584 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,584 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,589 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:49,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:49,589 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:50,448 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:50,448 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:50,448 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:51,490 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1002 states. [2024-05-30 16:09:51,490 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:09:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:09:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:09:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:09:51,495 INFO L78 Accepts]: Start accepts. Automaton has currently 1055 states, but on-demand construction may add more states Word has length 283 [2024-05-30 16:09:51,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:09:51,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-05-30 16:09:51,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-05-30 16:09:51,699 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:09:51,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:09:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 460087228, now seen corresponding path program 22 times [2024-05-30 16:09:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:09:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980995123] [2024-05-30 16:09:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:09:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:09:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:09:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 426 proven. 1732 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:09:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:09:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980995123] [2024-05-30 16:09:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980995123] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:09:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164659211] [2024-05-30 16:09:52,813 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:09:52,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:09:52,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:09:52,814 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:09:52,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-05-30 16:09:52,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:09:52,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:09:52,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 52 conjunts are in the unsatisfiable core [2024-05-30 16:09:52,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:09:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 566 proven. 1592 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:09:53,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:09:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 481 proven. 1677 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:09:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164659211] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:09:54,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:09:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 82 [2024-05-30 16:09:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634439164] [2024-05-30 16:09:54,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:09:54,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-05-30 16:09:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:09:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-05-30 16:09:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=5797, Unknown=0, NotChecked=0, Total=6642 [2024-05-30 16:09:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:09:54,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:09:54,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.609756097560975) internal successors, (378), 82 states have internal predecessors, (378), 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-30 16:09:54,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:09:54,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:09:54,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:09:54,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:09:54,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:09:54,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:09:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:09:54,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:09:54,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:09:54,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:09:54,751 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:09:55,831 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:55,831 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:09:55,831 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,833 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:55,833 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,833 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,837 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:55,837 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,837 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,839 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:55,839 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,839 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,842 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:55,842 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,842 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,846 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:55,846 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:55,846 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,824 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:56,824 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:09:56,824 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,825 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:56,825 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,826 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,828 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:56,828 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,828 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,832 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:56,832 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,832 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,835 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:09:56,835 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,835 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:09:56,848 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1024 states. [2024-05-30 16:09:56,848 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:09:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:09:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:09:56,849 INFO L78 Accepts]: Start accepts. Automaton has currently 1077 states, but on-demand construction may add more states Word has length 290 [2024-05-30 16:09:56,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:09:56,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-05-30 16:09:57,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:09:57,053 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:09:57,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:09:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash -28310395, now seen corresponding path program 23 times [2024-05-30 16:09:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:09:57,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787062622] [2024-05-30 16:09:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:09:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:09:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:10:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2342 backedges. 0 proven. 2342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:10:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:10:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787062622] [2024-05-30 16:10:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787062622] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:10:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450983554] [2024-05-30 16:10:07,050 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:10:07,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:10:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:10:07,051 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:10:07,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-05-30 16:10:08,348 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-05-30 16:10:08,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:10:08,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 174 conjunts are in the unsatisfiable core [2024-05-30 16:10:08,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:10:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2342 backedges. 0 proven. 2342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:10:26,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:10:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2342 backedges. 1 proven. 2341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:10:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450983554] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:10:51,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:10:51,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 78] total 246 [2024-05-30 16:10:51,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133920839] [2024-05-30 16:10:51,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:10:51,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 246 states [2024-05-30 16:10:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:10:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2024-05-30 16:10:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=59478, Unknown=0, NotChecked=0, Total=60270 [2024-05-30 16:10:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:10:51,204 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:10:51,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 246 states, 246 states have (on average 3.089430894308943) internal successors, (760), 246 states have internal predecessors, (760), 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-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:10:51,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:10:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:10:51,205 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:11:23,162 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:11:23,162 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,164 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,164 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,164 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,168 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,168 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,168 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,188 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,188 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:11:23,188 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,190 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,190 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,190 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,193 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,193 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,193 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,196 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,196 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,196 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,200 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,200 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,200 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,207 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,207 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:11:23,207 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,209 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,209 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,209 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,213 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,213 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,213 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,219 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,219 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,219 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,221 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:23,222 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,222 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:23,484 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1028 states. [2024-05-30 16:11:23,484 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:11:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:11:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:11:23,485 INFO L78 Accepts]: Start accepts. Automaton has currently 1064 states, but on-demand construction may add more states Word has length 297 [2024-05-30 16:11:23,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:11:23,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-05-30 16:11:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-05-30 16:11:23,690 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:11:23,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:11:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1258766378, now seen corresponding path program 24 times [2024-05-30 16:11:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:11:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158250401] [2024-05-30 16:11:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:11:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:11:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:11:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 505 proven. 2014 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:11:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:11:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158250401] [2024-05-30 16:11:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158250401] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:11:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954186128] [2024-05-30 16:11:25,023 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:11:25,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:11:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:11:25,024 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:11:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-05-30 16:11:25,273 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2024-05-30 16:11:25,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:11:25,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 56 conjunts are in the unsatisfiable core [2024-05-30 16:11:25,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:11:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 658 proven. 1861 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:11:26,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:11:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 566 proven. 1953 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:11:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954186128] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:11:27,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:11:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 88 [2024-05-30 16:11:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948289888] [2024-05-30 16:11:27,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:11:27,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-05-30 16:11:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:11:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-05-30 16:11:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=6691, Unknown=0, NotChecked=0, Total=7656 [2024-05-30 16:11:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:11:27,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:11:27,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 4.534090909090909) internal successors, (399), 88 states have internal predecessors, (399), 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-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:11:27,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:11:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:11:27,255 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:11:28,567 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:28,567 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:11:28,567 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:28,568 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:28,568 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:28,568 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:28,571 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:28,571 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:28,571 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,662 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,662 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:11:29,662 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,663 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,663 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,663 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,665 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,665 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,665 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,667 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,667 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,671 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,671 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,671 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,684 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,684 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:11:29,684 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,686 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,686 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,686 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,689 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,689 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,690 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,695 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,695 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,695 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,700 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:11:29,700 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,700 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:11:29,719 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1050 states. [2024-05-30 16:11:29,719 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:11:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:11:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:11:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:11:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:11:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:11:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:11:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:11:29,722 INFO L78 Accepts]: Start accepts. Automaton has currently 1086 states, but on-demand construction may add more states Word has length 304 [2024-05-30 16:11:29,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:11:29,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-05-30 16:11:29,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-05-30 16:11:29,927 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:11:29,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:11:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1753584553, now seen corresponding path program 25 times [2024-05-30 16:11:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:11:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098602056] [2024-05-30 16:11:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:11:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:11:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:11:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:11:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:11:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098602056] [2024-05-30 16:11:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098602056] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:11:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005372389] [2024-05-30 16:11:39,828 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:11:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:11:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:11:39,830 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:11:39,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-05-30 16:11:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:11:40,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 186 conjunts are in the unsatisfiable core [2024-05-30 16:11:40,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:11:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:11:57,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:12:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 1 proven. 2716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:12:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005372389] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:12:24,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:12:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 83] total 263 [2024-05-30 16:12:24,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954159207] [2024-05-30 16:12:24,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:12:24,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 263 states [2024-05-30 16:12:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:12:24,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 263 interpolants. [2024-05-30 16:12:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=68062, Unknown=0, NotChecked=0, Total=68906 [2024-05-30 16:12:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:12:24,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:12:24,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 263 states, 263 states have (on average 3.049429657794677) internal successors, (802), 263 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:12:24,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:12:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:12:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:12:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:12:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:12:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:12:24,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:12:24,009 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:12:56,540 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,541 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:12:56,541 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,542 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,542 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,542 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,547 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,548 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,548 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,568 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,568 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:12:56,568 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,570 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,570 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,570 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,572 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,572 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,572 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,573 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,573 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,574 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,576 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,581 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,581 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:12:56,581 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,582 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,582 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,582 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,585 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,585 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,585 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,589 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,589 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,589 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:12:56,591 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,591 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:12:56,846 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1072 states. [2024-05-30 16:12:56,846 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:12:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:12:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:12:56,847 INFO L78 Accepts]: Start accepts. Automaton has currently 1108 states, but on-demand construction may add more states Word has length 311 [2024-05-30 16:12:56,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:12:56,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-05-30 16:12:57,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-05-30 16:12:57,053 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:12:57,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:12:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1406788412, now seen corresponding path program 26 times [2024-05-30 16:12:57,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:12:57,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378306819] [2024-05-30 16:12:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:12:57,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:12:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:12:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2915 backedges. 591 proven. 2317 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:12:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:12:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378306819] [2024-05-30 16:12:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378306819] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:12:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880275851] [2024-05-30 16:12:58,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:12:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:12:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:12:58,669 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:12:58,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-05-30 16:12:58,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:12:58,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:12:58,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 60 conjunts are in the unsatisfiable core [2024-05-30 16:12:58,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:12:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2915 backedges. 757 proven. 2151 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:12:59,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:13:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2915 backedges. 658 proven. 2250 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:13:01,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880275851] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:13:01,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:13:01,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 94 [2024-05-30 16:13:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510029438] [2024-05-30 16:13:01,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:13:01,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-05-30 16:13:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:13:01,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-05-30 16:13:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1093, Invalid=7649, Unknown=0, NotChecked=0, Total=8742 [2024-05-30 16:13:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:01,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:13:01,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 4.468085106382978) internal successors, (420), 94 states have internal predecessors, (420), 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-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:13:01,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:13:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:01,010 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:13:02,410 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:02,410 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:13:02,410 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:02,411 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:02,411 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:02,411 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:02,414 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:02,414 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:02,414 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,561 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,562 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:13:03,562 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,563 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,563 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,565 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,566 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,566 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,567 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,568 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,568 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,570 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,570 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,570 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,581 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,581 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:13:03,581 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,583 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,583 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,583 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,587 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,587 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,587 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,593 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,593 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,593 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,598 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:13:03,598 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,598 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:13:03,615 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1094 states. [2024-05-30 16:13:03,615 INFO L212 cStratifiedReduction]: Copied states 29 times. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:13:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-05-30 16:13:03,617 INFO L78 Accepts]: Start accepts. Automaton has currently 1130 states, but on-demand construction may add more states Word has length 318 [2024-05-30 16:13:03,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:13:03,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-05-30 16:13:03,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-05-30 16:13:03,829 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:13:03,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:13:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash 198152453, now seen corresponding path program 27 times [2024-05-30 16:13:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:13:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591632116] [2024-05-30 16:13:03,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:13:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:13:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:13:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:13:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:13:10,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591632116] [2024-05-30 16:13:10,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591632116] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:13:10,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816385669] [2024-05-30 16:13:10,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:13:10,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:13:10,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:13:10,418 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:13:10,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-05-30 16:13:11,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-05-30 16:13:11,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:13:11,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 198 conjunts are in the unsatisfiable core [2024-05-30 16:13:11,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:13:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1 proven. 3119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:13:28,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:13:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:13:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816385669] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:13:50,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:13:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 102, 88] total 266 [2024-05-30 16:13:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213796228] [2024-05-30 16:13:50,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:13:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 266 states [2024-05-30 16:13:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:13:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 266 interpolants. [2024-05-30 16:13:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=69820, Unknown=0, NotChecked=0, Total=70490 [2024-05-30 16:13:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:50,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:13:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 266 states, 266 states have (on average 3.026315789473684) internal successors, (805), 266 states have internal predecessors, (805), 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-30 16:13:50,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:50,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:13:50,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:13:50,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:13:50,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:13:50,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:13:50,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-05-30 16:13:50,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:13:50,079 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:49,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,394 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,395 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,396 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,396 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,398 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,398 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,398 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,400 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,400 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,400 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,522 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,523 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,523 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,527 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,527 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,527 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,552 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,553 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,553 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,553 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,556 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,556 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,556 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,561 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,561 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,561 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,563 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,563 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:49,910 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1134 states. [2024-05-30 16:14:49,910 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-05-30 16:14:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-05-30 16:14:49,912 INFO L78 Accepts]: Start accepts. Automaton has currently 1187 states, but on-demand construction may add more states Word has length 325 [2024-05-30 16:14:49,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:49,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-05-30 16:14:50,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:14:50,117 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:50,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1171352790, now seen corresponding path program 28 times [2024-05-30 16:14:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:50,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468135541] [2024-05-30 16:14:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3332 backedges. 684 proven. 2641 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:14:51,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468135541] [2024-05-30 16:14:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468135541] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:14:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149704111] [2024-05-30 16:14:51,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:14:51,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:14:51,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:51,846 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:14:51,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-05-30 16:14:51,976 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:14:51,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:14:51,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 64 conjunts are in the unsatisfiable core [2024-05-30 16:14:51,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:14:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3332 backedges. 863 proven. 2462 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:14:53,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:14:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3332 backedges. 757 proven. 2568 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:14:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149704111] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:14:54,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:14:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 100 [2024-05-30 16:14:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339130585] [2024-05-30 16:14:54,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:14:54,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-05-30 16:14:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:54,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-05-30 16:14:54,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=8671, Unknown=0, NotChecked=0, Total=9900 [2024-05-30 16:14:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:54,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:54,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 4.41) internal successors, (441), 100 states have internal predecessors, (441), 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-30 16:14:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:14:54,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:14:54,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:14:54,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:14:54,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-05-30 16:14:54,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2024-05-30 16:14:54,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:54,671 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:56,392 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,392 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:56,392 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,394 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,398 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,398 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,398 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,400 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,400 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,400 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,404 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,405 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,405 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,407 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,407 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:56,407 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,781 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,781 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:57,782 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,783 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,784 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,784 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,787 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,787 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,787 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,791 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,792 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,792 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,796 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,796 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,796 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ~j1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~m~0, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post3] [2024-05-30 16:14:57,811 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1156 states. [2024-05-30 16:14:57,811 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:14:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:14:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:14:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:14:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-05-30 16:14:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-05-30 16:14:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-05-30 16:14:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-05-30 16:14:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-05-30 16:14:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-05-30 16:14:57,813 INFO L78 Accepts]: Start accepts. Automaton has currently 1209 states, but on-demand construction may add more states Word has length 332 [2024-05-30 16:14:57,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:57,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-05-30 16:14:58,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-05-30 16:14:58,019 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:58,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash 536852823, now seen corresponding path program 29 times [2024-05-30 16:14:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811111537] [2024-05-30 16:14:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 0 proven. 3551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:15:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:15:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811111537] [2024-05-30 16:15:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811111537] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:15:13,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659037652] [2024-05-30 16:15:13,936 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:15:13,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:15:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:15:13,937 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:15:13,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-05-30 16:15:14,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2024-05-30 16:15:14,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:15:14,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 210 conjunts are in the unsatisfiable core [2024-05-30 16:15:14,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:15:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 0 proven. 3551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:15:45,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2024-05-30 16:16:01,129 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:16:01,129 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:16:01,129 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:16:01,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:16:01,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-05-30 16:16:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:16:01,332 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 333 with TraceHistMax 32,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. [2024-05-30 16:16:01,351 INFO L445 BasicCegarLoop]: Path program histogram: [29, 1, 1, 1] [2024-05-30 16:16:01,352 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-30 16:16:01,353 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:16:01,353 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:16:01,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:16:01 BasicIcfg [2024-05-30 16:16:01,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:16:01,355 INFO L158 Benchmark]: Toolchain (without parser) took 799400.01ms. Allocated memory was 160.4MB in the beginning and 901.8MB in the end (delta: 741.3MB). Free memory was 95.6MB in the beginning and 287.0MB in the end (delta: -191.5MB). Peak memory consumption was 550.6MB. Max. memory is 8.0GB. [2024-05-30 16:16:01,355 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 160.4MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:16:01,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.43ms. Allocated memory is still 160.4MB. Free memory was 95.4MB in the beginning and 83.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 16:16:01,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.35ms. Allocated memory is still 160.4MB. Free memory was 83.8MB in the beginning and 134.9MB in the end (delta: -51.1MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2024-05-30 16:16:01,356 INFO L158 Benchmark]: Boogie Preprocessor took 31.81ms. Allocated memory is still 160.4MB. Free memory was 134.9MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:16:01,356 INFO L158 Benchmark]: RCFGBuilder took 461.26ms. Allocated memory is still 160.4MB. Free memory was 133.4MB in the beginning and 119.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-30 16:16:01,356 INFO L158 Benchmark]: TraceAbstraction took 798619.28ms. Allocated memory was 160.4MB in the beginning and 901.8MB in the end (delta: 741.3MB). Free memory was 118.2MB in the beginning and 287.0MB in the end (delta: -168.9MB). Peak memory consumption was 572.5MB. Max. memory is 8.0GB. [2024-05-30 16:16:01,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 160.4MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.43ms. Allocated memory is still 160.4MB. Free memory was 95.4MB in the beginning and 83.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.35ms. Allocated memory is still 160.4MB. Free memory was 83.8MB in the beginning and 134.9MB in the end (delta: -51.1MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.81ms. Allocated memory is still 160.4MB. Free memory was 134.9MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 461.26ms. Allocated memory is still 160.4MB. Free memory was 133.4MB in the beginning and 119.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 798619.28ms. Allocated memory was 160.4MB in the beginning and 901.8MB in the end (delta: 741.3MB). Free memory was 118.2MB in the beginning and 287.0MB in the end (delta: -168.9MB). Peak memory consumption was 572.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7848, independent: 7100, independent conditional: 7100, independent unconditional: 0, dependent: 748, dependent conditional: 748, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7100, independent: 7100, independent conditional: 7100, 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: 7100, independent: 7100, independent conditional: 7100, 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: 7100, independent: 7100, independent conditional: 0, independent unconditional: 7100, 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: 7100, independent: 7100, independent conditional: 0, independent unconditional: 7100, 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: 7100, independent: 7100, independent conditional: 0, independent unconditional: 7100, 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: 7100, independent: 7100, independent conditional: 0, independent unconditional: 7100, 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: 7100, independent: 7100, independent conditional: 0, independent unconditional: 7100, 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: 7100, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7100, unknown conditional: 0, unknown unconditional: 7100] , Statistics on independence cache: Total cache size (in pairs): 7100, Positive cache size: 7100, Positive conditional cache size: 0, Positive unconditional cache size: 7100, 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: 748 - StatisticsResult: Reduction benchmarks 48.6ms Time before loop, 214.8ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 14, Reduction States: 228, Duplicate States: 11, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 19.7ms Time before loop, 97.7ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 14, Reduction States: 263, Duplicate States: 11, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 118.7ms Time before loop, 59.8ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 232, Duplicate States: 3, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 102.0ms Time before loop, 147.8ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 19, Reduction States: 385, Duplicate States: 44, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 1645.2ms Time before loop, 157.3ms Time in loop, 1.8s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 18, Reduction States: 411, Duplicate States: 36, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 3139.0ms Time before loop, 405.4ms Time in loop, 3.5s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 8, Reduction States: 385, Duplicate States: 7, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 551.5ms Time before loop, 857.3ms Time in loop, 1.4s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 18, Reduction States: 574, Duplicate States: 37, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 216.2ms Time before loop, 234.5ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 610, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 4363.2ms Time before loop, 207.9ms Time in loop, 4.6s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 632, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 305.3ms Time before loop, 258.4ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 654, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 6851.5ms Time before loop, 235.5ms Time in loop, 7.1s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 676, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 368.2ms Time before loop, 403.2ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 698, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 15152.6ms Time before loop, 448.4ms Time in loop, 15.6s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 738, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 414.2ms Time before loop, 383.4ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 760, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 11214.6ms Time before loop, 262.5ms Time in loop, 11.5s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 764, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 508.7ms Time before loop, 439.0ms Time in loop, 0.9s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 786, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 13648.1ms Time before loop, 318.5ms Time in loop, 14.0s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 808, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 713.9ms Time before loop, 621.7ms Time in loop, 1.3s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 830, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 20404.7ms Time before loop, 432.3ms Time in loop, 20.8s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 870, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 699.7ms Time before loop, 608.6ms Time in loop, 1.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 892, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 17977.4ms Time before loop, 340.5ms Time in loop, 18.3s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 896, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 802.3ms Time before loop, 750.9ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 918, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 14203.9ms Time before loop, 294.5ms Time in loop, 14.5s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 940, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 963.9ms Time before loop, 794.0ms Time in loop, 1.8s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 962, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 79800.4ms Time before loop, 2207.5ms Time in loop, 82.0s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 1002, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 1073.1ms Time before loop, 1023.6ms Time in loop, 2.1s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 1024, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 31853.8ms Time before loop, 424.5ms Time in loop, 32.3s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 1028, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 1302.0ms Time before loop, 1161.4ms Time in loop, 2.5s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 1050, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 32412.6ms Time before loop, 424.1ms Time in loop, 32.8s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 1072, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 1391.2ms Time before loop, 1214.0ms Time in loop, 2.6s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 17, Reduction States: 1094, Duplicate States: 29, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 59210.9ms Time before loop, 619.9ms Time in loop, 59.8s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 1134, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 1713.0ms Time before loop, 1427.1ms Time in loop, 3.1s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 15, Reduction States: 1156, Duplicate States: 14, Protected Variables: 10 - StatisticsResult: Visitor Statistics States: 193, Transitions: 240, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 193, Transitions: 243, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 134, Transitions: 151, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 283, Transitions: 372, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 281, Transitions: 363, Traversal time: 1.8s - StatisticsResult: Visitor Statistics States: 208, Transitions: 236, Traversal time: 3.5s - StatisticsResult: Visitor Statistics States: 374, Transitions: 452, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 373, Transitions: 450, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 380, Transitions: 457, Traversal time: 4.6s - StatisticsResult: Visitor Statistics States: 387, Transitions: 464, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 394, Transitions: 471, Traversal time: 7.1s - StatisticsResult: Visitor Statistics States: 401, Transitions: 478, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 423, Transitions: 509, Traversal time: 15.6s - StatisticsResult: Visitor Statistics States: 430, Transitions: 516, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 422, Transitions: 499, Traversal time: 11.5s - StatisticsResult: Visitor Statistics States: 429, Transitions: 506, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 436, Transitions: 513, Traversal time: 14.0s - StatisticsResult: Visitor Statistics States: 443, Transitions: 520, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 465, Transitions: 551, Traversal time: 20.8s - StatisticsResult: Visitor Statistics States: 472, Transitions: 558, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 464, Transitions: 541, Traversal time: 18.3s - StatisticsResult: Visitor Statistics States: 471, Transitions: 548, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 478, Transitions: 555, Traversal time: 14.5s - StatisticsResult: Visitor Statistics States: 485, Transitions: 562, Traversal time: 1.8s - StatisticsResult: Visitor Statistics States: 507, Transitions: 593, Traversal time: 82.0s - StatisticsResult: Visitor Statistics States: 514, Transitions: 600, Traversal time: 2.1s - StatisticsResult: Visitor Statistics States: 506, Transitions: 583, Traversal time: 32.3s - StatisticsResult: Visitor Statistics States: 513, Transitions: 590, Traversal time: 2.5s - StatisticsResult: Visitor Statistics States: 520, Transitions: 597, Traversal time: 32.8s - StatisticsResult: Visitor Statistics States: 527, Transitions: 604, Traversal time: 2.6s - StatisticsResult: Visitor Statistics States: 549, Transitions: 635, Traversal time: 59.8s - StatisticsResult: Visitor Statistics States: 556, Transitions: 642, Traversal time: 3.1s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 463, RedundantProofs: 30, ProvenStates: 1788, Times there's more than one choice: 1482, Avg number of choices: 11.705257270693512 - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 333 with TraceHistMax 32,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 249 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 141 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 798.4s, OverallIterations: 32, TraceHistogramMax: 0, PathProgramHistogramMax: 29, EmptinessCheckTime: 340.8s, 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: 2059, 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.6s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 376.5s InterpolantComputationTime, 13143 NumberOfCodeBlocks, 13060 NumberOfCodeBlocksAsserted, 205 NumberOfCheckSat, 19538 ConstructedInterpolants, 0 QuantifiedInterpolants, 195189 SizeOfPredicates, 1434 NumberOfNonLiveVariables, 11222 ConjunctsInSsa, 2185 ConjunctsInUnsatCore, 89 InterpolantComputations, 2 PerfectInterpolantSequences, 13139/107760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown