/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 05:28:05,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 05:28:05,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 05:28:05,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 05:28:05,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 05:28:05,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 05:28:05,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 05:28:05,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 05:28:05,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 05:28:05,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 05:28:05,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 05:28:05,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 05:28:05,292 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 05:28:05,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 05:28:05,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 05:28:05,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 05:28:05,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 05:28:05,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 05:28:05,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 05:28:05,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 05:28:05,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 05:28:05,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 05:28:05,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 05:28:05,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 05:28:05,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 05:28:05,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 05:28:05,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 05:28:05,296 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 05:28:05,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 05:28:05,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 05:28:05,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 05:28:05,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 05:28:05,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 05:28:05,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 05:28:05,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 05:28:05,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 05:28:05,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 05:28:05,298 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 05:28:05,298 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 05:28:05,298 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-01-26 05:28:05,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 05:28:05,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 05:28:05,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 05:28:05,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 05:28:05,530 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 05:28:05,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2024-01-26 05:28:06,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 05:28:06,703 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 05:28:06,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2024-01-26 05:28:06,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/425812a50/6f80ceaa4bf64fd5865fd80bb1d83358/FLAGd3fcd0989 [2024-01-26 05:28:06,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/425812a50/6f80ceaa4bf64fd5865fd80bb1d83358 [2024-01-26 05:28:06,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 05:28:06,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 05:28:06,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 05:28:06,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 05:28:06,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 05:28:06,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 05:28:06" (1/1) ... [2024-01-26 05:28:06,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132fed4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:06, skipping insertion in model container [2024-01-26 05:28:06,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 05:28:06" (1/1) ... [2024-01-26 05:28:06,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 05:28:06,961 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-01-26 05:28:06,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 05:28:06,983 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 05:28:07,015 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-01-26 05:28:07,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 05:28:07,033 INFO L206 MainTranslator]: Completed translation [2024-01-26 05:28:07,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07 WrapperNode [2024-01-26 05:28:07,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 05:28:07,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 05:28:07,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 05:28:07,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 05:28:07,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,078 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2024-01-26 05:28:07,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 05:28:07,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 05:28:07,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 05:28:07,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 05:28:07,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 05:28:07,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 05:28:07,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 05:28:07,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 05:28:07,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (1/1) ... [2024-01-26 05:28:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 05:28:07,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:07,159 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-01-26 05:28:07,164 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-01-26 05:28:07,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 05:28:07,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 05:28:07,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 05:28:07,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 05:28:07,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 05:28:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 05:28:07,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 05:28:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 05:28:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 05:28:07,183 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 05:28:07,268 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 05:28:07,270 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 05:28:07,592 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 05:28:07,662 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 05:28:07,662 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 05:28:07,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 05:28:07 BoogieIcfgContainer [2024-01-26 05:28:07,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 05:28:07,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 05:28:07,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 05:28:07,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 05:28:07,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 05:28:06" (1/3) ... [2024-01-26 05:28:07,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617fb3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 05:28:07, skipping insertion in model container [2024-01-26 05:28:07,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:28:07" (2/3) ... [2024-01-26 05:28:07,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617fb3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 05:28:07, skipping insertion in model container [2024-01-26 05:28:07,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 05:28:07" (3/3) ... [2024-01-26 05:28:07,671 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2024-01-26 05:28:07,679 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 05:28:07,686 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 05:28:07,686 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 05:28:07,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 05:28:07,764 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 05:28:07,814 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 05:28:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 05:28:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:07,849 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-01-26 05:28:07,884 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-01-26 05:28:07,930 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 05:28:07,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 05:28:07,945 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fe9179f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 05:28:07,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 05:28:08,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:08,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1811752127, now seen corresponding path program 1 times [2024-01-26 05:28:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518338930] [2024-01-26 05:28:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518338930] [2024-01-26 05:28:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518338930] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:28:08,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:28:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 05:28:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655208373] [2024-01-26 05:28:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:28:08,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 05:28:08,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 05:28:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 05:28:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:08,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:08,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 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-01-26 05:28:08,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 05:28:08,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:08,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash -91942350, now seen corresponding path program 1 times [2024-01-26 05:28:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999255362] [2024-01-26 05:28:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:08,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999255362] [2024-01-26 05:28:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999255362] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:28:08,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:28:08,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 05:28:08,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845232687] [2024-01-26 05:28:08,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:28:08,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 05:28:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 05:28:08,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-26 05:28:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:08,959 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:08,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-01-26 05:28:08,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:08,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:09,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 05:28:09,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:09,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 413118951, now seen corresponding path program 1 times [2024-01-26 05:28:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914296229] [2024-01-26 05:28:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914296229] [2024-01-26 05:28:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914296229] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:28:09,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:28:09,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-26 05:28:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018086659] [2024-01-26 05:28:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:28:09,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-26 05:28:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-26 05:28:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-01-26 05:28:09,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:09,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:09,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 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-01-26 05:28:09,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:09,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:09,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:09,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 05:28:09,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:09,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -827457376, now seen corresponding path program 1 times [2024-01-26 05:28:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:09,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743401847] [2024-01-26 05:28:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 05:28:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743401847] [2024-01-26 05:28:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743401847] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482897518] [2024-01-26 05:28:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:09,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:09,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:10,041 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-01-26 05:28:10,067 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-01-26 05:28:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:10,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 05:28:10,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:28:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 05:28:10,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:28:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 05:28:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482897518] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 05:28:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-01-26 05:28:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345347911] [2024-01-26 05:28:10,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:28:10,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 05:28:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 05:28:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-01-26 05:28:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:10,475 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:10,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-01-26 05:28:10,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:10,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:10,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:10,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:10,570 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-01-26 05:28:10,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:10,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:10,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1980166771, now seen corresponding path program 1 times [2024-01-26 05:28:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440259520] [2024-01-26 05:28:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:12,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440259520] [2024-01-26 05:28:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440259520] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017687809] [2024-01-26 05:28:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:12,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:12,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:12,185 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-01-26 05:28:12,207 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-01-26 05:28:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:12,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 57 conjunts are in the unsatisfiable core [2024-01-26 05:28:12,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:28:12,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-01-26 05:28:12,434 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-01-26 05:28:12,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-01-26 05:28:12,942 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 05:28:12,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-01-26 05:28:13,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-01-26 05:28:13,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 05:28:13,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 05:28:14,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-26 05:28:14,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-01-26 05:28:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:14,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:28:16,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse5 (< c_~max3~0 .cse2)) (.cse14 (< c_~max2~0 c_~max3~0)) (.cse7 (+ c_~max1~0 1)) (.cse1 (+ c_~max3~0 1)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse13 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse4))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< c_~max1~0 (select .cse3 c_~A~0.offset)) (= c_~max1~0 .cse0))))) (or .cse5 (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse6 (select .cse8 c_~A~0.offset))) (or (= .cse6 c_~max3~0) (< .cse6 .cse7) (< c_~max3~0 (select .cse8 .cse4))))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse9 (select .cse11 .cse4)) (.cse10 (select .cse11 c_~A~0.offset))) (or (< .cse9 .cse1) (< .cse9 .cse2) (= .cse10 .cse9) (< .cse10 .cse7))))) (or (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max1~0 (select .cse12 c_~A~0.offset)) (< c_~max3~0 (select .cse12 .cse4))))) (and (or .cse13 .cse14) (or (= c_~max1~0 c_~max3~0) .cse5))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse16 (select .cse17 c_~A~0.offset)) (.cse15 (select .cse17 .cse4))) (or (< .cse15 .cse1) (= .cse16 c_~max2~0) (< .cse16 .cse7) (< c_~max2~0 .cse15))))) (or .cse14 (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 c_~A~0.offset))) (or (= .cse18 c_~max2~0) (< .cse18 .cse7) (< c_~max3~0 (select .cse19 .cse4))))))) (or (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse4))) (or (< .cse20 .cse1) (< c_~max1~0 (select .cse21 c_~A~0.offset)) (< c_~max2~0 .cse20))))) .cse13)))) is different from false [2024-01-26 05:28:16,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~max2~0 1))) (let ((.cse3 (+ c_~max1~0 1)) (.cse17 (< c_~max2~0 c_~max3~0)) (.cse4 (< c_~max3~0 .cse11)) (.cse7 (+ c_~max3~0 1)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse19 (= c_~max1~0 c_~max2~0))) (and (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (< c_~max3~0 (select .cse0 .cse1)) (< .cse2 .cse3) (= .cse2 c_~max3~0))))) .cse4) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse1)) (.cse5 (select .cse8 c_~A~0.offset))) (or (= .cse5 c_~max2~0) (< c_~max2~0 .cse6) (< .cse6 .cse7) (< .cse5 .cse3))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse1)) (.cse9 (select .cse12 c_~A~0.offset))) (or (= .cse9 .cse10) (< .cse10 .cse11) (< .cse10 .cse7) (< .cse9 .cse3))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse14 (select .cse13 .cse1))) (or (< c_~max1~0 (select .cse13 c_~A~0.offset)) (< .cse14 .cse11) (< .cse14 .cse7) (= c_~max1~0 .cse14))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (= .cse15 c_~max2~0) (< c_~max3~0 (select .cse16 .cse1)) (< .cse15 .cse3))))) .cse17) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max1~0 (select .cse18 c_~A~0.offset)) (< c_~max3~0 (select .cse18 .cse1))))) (and (or .cse19 .cse17) (or (= c_~max1~0 c_~max3~0) .cse4))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse1))) (or (< c_~max1~0 (select .cse20 c_~A~0.offset)) (< c_~max2~0 .cse21) (< .cse21 .cse7))))) .cse19)))) is different from false [2024-01-26 05:28:17,274 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~max1~0 1)) (.cse14 (< c_~max3~0 .cse2))) (and (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse5 c_~A~0.offset))) (or (= .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (< .cse1 .cse4))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (= c_~max2~0 .cse7) (< c_~max3~0 (select .cse8 .cse6)) (< .cse7 .cse4))))) .cse9) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6))) (or (< c_~max2~0 .cse10) (< .cse10 .cse3) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse6)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (or .cse12 .cse9) (or (= c_~max1~0 c_~max3~0) .cse14))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 c_~A~0.offset))) (or (< c_~max2~0 .cse15) (= c_~max2~0 .cse16) (< .cse15 .cse3) (< .cse16 .cse4))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6))) (or (= .cse18 c_~max1~0) (< .cse18 .cse2) (< .cse18 .cse3) (< c_~max1~0 (select .cse19 c_~A~0.offset)))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (= .cse20 c_~max3~0) (< c_~max3~0 (select .cse21 .cse6)) (< .cse20 .cse4))))) .cse14)))) is different from false [2024-01-26 05:28:17,726 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~max1~0 1)) (.cse14 (< c_~max3~0 .cse2))) (and (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse5 c_~A~0.offset))) (or (= .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (< .cse1 .cse4))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (= c_~max2~0 .cse7) (< c_~max3~0 (select .cse8 .cse6)) (< .cse7 .cse4))))) .cse9) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6))) (or (< c_~max2~0 .cse10) (< .cse10 .cse3) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse6)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (or .cse12 .cse9) (or (= c_~max1~0 c_~max3~0) .cse14))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 c_~A~0.offset))) (or (< c_~max2~0 .cse15) (= c_~max2~0 .cse16) (< .cse15 .cse3) (< .cse16 .cse4))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6))) (or (= .cse18 c_~max1~0) (< .cse18 .cse2) (< .cse18 .cse3) (< c_~max1~0 (select .cse19 c_~A~0.offset)))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (= .cse20 c_~max3~0) (< c_~max3~0 (select .cse21 .cse6)) (< .cse20 .cse4))))) .cse14)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2024-01-26 05:28:17,816 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse12 (= c_~max1~0 c_~max2~0)) (.cse9 (< c_~max2~0 c_~max3~0)) (.cse3 (+ c_~max3~0 1)) (.cse6 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~max1~0 1)) (.cse14 (< c_~max3~0 .cse2))) (and (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse5 c_~A~0.offset))) (or (= .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (< .cse1 .cse4))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (= c_~max2~0 .cse7) (< c_~max3~0 (select .cse8 .cse6)) (< .cse7 .cse4))))) .cse9) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6))) (or (< c_~max2~0 .cse10) (< .cse10 .cse3) (< c_~max1~0 (select .cse11 c_~A~0.offset)))))) .cse12) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (or (< c_~max3~0 (select .cse13 .cse6)) (< c_~max1~0 (select .cse13 c_~A~0.offset))))) (and (or .cse12 .cse9) (or (= c_~max1~0 c_~max3~0) .cse14))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse6)) (.cse16 (select .cse17 c_~A~0.offset))) (or (< c_~max2~0 .cse15) (= c_~max2~0 .cse16) (< .cse15 .cse3) (< .cse16 .cse4))))) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse6))) (or (= .cse18 c_~max1~0) (< .cse18 .cse2) (< .cse18 .cse3) (< c_~max1~0 (select .cse19 c_~A~0.offset)))))) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (= .cse20 c_~max3~0) (< c_~max3~0 (select .cse21 .cse6)) (< .cse20 .cse4))))) .cse14)))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2024-01-26 05:28:20,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~max2~0 1))) (let ((.cse6 (= c_~max1~0 c_~max2~0)) (.cse10 (< c_~max2~0 c_~max3~0)) (.cse15 (< c_~max3~0 .cse3)) (.cse1 (+ c_~max3~0 1)) (.cse9 (+ c_~max1~0 1))) (and (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse0 .cse1) (< c_~max1~0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= c_~max1~0 .cse0) (< .cse0 .cse3))))))) (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse4 .cse1) (< c_~max1~0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 .cse4) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)))))) .cse6) (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse7 c_~max2~0) (< c_~max3~0 (select .cse8 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< .cse7 .cse9))))) .cse10) (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse11 .cse1) (= .cse12 c_~max2~0) (< c_~max2~0 .cse11) (< .cse12 .cse9))))) (< c_~N~0 (+ ~M~0 1)))) (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max1~0 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1))))) (and (or .cse6 .cse10) (or (= c_~max1~0 c_~max3~0) .cse15))) (or (forall ((~M~0 Int) (v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse16 c_~max3~0) (< c_~max3~0 (select .cse17 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (< .cse16 .cse9))))) .cse15) (forall ((~M~0 Int)) (or (< ~M~0 0) (< c_~N~0 (+ ~M~0 1)) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse20 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse18 .cse1) (< .cse18 .cse3) (= .cse19 .cse18) (< .cse19 .cse9)))))))))) is different from false [2024-01-26 05:28:22,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:22,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2024-01-26 05:28:22,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:22,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1189 treesize of output 1141 [2024-01-26 05:28:22,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:22,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 529 treesize of output 457 [2024-01-26 05:28:23,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:23,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 205 [2024-01-26 05:28:23,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:23,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 201 [2024-01-26 05:28:24,602 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 05:28:24,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 1 [2024-01-26 05:28:24,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:24,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2024-01-26 05:28:24,629 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 05:28:24,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 531 treesize of output 511 [2024-01-26 05:28:24,658 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 05:28:24,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 263 [2024-01-26 05:28:24,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 05:28:24,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2024-01-26 05:28:24,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 05:28:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 223 [2024-01-26 05:28:24,834 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 05:28:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2024-01-26 05:28:24,849 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 05:28:24,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2024-01-26 05:28:24,859 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 05:28:24,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 1 [2024-01-26 05:28:24,872 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 05:28:24,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2024-01-26 05:28:26,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-01-26 05:28:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017687809] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:28:26,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:28:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 28] total 75 [2024-01-26 05:28:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756758996] [2024-01-26 05:28:26,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:28:26,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-01-26 05:28:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:26,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-01-26 05:28:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=3974, Unknown=27, NotChecked=834, Total=5550 [2024-01-26 05:28:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:26,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:26,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.706666666666667) internal successors, (353), 75 states have internal predecessors, (353), 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-01-26 05:28:26,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:26,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:26,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:26,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:26,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:29,774 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-01-26 05:28:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:29,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:29,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1399724122, now seen corresponding path program 2 times [2024-01-26 05:28:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:29,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914527322] [2024-01-26 05:28:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 05:28:30,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914527322] [2024-01-26 05:28:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914527322] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169820877] [2024-01-26 05:28:30,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 05:28:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:30,267 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-01-26 05:28:30,308 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-01-26 05:28:30,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 05:28:30,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:28:30,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 05:28:30,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:28:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 05:28:30,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:28:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 05:28:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169820877] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:28:30,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:28:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-01-26 05:28:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909218260] [2024-01-26 05:28:30,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:28:30,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-26 05:28:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-26 05:28:30,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-01-26 05:28:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:30,848 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:30,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 24 states have internal predecessors, (188), 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-01-26 05:28:30,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:30,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:30,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:30,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:30,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:30,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:31,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-26 05:28:31,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:31,338 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:31,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1713544953, now seen corresponding path program 3 times [2024-01-26 05:28:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562264895] [2024-01-26 05:28:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:28:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562264895] [2024-01-26 05:28:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562264895] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610071466] [2024-01-26 05:28:31,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 05:28:31,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:31,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:31,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 05:28:31,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-26 05:28:31,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-26 05:28:31,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:28:31,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 05:28:31,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:28:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:28:31,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:28:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:28:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610071466] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:28:32,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:28:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 22 [2024-01-26 05:28:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30195140] [2024-01-26 05:28:32,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:28:32,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-26 05:28:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:32,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-26 05:28:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-01-26 05:28:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:32,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:32,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 22 states have internal predecessors, (224), 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-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:32,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:28:32,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-26 05:28:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-26 05:28:33,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:33,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1608063660, now seen corresponding path program 1 times [2024-01-26 05:28:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27198591] [2024-01-26 05:28:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:35,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:35,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27198591] [2024-01-26 05:28:35,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27198591] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916035528] [2024-01-26 05:28:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:35,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 05:28:35,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 05:28:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:35,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 53 conjunts are in the unsatisfiable core [2024-01-26 05:28:35,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:28:38,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:38,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 74 [2024-01-26 05:28:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:38,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:28:42,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:28:42,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 527 treesize of output 263 [2024-01-26 05:28:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916035528] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:28:45,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:28:45,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 27] total 76 [2024-01-26 05:28:45,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150401254] [2024-01-26 05:28:45,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:28:45,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-01-26 05:28:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-01-26 05:28:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=5050, Unknown=0, NotChecked=0, Total=5700 [2024-01-26 05:28:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:45,246 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:45,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.921052631578948) internal successors, (374), 76 states have internal predecessors, (374), 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-01-26 05:28:45,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:28:45,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:28:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:28:47,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-26 05:28:47,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:47,782 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:47,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1861242052, now seen corresponding path program 2 times [2024-01-26 05:28:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:47,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341789935] [2024-01-26 05:28:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 05:28:48,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341789935] [2024-01-26 05:28:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341789935] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705599320] [2024-01-26 05:28:48,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 05:28:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:48,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 05:28:48,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-26 05:28:48,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 05:28:48,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:28:48,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-26 05:28:48,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:28:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 05:28:48,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:28:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-26 05:28:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705599320] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:28:48,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:28:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-01-26 05:28:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002131649] [2024-01-26 05:28:48,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:28:48,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-01-26 05:28:48,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:28:48,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-01-26 05:28:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-01-26 05:28:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:48,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:28:48,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.078947368421052) internal successors, (231), 38 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:28:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:28:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:28:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:28:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:28:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:28:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:28:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-01-26 05:28:50,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-26 05:28:50,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-01-26 05:28:50,232 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:28:50,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:28:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1610044353, now seen corresponding path program 3 times [2024-01-26 05:28:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:28:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793355214] [2024-01-26 05:28:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:28:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:28:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:28:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:28:57,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:28:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793355214] [2024-01-26 05:28:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793355214] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:28:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148728165] [2024-01-26 05:28:57,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 05:28:57,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:28:57,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:28:57,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 05:28:57,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-26 05:28:57,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-26 05:28:57,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:28:57,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 61 conjunts are in the unsatisfiable core [2024-01-26 05:28:57,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:29:06,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 05:29:06,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:29:06,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 506 treesize of output 230 [2024-01-26 05:29:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:29:13,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:29:25,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:29:25,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 809 treesize of output 328 [2024-01-26 05:29:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-26 05:29:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148728165] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:29:30,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:29:30,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 41, 34] total 111 [2024-01-26 05:29:30,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542985539] [2024-01-26 05:29:30,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:29:30,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-01-26 05:29:30,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:29:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-01-26 05:29:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=11450, Unknown=0, NotChecked=0, Total=12210 [2024-01-26 05:29:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:30,355 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:29:30,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.981981981981982) internal successors, (442), 111 states have internal predecessors, (442), 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-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-01-26 05:29:30,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-01-26 05:29:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-01-26 05:29:45,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-26 05:29:45,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:29:45,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:29:45,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:29:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1373807509, now seen corresponding path program 4 times [2024-01-26 05:29:45,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:29:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295981360] [2024-01-26 05:29:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:29:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:29:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:29:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 05:29:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:29:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295981360] [2024-01-26 05:29:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295981360] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:29:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895819020] [2024-01-26 05:29:45,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 05:29:45,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:29:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:29:45,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 05:29:45,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-26 05:29:45,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 05:29:45,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:29:45,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-26 05:29:45,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:29:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 05:29:46,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:29:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 05:29:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895819020] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:29:46,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:29:46,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2024-01-26 05:29:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703525919] [2024-01-26 05:29:46,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:29:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-01-26 05:29:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:29:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-01-26 05:29:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2024-01-26 05:29:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:46,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:29:46,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.520833333333333) internal successors, (265), 48 states have internal predecessors, (265), 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-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:29:46,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:29:46,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:29:46,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-01-26 05:29:46,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-01-26 05:29:46,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-01-26 05:29:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-01-26 05:29:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-26 05:29:48,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-26 05:29:48,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:29:48,261 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:29:48,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:29:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1251275898, now seen corresponding path program 5 times [2024-01-26 05:29:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:29:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987224248] [2024-01-26 05:29:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:29:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:29:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:29:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 5 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:29:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:29:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987224248] [2024-01-26 05:29:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987224248] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:29:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149141146] [2024-01-26 05:29:58,502 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 05:29:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:29:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:29:58,503 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 05:29:58,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-26 05:29:58,634 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-01-26 05:29:58,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:29:58,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 76 conjunts are in the unsatisfiable core [2024-01-26 05:29:58,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:30:13,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 05:30:13,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 600 treesize of output 268 [2024-01-26 05:30:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:30:13,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2024-01-26 05:42:16,228 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 05:42:16,228 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-01-26 05:42:16,228 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-01-26 05:42:17,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-01-26 05:42:17,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-01-26 05:42:17,433 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-01-26 05:42:17,557 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-01-26 05:42:17,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 05:42:17,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-26 05:42:17,558 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 184 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2024-01-26 05:42:17,561 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2024-01-26 05:42:17,562 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-01-26 05:42:17,563 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 05:42:17,563 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 05:42:17,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 05:42:17 BasicIcfg [2024-01-26 05:42:17,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 05:42:17,565 INFO L158 Benchmark]: Toolchain (without parser) took 850827.06ms. Allocated memory was 250.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 208.2MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-01-26 05:42:17,565 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 05:42:17,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.77ms. Allocated memory is still 250.6MB. Free memory was 207.9MB in the beginning and 195.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 05:42:17,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.54ms. Allocated memory is still 250.6MB. Free memory was 195.6MB in the beginning and 193.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 05:42:17,566 INFO L158 Benchmark]: Boogie Preprocessor took 45.86ms. Allocated memory is still 250.6MB. Free memory was 193.9MB in the beginning and 192.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 05:42:17,566 INFO L158 Benchmark]: RCFGBuilder took 537.82ms. Allocated memory is still 250.6MB. Free memory was 192.1MB in the beginning and 169.8MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-01-26 05:42:17,566 INFO L158 Benchmark]: TraceAbstraction took 849900.04ms. Allocated memory was 250.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 169.1MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-01-26 05:42:17,567 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.09ms. Allocated memory is still 208.7MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.77ms. Allocated memory is still 250.6MB. Free memory was 207.9MB in the beginning and 195.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.54ms. Allocated memory is still 250.6MB. Free memory was 195.6MB in the beginning and 193.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.86ms. Allocated memory is still 250.6MB. Free memory was 193.9MB in the beginning and 192.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.82ms. Allocated memory is still 250.6MB. Free memory was 192.1MB in the beginning and 169.8MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 849900.04ms. Allocated memory was 250.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 169.1MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13431, independent: 12716, independent conditional: 12716, independent unconditional: 0, dependent: 715, dependent conditional: 715, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12716, independent: 12716, independent conditional: 12716, 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: 12716, independent: 12716, independent conditional: 12716, 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: 12716, independent: 12716, independent conditional: 0, independent unconditional: 12716, 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: 12716, independent: 12716, independent conditional: 0, independent unconditional: 12716, 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: 12716, independent: 12716, independent conditional: 0, independent unconditional: 12716, 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: 292, independent: 292, independent conditional: 0, independent unconditional: 292, 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: 292, independent: 292, independent conditional: 0, independent unconditional: 292, 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: 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: 12716, independent: 12424, independent conditional: 0, independent unconditional: 12424, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 292, unknown conditional: 0, unknown unconditional: 292] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 292, Positive conditional cache size: 0, Positive unconditional cache size: 292, 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: 715 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 184 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 185 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 849.7s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 25.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 342, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 71.6s InterpolantComputationTime, 2706 NumberOfCodeBlocks, 2693 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3861 ConstructedInterpolants, 65 QuantifiedInterpolants, 98692 SizeOfPredicates, 178 NumberOfNonLiveVariables, 2668 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 27 InterpolantComputations, 4 PerfectInterpolantSequences, 367/745 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