/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1410.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 22:40:20,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 22:40:20,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 22:40:20,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 22:40:20,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 22:40:20,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 22:40:20,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 22:40:20,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 22:40:20,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 22:40:20,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 22:40:20,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 22:40:20,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 22:40:20,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 22:40:20,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 22:40:20,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 22:40:20,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 22:40:20,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 22:40:20,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 22:40:20,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 22:40:20,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 22:40:20,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 22:40:20,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 22:40:20,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 22:40:20,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 22:40:20,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 22:40:20,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 22:40:20,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 22:40:20,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 22:40:20,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 22:40:20,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 22:40:20,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 22:40:20,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 22:40:20,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 22:40:20,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 22:40:20,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 22:40:20,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 22:40:20,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 22:40:20,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 22:40:20,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 22:40:20,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 22:40:20,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 22:40:20,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 22:40:20,154 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 22:40:20,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 22:40:20,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 22:40:20,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 22:40:20,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 22:40:20,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 22:40:20,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 22:40:20,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 22:40:20,157 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 22:40:20,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 22:40:20,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 22:40:20,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 22:40:20,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 22:40:20,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 22:40:20,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 22:40:20,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 22:40:20,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 22:40:20,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 22:40:20,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 22:40:20,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:40:20,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 22:40:20,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 22:40:20,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 22:40:20,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 22:40:20,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 22:40:20,162 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 22:40:20,162 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 22:40:20,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 22:40:20,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 22:40:20,163 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 22:40:20,163 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 22:40:20,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 22:40:20,163 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-29 22:40:20,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 22:40:20,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 22:40:20,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 22:40:20,407 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 22:40:20,408 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 22:40:20,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1410.bpl [2022-09-29 22:40:20,410 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1410.bpl' [2022-09-29 22:40:20,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 22:40:20,507 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 22:40:20,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 22:40:20,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 22:40:20,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 22:40:20,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 22:40:20,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 22:40:20,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 22:40:20,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 22:40:20,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/1) ... [2022-09-29 22:40:20,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:40:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:40:20,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-29 22:40:20,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-29 22:40:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 22:40:20,737 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 22:40:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 22:40:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 22:40:20,740 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 22:40:20,948 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 22:40:20,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 22:40:22,041 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 22:40:22,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 22:40:22,072 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 22:40:22,076 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:40:22 BoogieIcfgContainer [2022-09-29 22:40:22,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 22:40:22,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 22:40:22,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 22:40:22,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 22:40:22,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:40:20" (1/2) ... [2022-09-29 22:40:22,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a3841f and model type divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 10:40:22, skipping insertion in model container [2022-09-29 22:40:22,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:40:22" (2/2) ... [2022-09-29 22:40:22,087 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1410.bpl [2022-09-29 22:40:22,094 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 22:40:22,105 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 22:40:22,106 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 22:40:22,106 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 22:40:22,294 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 22:40:22,378 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:40:22,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:40:22,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:40:22,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 22:40:22,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-29 22:40:22,428 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:40:22,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 22:40:22,440 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f7c0a63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:40:22,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:40:22,801 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:40:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:40:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1666581645, now seen corresponding path program 1 times [2022-09-29 22:40:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:40:22,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875242528] [2022-09-29 22:40:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:40:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:40:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:40:23,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875242528] [2022-09-29 22:40:23,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875242528] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:40:23,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:40:23,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 22:40:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144181853] [2022-09-29 22:40:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:40:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 22:40:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:40:23,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 22:40:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 22:40:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:23,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:40:23,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 298.0) internal successors, (596), 2 states have internal predecessors, (596), 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) [2022-09-29 22:40:23,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:23,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 22:40:23,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:40:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:40:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1619267054, now seen corresponding path program 1 times [2022-09-29 22:40:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:40:23,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770131467] [2022-09-29 22:40:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:23,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:40:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:40:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:40:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770131467] [2022-09-29 22:40:24,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770131467] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:40:24,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:40:24,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-09-29 22:40:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022155160] [2022-09-29 22:40:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:40:24,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-29 22:40:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:40:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-29 22:40:24,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-09-29 22:40:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:24,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:40:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 41.375) internal successors, (662), 17 states have internal predecessors, (662), 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) [2022-09-29 22:40:24,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:24,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-29 22:40:27,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 22:40:27,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:40:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:40:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash -544697700, now seen corresponding path program 1 times [2022-09-29 22:40:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:40:27,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011746758] [2022-09-29 22:40:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:40:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 143 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-29 22:40:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:40:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011746758] [2022-09-29 22:40:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011746758] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:40:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920029374] [2022-09-29 22:40:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:40:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:40:27,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:40:27,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-29 22:40:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:28,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 243 conjunts are in the unsatisfiable core [2022-09-29 22:40:28,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:40:30,454 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-09-29 22:40:30,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 40 [2022-09-29 22:40:30,468 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-09-29 22:40:30,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 32 [2022-09-29 22:40:30,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 9 treesize of output 3 [2022-09-29 22:40:32,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:40:32,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 14 treesize of output 4 [2022-09-29 22:40:32,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:40:32,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 36 [2022-09-29 22:40:32,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-29 22:40:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:40:32,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:40:32,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920029374] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:40:32,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:40:32,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [14] total 67 [2022-09-29 22:40:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142234886] [2022-09-29 22:40:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:40:32,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-29 22:40:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:40:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-29 22:40:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4173, Unknown=0, NotChecked=0, Total=4422 [2022-09-29 22:40:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:32,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:40:32,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 18.35185185185185) internal successors, (991), 54 states have internal predecessors, (991), 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) [2022-09-29 22:40:32,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:32,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-29 22:40:32,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-29 22:40:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:40:46,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-29 22:40:46,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-09-29 22:40:46,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:40:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:40:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash -47722240, now seen corresponding path program 2 times [2022-09-29 22:40:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:40:46,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168058009] [2022-09-29 22:40:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:40:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:40:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:40:47,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168058009] [2022-09-29 22:40:47,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168058009] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:40:47,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927469178] [2022-09-29 22:40:47,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-29 22:40:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:40:47,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:40:47,470 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:40:47,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-29 22:40:47,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-29 22:40:47,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-29 22:40:47,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 231 conjunts are in the unsatisfiable core [2022-09-29 22:40:47,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:40:47,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-29 22:40:48,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-09-29 22:40:48,592 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-09-29 22:40:48,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-09-29 22:40:48,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-09-29 22:40:49,107 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:40:49,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-09-29 22:40:49,133 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:40:49,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2022-09-29 22:40:49,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:40:49,619 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-09-29 22:40:49,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-09-29 22:40:49,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:40:49,691 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-09-29 22:40:49,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 45 [2022-09-29 22:40:52,324 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-09-29 22:40:52,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-09-29 22:40:52,830 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-09-29 22:40:52,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 59 [2022-09-29 22:40:52,840 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-29 22:40:52,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 61 [2022-09-29 22:40:56,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:40:56,250 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-09-29 22:40:56,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 73 [2022-09-29 22:40:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-09-29 22:40:56,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:40:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927469178] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:40:56,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:40:56,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [11] total 64 [2022-09-29 22:40:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222615317] [2022-09-29 22:40:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:40:56,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-29 22:40:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:40:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-29 22:40:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3791, Unknown=0, NotChecked=0, Total=4032 [2022-09-29 22:40:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:56,573 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:40:56,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 15.035714285714286) internal successors, (842), 56 states have internal predecessors, (842), 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) [2022-09-29 22:40:56,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:56,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-29 22:40:56,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:40:56,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:40:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-29 22:40:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:40:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-09-29 22:40:57,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-29 22:40:58,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:40:58,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:40:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:40:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1417276253, now seen corresponding path program 1 times [2022-09-29 22:40:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:40:58,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137628617] [2022-09-29 22:40:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:40:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:40:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:40:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137628617] [2022-09-29 22:40:58,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137628617] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:40:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82770676] [2022-09-29 22:40:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:40:58,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:40:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:40:58,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:40:58,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-29 22:40:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:40:59,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 2308 conjuncts, 315 conjunts are in the unsatisfiable core [2022-09-29 22:40:59,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:40:59,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-09-29 22:41:00,119 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:41:00,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-09-29 22:41:00,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-29 22:41:01,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-29 22:41:01,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-09-29 22:41:02,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:02,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-09-29 22:41:03,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-29 22:41:03,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-09-29 22:41:05,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:05,914 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-09-29 22:41:05,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 67 [2022-09-29 22:41:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:05,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:05,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2022-09-29 22:41:07,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:07,620 INFO L356 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-09-29 22:41:07,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 38 [2022-09-29 22:41:07,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:07,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:41:07,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 21 [2022-09-29 22:41:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 22:41:07,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:41:22,225 INFO L356 Elim1Store]: treesize reduction 312, result has 4.0 percent of original size [2022-09-29 22:41:22,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 29908 treesize of output 25456 [2022-09-29 22:41:22,531 INFO L356 Elim1Store]: treesize reduction 106, result has 52.9 percent of original size [2022-09-29 22:41:22,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 27168 treesize of output 25961 [2022-09-29 22:41:22,909 INFO L356 Elim1Store]: treesize reduction 16, result has 76.8 percent of original size [2022-09-29 22:41:22,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 27830 treesize of output 26612 [2022-09-29 22:42:13,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_574 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_574) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select .cse0 .cse1))) (< .cse1 v_ArrVal_582) (not (= (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_ArrVal_582) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (= v_ArrVal_582 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= v_ArrVal_582 .cse1) (not (<= 0 v_ArrVal_582))))) is different from false [2022-09-29 22:42:13,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_574 (Array Int Int))) (let ((.cse1 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_574) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (< .cse0 v_ArrVal_582) (= v_ArrVal_582 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= v_ArrVal_582 .cse0) (not (= (select (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_ArrVal_582) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select .cse1 .cse0))) (not (<= 0 v_ArrVal_582))))) is different from false [2022-09-29 22:42:13,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_574 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_574) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))) (or (not (= (select .cse0 .cse1) |c_ULTIMATE.start_fifo_pop_~self#1.base|)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_ArrVal_582))) (< .cse1 v_ArrVal_582) (= v_ArrVal_582 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= v_ArrVal_582 .cse1) (not (<= 0 v_ArrVal_582))))) is different from false [2022-09-29 22:42:13,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_574 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_574) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (or (< .cse0 v_ArrVal_582) (= v_ArrVal_582 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= v_ArrVal_582 .cse0) (not (<= 0 v_ArrVal_582)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select .cse1 .cse0))) (not (= (select (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_ArrVal_582) |c_ULTIMATE.start_fifo_pop_~self#1.base|))))) is different from false [2022-09-29 22:42:13,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_574 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_574) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (or (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select .cse0 .cse1))) (< .cse1 v_ArrVal_582) (= v_ArrVal_582 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= v_ArrVal_582 .cse1) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (store .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_ArrVal_582))) (not (<= 0 v_ArrVal_582))))) is different from false [2022-09-29 22:42:13,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_574 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (.cse1 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_574) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (or (< .cse0 v_ArrVal_582) (= v_ArrVal_582 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (= v_ArrVal_582 .cse0) (not (<= 0 v_ArrVal_582)) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select .cse1 .cse0))) (not (= |c_ULTIMATE.start_fifo_pop_~self#1.base| (select (store .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) v_ArrVal_582)))))) is different from false [2022-09-29 22:42:23,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_573))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (store .cse4 .cse0 v_ArrVal_574) |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select .cse3 .cse2))) (= v_ArrVal_582 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (<= 0 v_ArrVal_582)) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) v_ArrVal_582))) (< .cse2 v_ArrVal_582) (= v_ArrVal_582 .cse2))))))) is different from false [2022-09-29 22:42:23,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_573))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (store .cse4 .cse2 v_ArrVal_574) |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (= v_ArrVal_582 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select .cse0 .cse1))) (not (<= 0 v_ArrVal_582)) (< .cse1 v_ArrVal_582) (= v_ArrVal_582 .cse1) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) v_ArrVal_582))) (not (= .cse2 (select .cse3 .cse1))))))))) is different from false [2022-09-29 22:42:23,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_573))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse3 (select (store .cse4 .cse0 v_ArrVal_574) |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select .cse3 .cse2))) (= v_ArrVal_582 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select (store .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) v_ArrVal_582))) (not (<= 0 v_ArrVal_582)) (< .cse2 v_ArrVal_582) (= v_ArrVal_582 .cse2))))))) is different from false [2022-09-29 22:42:23,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_573))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse0 (select (store .cse4 .cse3 v_ArrVal_574) |c_ULTIMATE.start_main_~#q~1#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select (store .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_main_~#q~1#1.base|) v_ArrVal_582))) (not (= (select .cse1 .cse2) .cse3)) (= v_ArrVal_582 |c_ULTIMATE.start_main_~#q~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#q~1#1.base| (select .cse0 .cse2))) (not (<= 0 v_ArrVal_582)) (< .cse2 v_ArrVal_582) (= v_ArrVal_582 .cse2))))))) is different from false [2022-09-29 22:42:25,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:42:25,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 76 [2022-09-29 22:42:25,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:42:25,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 375 treesize of output 353 [2022-09-29 22:42:25,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:42:25,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 333 treesize of output 299 [2022-09-29 22:42:25,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:42:25,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 239 [2022-09-29 22:42:25,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-29 22:42:25,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:42:25,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2022-09-29 22:42:25,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:42:25,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 89 [2022-09-29 22:42:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 69 not checked. [2022-09-29 22:42:27,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82770676] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-29 22:42:27,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-29 22:42:27,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 97, 84] total 188 [2022-09-29 22:42:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595388552] [2022-09-29 22:42:27,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-29 22:42:27,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2022-09-29 22:42:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:42:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2022-09-29 22:42:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1997, Invalid=29521, Unknown=28, NotChecked=3610, Total=35156 [2022-09-29 22:42:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:42:27,447 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:42:27,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 188 states, 188 states have (on average 14.196808510638299) internal successors, (2669), 188 states have internal predecessors, (2669), 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) [2022-09-29 22:42:27,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:42:27,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-29 22:42:27,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-09-29 22:42:27,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-09-29 22:42:27,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:43:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:43:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-29 22:43:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-09-29 22:43:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-09-29 22:43:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-09-29 22:43:07,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-29 22:43:07,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:43:07,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:43:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:43:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2094841493, now seen corresponding path program 1 times [2022-09-29 22:43:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:43:07,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549174919] [2022-09-29 22:43:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:43:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:43:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:43:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4282 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 3475 trivial. 0 not checked. [2022-09-29 22:43:10,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:43:10,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549174919] [2022-09-29 22:43:10,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549174919] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:43:10,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:43:10,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-09-29 22:43:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111144518] [2022-09-29 22:43:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:43:10,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-09-29 22:43:10,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:43:10,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-09-29 22:43:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-09-29 22:43:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:43:10,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:43:10,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 51.142857142857146) internal successors, (1074), 21 states have internal predecessors, (1074), 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) [2022-09-29 22:43:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:43:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-29 22:43:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-09-29 22:43:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-09-29 22:43:10,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 185 states. [2022-09-29 22:43:10,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:43:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:43:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-29 22:43:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-09-29 22:43:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-09-29 22:43:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-09-29 22:43:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-29 22:43:17,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-29 22:43:17,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:43:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:43:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1841398916, now seen corresponding path program 1 times [2022-09-29 22:43:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:43:17,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680087609] [2022-09-29 22:43:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:43:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:43:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:43:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 145 proven. 314 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-09-29 22:43:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:43:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680087609] [2022-09-29 22:43:18,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680087609] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:43:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216291862] [2022-09-29 22:43:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:43:18,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:43:18,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:43:18,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 22:43:18,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-29 22:43:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:43:19,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 3390 conjuncts, 192 conjunts are in the unsatisfiable core [2022-09-29 22:43:19,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:43:20,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-09-29 22:43:20,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-29 22:43:21,153 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:43:21,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 31 [2022-09-29 22:43:21,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:43:21,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 9 [2022-09-29 22:43:24,660 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:43:24,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-09-29 22:43:24,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:43:24,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-09-29 22:43:25,339 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 22:43:25,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 40 [2022-09-29 22:43:27,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:43:27,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:43:27,831 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-09-29 22:43:27,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2022-09-29 22:43:28,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-09-29 22:43:29,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:43:29,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 17 [2022-09-29 22:43:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 307 proven. 297 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-09-29 22:43:29,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:43:30,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 12 [2022-09-29 22:44:13,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2022-09-29 22:44:13,635 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (or (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse6 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse6 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse5)))))) (< |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-09-29 22:44:13,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (or (< 0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse6 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse6 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse5)))))))) is different from false [2022-09-29 22:44:22,000 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-09-29 22:44:22,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 406 treesize of output 306 [2022-09-29 22:44:22,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 706 treesize of output 676 [2022-09-29 22:44:22,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 580 treesize of output 556 [2022-09-29 22:44:22,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 637 treesize of output 611 [2022-09-29 22:44:22,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 626 treesize of output 596 [2022-09-29 22:44:22,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 681 treesize of output 653 [2022-09-29 22:44:22,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-09-29 22:44:22,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-09-29 22:44:22,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 10 treesize of output 4 [2022-09-29 22:44:22,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 22:44:22,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 121 [2022-09-29 22:44:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 307 proven. 294 refuted. 3 times theorem prover too weak. 71 trivial. 0 not checked. [2022-09-29 22:44:24,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216291862] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-29 22:44:24,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-29 22:44:24,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 71, 70] total 148 [2022-09-29 22:44:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137150933] [2022-09-29 22:44:24,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-29 22:44:24,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-09-29 22:44:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:44:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-09-29 22:44:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=20318, Unknown=99, NotChecked=578, Total=21756 [2022-09-29 22:44:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:44:24,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:44:24,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 22.675675675675677) internal successors, (3356), 148 states have internal predecessors, (3356), 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) [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 187 states. [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-29 22:44:24,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:44:28,557 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_fifo_empty_~self#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4))) (and (= |c_ULTIMATE.start_fifo_empty_#t~mem4#1.base| .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse3 (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse2)))))) (<= (+ |c_ULTIMATE.start_write~$Pointer$_#value#1.base| 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_empty_#in~self#1.offset|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#in~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.base| |c_ULTIMATE.start_fifo_init_~self#1.base|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_fifo_init_~self#1.offset|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ 2 |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse7 (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6)) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse6))))))) (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| .cse9) (= |c_ULTIMATE.start_fifo_init_#in~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (<= (+ 2 |c_ULTIMATE.start_fifo_node_init_~self#1.base|) |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_ULTIMATE.start_fifo_init_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_init_~self#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) (= |c_ULTIMATE.start_fifo_empty_#in~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= .cse0 (select .cse10 .cse9)) (<= (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-09-29 22:44:28,763 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (= |c_ULTIMATE.start_fifo_empty_~self#1.offset| |c_ULTIMATE.start_main_~#q~1#1.offset|) (or (< 0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse6 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (store .cse6 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse5))))))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse8 |c_ULTIMATE.start_fifo_empty_~self#1.offset|) (select .cse8 (+ |c_ULTIMATE.start_fifo_empty_~self#1.offset| 4)))) (<= (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 2) |c_ULTIMATE.start_main_~#q~1#1.base|)) is different from false [2022-09-29 22:44:28,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (= |c_ULTIMATE.start_fifo_empty_~self#1.base| |c_ULTIMATE.start_main_~#q~1#1.base|) (or (< 0 .cse4) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse7 (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse5 (store .cse7 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse6)) (= (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse6))))))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_empty_~self#1.base|))) (= (select .cse9 .cse4) (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) 2) |c_ULTIMATE.start_main_~#q~1#1.base|))) is different from false [2022-09-29 22:44:28,774 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (= .cse4 (select .cse5 .cse6)) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (or (< 0 .cse6) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse9 (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse7 (store .cse9 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse7 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse8)) (= (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse8))))))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|)))) is different from false [2022-09-29 22:44:28,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse1)) (= |c_ULTIMATE.start_main_~#q~1#1.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse1)))))) (= .cse4 (select .cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (= |c_ULTIMATE.start_main_~#q~1#1.offset| 0) (or (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1062 Int) (v_ArrVal_1059 (Array Int Int)) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| Int)) (let ((.cse8 (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_1059))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|) v_ArrVal_1060)) |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse6 (store .cse8 |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_44| v_ArrVal_1062))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse7)) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) .cse7)))))) (< |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| (+ 8 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (<= (+ .cse4 2) |c_ULTIMATE.start_main_~#q~1#1.base|) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-09-29 22:46:49,025 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-09-29 22:46:49,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-09-29 22:46:49,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-29 22:46:49,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:46:49,227 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:152) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:164) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:97) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:121) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:322) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 58 more [2022-09-29 22:46:49,232 INFO L158 Benchmark]: Toolchain (without parser) took 388724.28ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 159.0MB in the beginning and 1.0GB in the end (delta: -842.2MB). Peak memory consumption was 497.0MB. Max. memory is 8.0GB. [2022-09-29 22:46:49,232 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 211.8MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 22:46:49,232 INFO L158 Benchmark]: Boogie Preprocessor took 152.51ms. Allocated memory is still 211.8MB. Free memory was 159.0MB in the beginning and 179.8MB in the end (delta: -20.7MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-09-29 22:46:49,232 INFO L158 Benchmark]: RCFGBuilder took 1414.19ms. Allocated memory was 211.8MB in the beginning and 338.7MB in the end (delta: 126.9MB). Free memory was 179.8MB in the beginning and 277.4MB in the end (delta: -97.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-09-29 22:46:49,233 INFO L158 Benchmark]: TraceAbstraction took 387152.90ms. Allocated memory was 338.7MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 276.9MB in the beginning and 1.0GB in the end (delta: -724.3MB). Peak memory consumption was 487.8MB. Max. memory is 8.0GB. [2022-09-29 22:46:49,234 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 211.8MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 152.51ms. Allocated memory is still 211.8MB. Free memory was 159.0MB in the beginning and 179.8MB in the end (delta: -20.7MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * RCFGBuilder took 1414.19ms. Allocated memory was 211.8MB in the beginning and 338.7MB in the end (delta: 126.9MB). Free memory was 179.8MB in the beginning and 277.4MB in the end (delta: -97.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. * TraceAbstraction took 387152.90ms. Allocated memory was 338.7MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 276.9MB in the beginning and 1.0GB in the end (delta: -724.3MB). Peak memory consumption was 487.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-09-29 22:46:49,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...