/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/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 03:59:18,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 03:59:18,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 03:59:18,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 03:59:18,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 03:59:18,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 03:59:18,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 03:59:18,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 03:59:18,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 03:59:18,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 03:59:18,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 03:59:18,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 03:59:18,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 03:59:18,701 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 03:59:18,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 03:59:18,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 03:59:18,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 03:59:18,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 03:59:18,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 03:59:18,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 03:59:18,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 03:59:18,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 03:59:18,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 03:59:18,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 03:59:18,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 03:59:18,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 03:59:18,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 03:59:18,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 03:59:18,704 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 03:59:18,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 03:59:18,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 03:59:18,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 03:59:18,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 03:59:18,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 03:59:18,716 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 03:59:18,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-03 03:59:18,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 03:59:18,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 03:59:18,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 03:59:18,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 03:59:18,933 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 03:59:18,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-05-03 03:59:20,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 03:59:20,187 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 03:59:20,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-05-03 03:59:20,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1950db7c5/b34be65f25414890aa2f8bf40554c97d/FLAG156c4f10c [2024-05-03 03:59:20,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1950db7c5/b34be65f25414890aa2f8bf40554c97d [2024-05-03 03:59:20,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 03:59:20,208 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 03:59:20,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 03:59:20,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 03:59:20,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 03:59:20,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9499d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20, skipping insertion in model container [2024-05-03 03:59:20,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,229 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 03:59:20,343 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/bench-exp2x3.wvr.c[2237,2250] [2024-05-03 03:59:20,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 03:59:20,370 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 03:59:20,384 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/bench-exp2x3.wvr.c[2237,2250] [2024-05-03 03:59:20,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 03:59:20,395 INFO L206 MainTranslator]: Completed translation [2024-05-03 03:59:20,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20 WrapperNode [2024-05-03 03:59:20,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 03:59:20,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 03:59:20,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 03:59:20,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 03:59:20,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,418 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-05-03 03:59:20,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 03:59:20,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 03:59:20,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 03:59:20,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 03:59:20,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 03:59:20,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 03:59:20,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 03:59:20,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 03:59:20,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (1/1) ... [2024-05-03 03:59:20,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 03:59:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:59:20,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 03:59:20,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 03:59:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 03:59:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 03:59:20,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 03:59:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 03:59:20,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 03:59:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-03 03:59:20,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-03 03:59:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-03 03:59:20,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-03 03:59:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 03:59:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 03:59:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 03:59:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 03:59:20,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 03:59:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 03:59:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 03:59:20,499 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 03:59:20,565 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 03:59:20,566 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 03:59:20,710 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 03:59:20,719 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 03:59:20,719 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-03 03:59:20,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 03:59:20 BoogieIcfgContainer [2024-05-03 03:59:20,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 03:59:20,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 03:59:20,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 03:59:20,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 03:59:20,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 03:59:20" (1/3) ... [2024-05-03 03:59:20,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6562dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 03:59:20, skipping insertion in model container [2024-05-03 03:59:20,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:59:20" (2/3) ... [2024-05-03 03:59:20,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6562dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 03:59:20, skipping insertion in model container [2024-05-03 03:59:20,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 03:59:20" (3/3) ... [2024-05-03 03:59:20,725 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-05-03 03:59:20,734 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 03:59:20,742 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 03:59:20,742 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 03:59:20,743 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 03:59:20,845 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-03 03:59:20,885 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:59:20,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:59:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:59:20,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:59:20,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 03:59:20,928 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:59:20,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:59:20,940 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;@27fd8010, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:59:20,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:59:20,946 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:59:21,064 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,065 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,065 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,101 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,101 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,102 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,117 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,146 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,146 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,146 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,157 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,158 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,158 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,175 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,175 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,175 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,182 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,182 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,182 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,188 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,188 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,188 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,202 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,202 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,202 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,211 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,211 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,211 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,233 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,234 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,234 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,248 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,248 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,248 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,259 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,259 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,259 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,270 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,271 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,271 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,286 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,286 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,286 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,297 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,297 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,297 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,316 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,316 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,316 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,323 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,323 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,323 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,333 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,333 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,333 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,343 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,343 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,343 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,376 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,376 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,377 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,410 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,410 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,410 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,416 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,416 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,416 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,435 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,435 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,436 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,453 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,454 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,455 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,467 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,467 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,468 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,478 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,479 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,479 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,481 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,482 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,482 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,486 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,486 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,486 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,493 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,494 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,494 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,508 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,509 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,509 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,513 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 419 states. [2024-05-03 03:59:21,513 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:59:21,516 INFO L78 Accepts]: Start accepts. Automaton has currently 560 states, but on-demand construction may add more states Word has length 95 [2024-05-03 03:59:21,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:59:21,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:59:21,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:59:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1137327282, now seen corresponding path program 1 times [2024-05-03 03:59:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:59:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390683377] [2024-05-03 03:59:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:59:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:59:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:59:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:59:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390683377] [2024-05-03 03:59:21,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390683377] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:59:21,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:59:21,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 03:59:21,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087345392] [2024-05-03 03:59:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:59:21,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 03:59:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:59:21,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 03:59:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 03:59:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:21,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:59:21,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:59:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:21,852 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:59:21,891 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,892 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,892 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,904 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,904 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,904 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,908 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,908 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,908 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,914 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,914 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,914 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,922 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,922 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,922 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,927 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,927 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,927 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,937 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,937 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,938 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,940 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,940 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,940 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,947 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,947 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,948 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,952 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,952 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,952 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,957 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,957 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,957 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,962 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,963 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,963 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,968 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,968 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,968 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,971 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,972 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,972 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,976 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,976 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,976 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,981 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,982 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,982 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,987 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,987 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,987 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:21,990 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:21,991 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:21,991 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,001 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,001 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,001 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,007 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,007 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,007 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,012 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,012 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,012 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,018 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,019 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,020 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,024 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,026 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,027 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,032 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,032 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,032 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,037 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,037 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,038 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,045 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,045 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,045 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,048 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,048 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,048 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,050 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,050 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,050 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,054 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,054 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,054 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,058 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,058 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,058 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,064 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,065 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,065 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,071 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 547 states. [2024-05-03 03:59:22,072 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:59:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:22,072 INFO L78 Accepts]: Start accepts. Automaton has currently 721 states, but on-demand construction may add more states Word has length 93 [2024-05-03 03:59:22,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:59:22,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 03:59:22,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:59:22,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:59:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2081383793, now seen corresponding path program 1 times [2024-05-03 03:59:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:59:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191283810] [2024-05-03 03:59:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:59:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:59:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:59:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:59:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191283810] [2024-05-03 03:59:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191283810] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:59:22,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:59:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-03 03:59:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482610249] [2024-05-03 03:59:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:59:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 03:59:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:59:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 03:59:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-03 03:59:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:22,832 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:59:22,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:59:22,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:22,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:22,834 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:59:22,988 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,989 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,989 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:22,995 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:22,995 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:22,995 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,000 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,000 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,000 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,005 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,005 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,005 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,010 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,010 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,010 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,014 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,015 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,015 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,017 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,017 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,017 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,020 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,020 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,020 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,023 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,024 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,024 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,028 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,028 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,028 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,033 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,033 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,033 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,036 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,037 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,037 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,040 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,041 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,041 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,044 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,044 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,044 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,049 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,049 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,049 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,056 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,056 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,056 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,061 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,061 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,062 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,065 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,066 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,066 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,070 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,070 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,070 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,075 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,075 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,075 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,086 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,086 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,086 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,092 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,094 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,094 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,098 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,098 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,098 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,103 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,103 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,103 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,108 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,108 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,108 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,115 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,116 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,116 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,119 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,119 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,119 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,121 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,121 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,121 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,124 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,124 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,124 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,127 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,127 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,127 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,132 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:23,133 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:23,133 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:23,153 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 562 states. [2024-05-03 03:59:23,156 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:59:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 03:59:23,157 INFO L78 Accepts]: Start accepts. Automaton has currently 736 states, but on-demand construction may add more states Word has length 95 [2024-05-03 03:59:23,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:59:23,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 03:59:23,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:59:23,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:59:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash -937489326, now seen corresponding path program 1 times [2024-05-03 03:59:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:59:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033843524] [2024-05-03 03:59:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:59:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:59:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:59:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:23,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:59:23,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033843524] [2024-05-03 03:59:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033843524] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 03:59:23,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721486805] [2024-05-03 03:59:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:59:23,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 03:59:23,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:59:23,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 03:59:23,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 03:59:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:59:23,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-03 03:59:23,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 03:59:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:23,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 03:59:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:24,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721486805] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 03:59:24,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 03:59:24,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-05-03 03:59:24,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989795975] [2024-05-03 03:59:24,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 03:59:24,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-03 03:59:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:59:24,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-03 03:59:24,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-05-03 03:59:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:24,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:59:24,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:59:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 03:59:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:24,047 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:59:24,326 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,326 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,326 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,330 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,331 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,331 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,333 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,333 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,333 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,336 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,337 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,337 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,340 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,341 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,341 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,344 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,344 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,345 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,347 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,347 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,347 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,349 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,349 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,349 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,351 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,351 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,352 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,354 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,354 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,354 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,378 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,378 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,379 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,381 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,381 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,381 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,383 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,384 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,384 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,386 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,387 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,387 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,390 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,390 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,390 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,394 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,394 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,394 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,398 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,398 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,398 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,401 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,401 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,401 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,405 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,405 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,405 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,409 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,409 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,409 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,414 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,414 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,414 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,419 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,419 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,419 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,422 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,422 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,422 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,426 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,426 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,426 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,431 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,431 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,431 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,438 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,438 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,438 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,442 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,442 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,443 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,445 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,445 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,445 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,448 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,449 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,449 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,452 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,453 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,453 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 03:59:24,456 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,457 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,457 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,462 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,462 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,463 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,466 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,466 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,466 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,469 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,470 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,470 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,473 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,474 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,474 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,478 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,478 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,478 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,501 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,501 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,501 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,503 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,503 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,503 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,506 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,506 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,506 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,507 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,507 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,507 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,509 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,509 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,509 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,511 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,511 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,511 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,514 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,514 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,514 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,515 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,515 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,515 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,521 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,521 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 03:59:24,521 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,522 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 03:59:24,522 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,522 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 03:59:24,573 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 642 states. [2024-05-03 03:59:24,573 INFO L212 cStratifiedReduction]: Copied states 18 times. [2024-05-03 03:59:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:59:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 03:59:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:59:24,574 INFO L78 Accepts]: Start accepts. Automaton has currently 873 states, but on-demand construction may add more states Word has length 97 [2024-05-03 03:59:24,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:59:24,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 03:59:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-03 03:59:24,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:59:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:59:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1692702037, now seen corresponding path program 1 times [2024-05-03 03:59:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:59:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566433757] [2024-05-03 03:59:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:59:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:59:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:59:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:59:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566433757] [2024-05-03 03:59:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566433757] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 03:59:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862210672] [2024-05-03 03:59:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:59:25,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 03:59:25,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:59:25,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 03:59:25,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 03:59:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:59:25,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjunts are in the unsatisfiable core [2024-05-03 03:59:25,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 03:59:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:59:53,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 04:00:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 04:00:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862210672] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 04:00:08,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 04:00:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2024-05-03 04:00:08,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651071548] [2024-05-03 04:00:08,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 04:00:08,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-03 04:00:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 04:00:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-03 04:00:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=546, Unknown=5, NotChecked=0, Total=702 [2024-05-03 04:00:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:00:08,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 04:00:08,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.333333333333333) internal successors, (198), 27 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 04:00:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:00:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:00:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:00:08,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:00:08,396 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 04:00:18,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 04:00:22,530 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-03 04:00:24,572 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-03 04:00:32,111 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,111 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,112 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,114 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,114 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,114 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,117 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,119 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,119 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,119 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,121 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,121 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,121 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,123 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,124 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,124 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,126 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,126 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,126 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,127 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,128 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,128 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,186 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,187 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,187 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,188 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,189 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,189 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,190 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,190 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,190 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,191 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,191 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,191 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,193 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,193 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,193 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,195 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,195 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,197 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,197 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,197 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,197 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,198 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,199 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,199 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,199 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,201 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,202 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,202 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,203 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,203 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,203 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,205 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,205 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,205 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,207 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,207 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,207 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,210 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,210 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,210 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,213 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,213 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,213 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,215 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,215 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,215 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,218 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,218 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,218 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,221 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,221 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,221 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,224 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,224 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,224 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,228 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,228 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,228 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,230 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,230 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,231 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,233 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,233 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,233 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,236 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,236 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,236 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,240 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,240 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,240 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,260 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,260 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,260 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,262 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,262 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,262 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,265 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,265 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,265 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,267 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,267 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,268 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,270 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,270 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,270 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,304 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,304 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,304 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,308 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,308 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,308 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,310 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,310 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,310 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,313 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,313 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,313 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,316 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,316 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,316 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,342 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,342 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,342 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,344 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,344 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,344 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,346 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,346 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,346 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,347 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,347 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,347 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,348 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,348 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,348 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,350 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,350 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,350 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,352 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,352 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,352 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,353 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,353 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,353 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,371 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,371 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 04:00:32,371 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,372 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 04:00:32,372 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,372 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ~x3~0, ~x4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 04:00:32,418 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 798 states. [2024-05-03 04:00:32,418 INFO L212 cStratifiedReduction]: Copied states 45 times. [2024-05-03 04:00:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 04:00:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 04:00:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 04:00:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-03 04:00:32,419 INFO L78 Accepts]: Start accepts. Automaton has currently 1053 states, but on-demand construction may add more states Word has length 101 [2024-05-03 04:00:32,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 04:00:32,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 04:00:32,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:00:32,620 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 04:00:32,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 04:00:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash -94158565, now seen corresponding path program 2 times [2024-05-03 04:00:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 04:00:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415315598] [2024-05-03 04:00:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 04:00:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 04:00:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 04:00:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 04:00:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 04:00:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415315598] [2024-05-03 04:00:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415315598] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 04:00:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302314772] [2024-05-03 04:00:32,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 04:00:32,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 04:00:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 04:00:32,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 04:00:32,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 04:09:56,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 04:09:56,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 04:09:56,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjunts are in the unsatisfiable core [2024-05-03 04:09:56,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 04:10:32,559 WARN L293 SmtUtils]: Spent 7.85s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:11:56,710 WARN L293 SmtUtils]: Spent 11.22s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:12:45,392 WARN L293 SmtUtils]: Spent 14.24s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 04:13:39,195 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* (- 1) c_~x1~0))) (let ((.cse9 (div .cse10 4)) (.cse6 (div .cse10 2)) (.cse7 (mod (div c_~x2~0 2) 4294967296))) (let ((.cse2 (+ .cse7 1)) (.cse5 (+ (mod (* 4294967295 .cse6) 4294967296) 1)) (.cse1 (mod c_~x2~0 4294967296)) (.cse4 (mod c_~x3~0 4294967296)) (.cse0 (+ (mod (* 4294967295 .cse9) 4294967296) 1)) (.cse3 (mod c_~x1~0 4294967296)) (.cse8 (mod (* 4294967295 (div .cse10 8)) 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (<= .cse2 .cse3) (= .cse4 (mod c_~x4~0 4294967296)) (<= .cse5 .cse3) (= (mod .cse6 2) 0) (= .cse7 .cse8) (<= .cse2 .cse1) (= (mod c_~x1~0 2) 0) (<= .cse5 .cse1) (= (mod .cse9 2) 0) (<= 1 .cse4) (<= .cse0 .cse3) (<= 1 .cse8))))) is different from false Received shutdown request... [2024-05-03 04:13:58,944 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 04:13:58,949 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-03 04:13:58,949 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-03 04:13:59,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 04:13:59,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 04:14:00,151 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-03 04:14:00,158 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 04:14:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-03 04:14:00,158 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 102 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2024-05-03 04:14:00,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-03 04:14:00,175 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-05-03 04:14:00,177 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/5) [2024-05-03 04:14:00,178 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 04:14:00,179 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 04:14:00,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 04:14:00 BasicIcfg [2024-05-03 04:14:00,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 04:14:00,182 INFO L158 Benchmark]: Toolchain (without parser) took 879973.30ms. Allocated memory was 275.8MB in the beginning and 471.9MB in the end (delta: 196.1MB). Free memory was 202.1MB in the beginning and 290.5MB in the end (delta: -88.4MB). Peak memory consumption was 108.0MB. Max. memory is 8.0GB. [2024-05-03 04:14:00,182 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 04:14:00,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.32ms. Allocated memory is still 275.8MB. Free memory was 201.9MB in the beginning and 240.2MB in the end (delta: -38.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-03 04:14:00,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.61ms. Allocated memory is still 275.8MB. Free memory was 240.2MB in the beginning and 238.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 04:14:00,182 INFO L158 Benchmark]: Boogie Preprocessor took 15.77ms. Allocated memory is still 275.8MB. Free memory was 238.6MB in the beginning and 237.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 04:14:00,183 INFO L158 Benchmark]: RCFGBuilder took 284.57ms. Allocated memory is still 275.8MB. Free memory was 237.1MB in the beginning and 221.8MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-03 04:14:00,183 INFO L158 Benchmark]: TraceAbstraction took 879459.94ms. Allocated memory was 275.8MB in the beginning and 471.9MB in the end (delta: 196.1MB). Free memory was 220.3MB in the beginning and 290.5MB in the end (delta: -70.2MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. [2024-05-03 04:14:00,184 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.32ms. Allocated memory is still 275.8MB. Free memory was 201.9MB in the beginning and 240.2MB in the end (delta: -38.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.61ms. Allocated memory is still 275.8MB. Free memory was 240.2MB in the beginning and 238.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.77ms. Allocated memory is still 275.8MB. Free memory was 238.6MB in the beginning and 237.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.57ms. Allocated memory is still 275.8MB. Free memory was 237.1MB in the beginning and 221.8MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 879459.94ms. Allocated memory was 275.8MB in the beginning and 471.9MB in the end (delta: 196.1MB). Free memory was 220.3MB in the beginning and 290.5MB in the end (delta: -70.2MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3302, independent: 3018, independent conditional: 3018, independent unconditional: 0, dependent: 284, dependent conditional: 284, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3018, independent: 3018, independent conditional: 3018, 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: 3018, independent: 3018, independent conditional: 3018, 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: 3018, independent: 3018, independent conditional: 0, independent unconditional: 3018, 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: 3018, independent: 3018, independent conditional: 0, independent unconditional: 3018, 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: 3018, independent: 3018, independent conditional: 0, independent unconditional: 3018, 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: 3018, independent: 3018, independent conditional: 0, independent unconditional: 3018, 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: 3018, independent: 3018, independent conditional: 0, independent unconditional: 3018, 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: 3018, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3018, unknown conditional: 0, unknown unconditional: 3018] , Statistics on independence cache: Total cache size (in pairs): 3018, Positive cache size: 3018, Positive conditional cache size: 0, Positive unconditional cache size: 3018, 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: 284 - StatisticsResult: Reduction benchmarks 28.1ms Time before loop, 539.0ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 35, Reduction States: 419, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 30.5ms Time before loop, 188.4ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 35, Reduction States: 547, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 136.5ms Time before loop, 182.6ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 35, Reduction States: 562, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 256.1ms Time before loop, 269.1ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 5, overall guesses: 50, Reduction States: 642, Duplicate States: 18, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 23139.8ms Time before loop, 882.4ms Time in loop, 24.0s Time in total, Has Loop: 1, wrong guesses: 11, overall guesses: 56, Reduction States: 798, Duplicate States: 45, Protected Variables: 7 - StatisticsResult: Visitor Statistics States: 252, Transitions: 331, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 252, Transitions: 333, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 254, Transitions: 335, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 324, Transitions: 454, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 455, Transitions: 697, Traversal time: 24.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 5, RedundantProofs: 3, ProvenStates: 252, Times there's more than one choice: 210, Avg number of choices: 2.9404761904761907 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 102 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 9 procedures, 141 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 879.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 25.7s, 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: 42, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 44.8s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 12362 SizeOfPredicates, 23 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/9 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