/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-10-03 15:30:48,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:30:48,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:30:48,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:30:48,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:30:48,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:30:48,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:30:48,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:30:48,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:30:48,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:30:48,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:30:48,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:30:48,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:30:48,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:30:48,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:30:48,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:30:48,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:30:48,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:30:48,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:30:48,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:30:48,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:30:48,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:30:48,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:30:48,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:30:48,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:30:48,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:30:48,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:30:48,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:30:48,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:30:48,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:30:48,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:30:48,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:30:48,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:30:48,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:30:48,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:30:48,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:30:48,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:30:48,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:30:48,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:30:48,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:30:48,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:30:48,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:30:48,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:30:48,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:30:48,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:30:48,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:30:48,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:30:48,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:30:48,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:30:48,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:30:48,320 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:30:48,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:30:48,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:30:48,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:30:48,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:30:48,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:30:48,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:30:48,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:30:48,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:30:48,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:30:48,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:30:48,325 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-10-03 15:30:48,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:30:48,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:30:48,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:30:48,590 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:30:48,590 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:30:48,592 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-10-03 15:30:48,592 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1410.bpl' [2022-10-03 15:30:48,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:30:48,684 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:30:48,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:30:48,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:30:48,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:30:48,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:30:48,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:30:48,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:30:48,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:30:48,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/1) ... [2022-10-03 15:30:48,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:30:48,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:48,864 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-10-03 15:30:48,874 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-10-03 15:30:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:30:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:30:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:30:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:30:48,909 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 15:30:49,099 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:30:49,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:30:50,268 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:30:50,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:30:50,296 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:30:50,302 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:30:50 BoogieIcfgContainer [2022-10-03 15:30:50,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:30:50,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:30:50,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:30:50,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:30:50,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:30:48" (1/2) ... [2022-10-03 15:30:50,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ced9f6d and model type divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:30:50, skipping insertion in model container [2022-10-03 15:30:50,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1410.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:30:50" (2/2) ... [2022-10-03 15:30:50,310 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1410.bpl [2022-10-03 15:30:50,317 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:30:50,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:30:50,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:30:50,326 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:30:50,485 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:30:50,543 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:30:50,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:30:50,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:50,547 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-10-03 15:30:50,552 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-10-03 15:30:50,596 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:30:50,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:30:50,609 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;@762e979b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:30:50,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:30:51,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1666581645, now seen corresponding path program 1 times [2022-10-03 15:30:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:51,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858111408] [2022-10-03 15:30:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:30:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:51,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858111408] [2022-10-03 15:30:51,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858111408] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:51,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:30:51,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:30:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23755648] [2022-10-03 15:30:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:51,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:30:51,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:30:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:30:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:51,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:51,701 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-10-03 15:30:51,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:51,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:30:51,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1619267054, now seen corresponding path program 1 times [2022-10-03 15:30:51,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:51,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158459597] [2022-10-03 15:30:51,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:51,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:30:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:53,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158459597] [2022-10-03 15:30:53,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158459597] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:30:53,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:30:53,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 15:30:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139302896] [2022-10-03 15:30:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:30:53,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 15:30:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:30:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 15:30:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 15:30:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:53,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:30:53,026 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-10-03 15:30:53,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:53,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:30:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:30:55,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:30:55,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:30:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:30:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -544697700, now seen corresponding path program 1 times [2022-10-03 15:30:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:30:55,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741278993] [2022-10-03 15:30:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:30:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 143 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 15:30:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:30:56,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741278993] [2022-10-03 15:30:56,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741278993] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:30:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485116578] [2022-10-03 15:30:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:30:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:30:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:30:56,117 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-10-03 15:30:56,127 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-10-03 15:30:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:30:56,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 243 conjunts are in the unsatisfiable core [2022-10-03 15:30:56,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:30:58,495 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:30:58,496 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-10-03 15:30:58,509 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-03 15:30:58,510 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-10-03 15:30:58,529 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-10-03 15:31:00,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:00,194 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-10-03 15:31:00,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:31:00,344 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-10-03 15:31:00,516 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-10-03 15:31:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:31:00,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:31:00,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485116578] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:00,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:31:00,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [14] total 67 [2022-10-03 15:31:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937080910] [2022-10-03 15:31:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:00,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-10-03 15:31:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:00,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-10-03 15:31:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4173, Unknown=0, NotChecked=0, Total=4422 [2022-10-03 15:31:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:00,628 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:00,629 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-10-03 15:31:00,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:00,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:31:00,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:31:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:31:14,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 15:31:14,380 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-10-03 15:31:14,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:14,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash -47722240, now seen corresponding path program 2 times [2022-10-03 15:31:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094847121] [2022-10-03 15:31:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:31:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094847121] [2022-10-03 15:31:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094847121] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:31:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920070554] [2022-10-03 15:31:15,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 15:31:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:31:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:31:15,116 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-10-03 15:31:15,122 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-10-03 15:31:15,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-03 15:31:15,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 15:31:15,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 231 conjunts are in the unsatisfiable core [2022-10-03 15:31:15,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:31:15,640 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-10-03 15:31:16,032 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-10-03 15:31:16,263 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-03 15:31:16,264 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-10-03 15:31:16,270 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-10-03 15:31:16,800 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:31:16,801 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-10-03 15:31:16,829 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:31:16,829 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-10-03 15:31:17,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:31:17,346 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-10-03 15:31:17,346 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-10-03 15:31:17,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:31:17,364 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-03 15:31:17,364 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-10-03 15:31:20,275 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-10-03 15:31:20,276 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-10-03 15:31:20,733 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:31:20,733 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-10-03 15:31:20,741 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 15:31:20,741 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-10-03 15:31:24,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:31:24,423 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-10-03 15:31:24,423 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-10-03 15:31:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 15:31:24,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:31:24,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920070554] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:31:24,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:31:24,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [11] total 64 [2022-10-03 15:31:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372750573] [2022-10-03 15:31:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:31:24,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-10-03 15:31:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:31:24,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-10-03 15:31:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3791, Unknown=0, NotChecked=0, Total=4032 [2022-10-03 15:31:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:24,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:31:24,744 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-10-03 15:31:24,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:24,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 15:31:24,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:31:24,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:31:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-03 15:31:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:31:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-10-03 15:31:26,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 15:31:26,285 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-10-03 15:31:26,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:31:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:31:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1417276253, now seen corresponding path program 1 times [2022-10-03 15:31:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:31:26,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835752847] [2022-10-03 15:31:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:26,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:31:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:31:26,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:31:26,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835752847] [2022-10-03 15:31:26,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835752847] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:31:26,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18874917] [2022-10-03 15:31:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:31:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:31:26,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:31:26,896 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-10-03 15:31:26,899 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-10-03 15:31:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:31:27,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 2308 conjuncts, 315 conjunts are in the unsatisfiable core [2022-10-03 15:31:27,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:31:27,950 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-10-03 15:31:28,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:31:28,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, 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-10-03 15:31:28,582 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-10-03 15:31:30,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 15:31:30,295 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-10-03 15:31:31,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:31,152 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-10-03 15:31:32,076 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-10-03 15:31:32,083 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-10-03 15:31:34,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:34,795 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 15:31:34,796 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-10-03 15:31:34,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:34,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:34,803 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-10-03 15:31:36,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,507 INFO L356 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2022-10-03 15:31:36,508 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-10-03 15:31:36,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:31:36,515 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-10-03 15:31:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:31:36,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:31:49,829 INFO L356 Elim1Store]: treesize reduction 312, result has 4.0 percent of original size [2022-10-03 15:31:49,830 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-10-03 15:31:50,111 INFO L356 Elim1Store]: treesize reduction 106, result has 52.9 percent of original size [2022-10-03 15:31:50,113 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-10-03 15:31:50,495 INFO L356 Elim1Store]: treesize reduction 16, result has 76.8 percent of original size [2022-10-03 15:31:50,496 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-10-03 15:32:36,609 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-10-03 15:32:36,660 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-10-03 15:32:36,688 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-10-03 15:32:36,874 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-10-03 15:32:36,896 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-10-03 15:32:36,976 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-10-03 15:32:44,347 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-10-03 15:32:44,407 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-10-03 15:32:44,441 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-10-03 15:32:44,504 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-10-03 15:32:46,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:46,454 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-10-03 15:32:46,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:46,465 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-10-03 15:32:46,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:32:46,481 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-10-03 15:32:46,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:32:46,493 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-10-03 15:32:46,547 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-10-03 15:32:46,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:46,557 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-10-03 15:32:46,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:32:46,795 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-10-03 15:32:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 69 not checked. [2022-10-03 15:32:48,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18874917] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:32:48,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:32:48,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 97, 84] total 188 [2022-10-03 15:32:48,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976060675] [2022-10-03 15:32:48,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:32:48,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2022-10-03 15:32:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:32:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2022-10-03 15:32:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1997, Invalid=29521, Unknown=28, NotChecked=3610, Total=35156 [2022-10-03 15:32:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:48,583 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:32:48,584 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-10-03 15:32:48,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:32:48,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-10-03 15:32:48,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-10-03 15:32:48,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-10-03 15:32:48,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-03 15:33:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-10-03 15:33:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-10-03 15:33:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-10-03 15:33:28,045 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-10-03 15:33:28,225 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-10-03 15:33:28,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:33:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:33:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2094841493, now seen corresponding path program 1 times [2022-10-03 15:33:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:33:28,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784235704] [2022-10-03 15:33:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:33:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:33:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:33:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4282 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 3475 trivial. 0 not checked. [2022-10-03 15:33:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:33:29,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784235704] [2022-10-03 15:33:29,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784235704] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:33:29,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:33:29,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-10-03 15:33:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610730369] [2022-10-03 15:33:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:33:29,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-03 15:33:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:33:29,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-03 15:33:29,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-10-03 15:33:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:29,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:33:29,958 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-10-03 15:33:29,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:29,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-10-03 15:33:29,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-10-03 15:33:29,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-10-03 15:33:29,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 185 states. [2022-10-03 15:33:29,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:33:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-03 15:33:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-10-03 15:33:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-10-03 15:33:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-10-03 15:33:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:33:36,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 15:33:36,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:33:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:33:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1841398916, now seen corresponding path program 1 times [2022-10-03 15:33:36,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:33:36,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555706452] [2022-10-03 15:33:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:33:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:33:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:33:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 145 proven. 314 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-10-03 15:33:37,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:33:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555706452] [2022-10-03 15:33:37,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555706452] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:33:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576702249] [2022-10-03 15:33:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:33:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:33:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:33:37,964 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-10-03 15:33:37,968 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-10-03 15:33:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:33:38,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 3390 conjuncts, 192 conjunts are in the unsatisfiable core [2022-10-03 15:33:38,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:33:39,219 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-10-03 15:33:40,051 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-10-03 15:33:40,244 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:33:40,245 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-10-03 15:33:40,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:40,253 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-10-03 15:33:43,596 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:33:43,596 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-10-03 15:33:43,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:43,610 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-10-03 15:33:44,240 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:33:44,240 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-10-03 15:33:46,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:46,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:33:46,890 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-03 15:33:46,890 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-10-03 15:33:47,088 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-10-03 15:33:48,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:33:48,296 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-10-03 15:33:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 307 proven. 297 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-10-03 15:33:48,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:33:49,360 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-10-03 15:34:37,198 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-10-03 15:34:37,217 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-10-03 15:34:37,319 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-10-03 15:34:45,000 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 15:34:45,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-10-03 15:34:45,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,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-10-03 15:34:45,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,034 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-10-03 15:34:45,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,052 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-10-03 15:34:45,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,073 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-10-03 15:34:45,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,095 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-10-03 15:34:45,302 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-10-03 15:34:45,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,333 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-10-03 15:34:45,363 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-10-03 15:34:45,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:34:45,398 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-10-03 15:34:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 307 proven. 294 refuted. 3 times theorem prover too weak. 71 trivial. 0 not checked. [2022-10-03 15:34:47,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576702249] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 15:34:47,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 15:34:47,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 71, 70] total 148 [2022-10-03 15:34:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492934667] [2022-10-03 15:34:47,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 15:34:47,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-10-03 15:34:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:34:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-10-03 15:34:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=20302, Unknown=115, NotChecked=578, Total=21756 [2022-10-03 15:34:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:34:47,330 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:34:47,332 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-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2022-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 187 states. [2022-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-10-03 15:34:47,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:34:51,097 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-10-03 15:34:51,290 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-10-03 15:34:51,294 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-10-03 15:34:51,300 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-10-03 15:34:51,310 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-10-03 15:37:04,477 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-10-03 15:37:04,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 15:37:04,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-03 15:37:04,678 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-10-03 15:37:04,679 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.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) 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) ... 53 more [2022-10-03 15:37:04,683 INFO L158 Benchmark]: Toolchain (without parser) took 375998.86ms. Allocated memory was 187.7MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 137.1MB in the beginning and 523.9MB in the end (delta: -386.9MB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. [2022-10-03 15:37:04,683 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 187.7MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:37:04,683 INFO L158 Benchmark]: Boogie Preprocessor took 127.24ms. Allocated memory is still 187.7MB. Free memory was 137.1MB in the beginning and 130.7MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:37:04,683 INFO L158 Benchmark]: RCFGBuilder took 1488.71ms. Allocated memory is still 187.7MB. Free memory was 130.6MB in the beginning and 87.9MB in the end (delta: 42.7MB). Peak memory consumption was 43.7MB. Max. memory is 8.0GB. [2022-10-03 15:37:04,684 INFO L158 Benchmark]: TraceAbstraction took 374377.82ms. Allocated memory was 187.7MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 87.4MB in the beginning and 523.9MB in the end (delta: -436.6MB). Peak memory consumption was 389.2MB. Max. memory is 8.0GB. [2022-10-03 15:37:04,685 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.17ms. Allocated memory is still 187.7MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 127.24ms. Allocated memory is still 187.7MB. Free memory was 137.1MB in the beginning and 130.7MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1488.71ms. Allocated memory is still 187.7MB. Free memory was 130.6MB in the beginning and 87.9MB in the end (delta: 42.7MB). Peak memory consumption was 43.7MB. Max. memory is 8.0GB. * TraceAbstraction took 374377.82ms. Allocated memory was 187.7MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 87.4MB in the beginning and 523.9MB in the end (delta: -436.6MB). Peak memory consumption was 389.2MB. 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-10-03 15:37:04,712 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...