java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:28:43,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:28:43,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:28:43,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:28:43,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:28:43,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:28:43,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:28:43,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:28:43,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:28:43,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:28:43,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:28:43,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:28:43,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:28:43,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:28:43,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:28:43,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:28:43,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:28:43,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:28:43,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:28:43,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:28:43,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:28:43,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:28:43,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:28:43,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:28:43,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:28:43,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:28:43,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:28:43,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:28:43,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:28:43,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:28:43,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:28:43,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:28:43,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:28:43,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:28:43,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:28:43,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:28:43,487 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:28:43,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:28:43,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:28:43,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:28:43,516 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:28:43,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:28:43,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:28:43,517 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:28:43,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:28:43,518 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:28:43,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:28:43,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:28:43,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:28:43,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:28:43,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:28:43,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:28:43,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:28:43,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:28:43,520 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:28:43,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:28:43,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:28:43,521 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:28:43,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:28:43,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:43,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:28:43,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:28:43,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:28:43,523 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:28:43,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:28:43,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:28:43,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:28:43,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:28:43,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:28:43,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:28:43,591 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:28:43,591 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:28:43,592 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-10-04 12:28:43,593 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-10-04 12:28:43,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:28:43,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:28:43,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:43,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:28:43,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:28:43,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,678 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:28:43,679 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:28:43,679 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:28:43,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:43,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:28:43,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:28:43,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:28:43,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... [2018-10-04 12:28:43,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:28:43,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:28:43,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:28:43,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:28:43,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:43,779 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:28:43,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:28:43,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:28:43,992 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:28:43,993 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:43 BoogieIcfgContainer [2018-10-04 12:28:43,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:28:43,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:28:43,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:28:43,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:28:43,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:43" (1/2) ... [2018-10-04 12:28:44,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be15e2b and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:28:44, skipping insertion in model container [2018-10-04 12:28:44,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:43" (2/2) ... [2018-10-04 12:28:44,002 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-10-04 12:28:44,013 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:28:44,020 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:28:44,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:28:44,062 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:28:44,063 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:28:44,063 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:28:44,063 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:28:44,063 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:28:44,063 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:28:44,064 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:28:44,064 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:28:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 12:28:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:28:44,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:44,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:28:44,087 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:44,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-10-04 12:28:44,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:44,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:44,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:44,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:44,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:44,254 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 12:28:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:44,301 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:28:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:44,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:28:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:44,314 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:44,314 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:28:44,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:28:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:28:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:28:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:28:44,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:28:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:44,355 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:28:44,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:28:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:28:44,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:44,356 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:28:44,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:44,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-10-04 12:28:44,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:44,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:44,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:44,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:44,640 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:44,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:44,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:44,774 INFO L477 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 [2018-10-04 12:28:44,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:44,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:44,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:28:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:44,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-04 12:28:44,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:28:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:28:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:44,955 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-10-04 12:28:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:45,168 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:28:45,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:28:45,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-10-04 12:28:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:45,169 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:28:45,170 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:28:45,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:28:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:28:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:28:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:28:45,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:28:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:28:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:28:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:28:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:28:45,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:45,175 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 12:28:45,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-10-04 12:28:45,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:45,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:45,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:45,476 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-04 12:28:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:45,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:45,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:45,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:28:45,586 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:45,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:45,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:45,605 INFO L477 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 [2018-10-04 12:28:45,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:45,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:45,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:28:45,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:28:45,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:45,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:45,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:28:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:45,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 12:28:45,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:28:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:28:45,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:28:45,941 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-10-04 12:28:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:46,035 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:28:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:28:46,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-10-04 12:28:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:46,037 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:28:46,037 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:28:46,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:28:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:28:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:28:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:28:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:28:46,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:28:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:46,041 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:28:46,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:28:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:28:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:28:46,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:46,043 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 12:28:46,043 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:46,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-10-04 12:28:46,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:46,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:46,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:46,668 WARN L178 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-10-04 12:28:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:46,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:46,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:46,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:28:46,718 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:28:46,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:46,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:46,740 INFO L477 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 [2018-10-04 12:28:46,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:46,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:46,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:28:46,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:28:46,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:46,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:46,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:28:46,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:28:46,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:46,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:46,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:28:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:47,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:47,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-04 12:28:47,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:28:47,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:28:47,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:28:47,023 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-10-04 12:28:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:47,138 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:28:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:28:47,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-10-04 12:28:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:47,140 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:28:47,141 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:28:47,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:28:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:28:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:28:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:28:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:28:47,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:28:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:47,145 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:28:47,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:28:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:28:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:28:47,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:47,146 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 12:28:47,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:47,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-10-04 12:28:47,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:47,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:47,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:47,645 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-10-04 12:28:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:47,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:47,680 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:47,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:28:47,697 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:28:47,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:47,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:47,819 INFO L477 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 [2018-10-04 12:28:47,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:47,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:47,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:28:47,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:28:47,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:47,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:47,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:28:47,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:28:47,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:47,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:47,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:28:48,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-04 12:28:48,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:48,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:48,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-10-04 12:28:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:48,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:48,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:28:48,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:28:48,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:28:48,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:28:48,162 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-10-04 12:28:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:48,359 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:28:48,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:28:48,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-10-04 12:28:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:48,360 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:48,360 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:28:48,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:28:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:28:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:28:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:28:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:28:48,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:28:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:28:48,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:28:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:28:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:28:48,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:48,367 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 12:28:48,367 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:48,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-10-04 12:28:48,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:48,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:48,971 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-10-04 12:28:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:48,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:48,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:48,999 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:28:49,026 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:28:49,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:49,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:49,055 INFO L477 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 [2018-10-04 12:28:49,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:49,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:49,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:28:49,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:28:49,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:49,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:49,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:28:49,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:28:49,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:49,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:49,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:28:49,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-04 12:28:49,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:49,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:49,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-10-04 12:28:49,465 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-10-04 12:28:49,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-04 12:28:49,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:49,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:49,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-10-04 12:28:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:49,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 12:28:49,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:28:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:28:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:28:49,795 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-10-04 12:28:50,447 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-04 12:28:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:50,462 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:28:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:28:50,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-10-04 12:28:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:50,464 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:28:50,464 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:28:50,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:28:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:28:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:28:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:28:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:28:50,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:28:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:50,469 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:28:50,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:28:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:28:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:28:50,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:50,470 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 12:28:50,470 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:50,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-10-04 12:28:50,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:50,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:50,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:51,166 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2018-10-04 12:28:51,462 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-10-04 12:28:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:51,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:51,481 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:51,495 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:28:51,506 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:28:51,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:51,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:51,522 INFO L477 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 [2018-10-04 12:28:51,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:51,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:51,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:28:51,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:28:51,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:51,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:51,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:28:51,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:28:51,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:51,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:51,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:28:51,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-04 12:28:51,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:51,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:51,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-10-04 12:28:51,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-04 12:28:51,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:51,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:51,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-10-04 12:28:52,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-04 12:28:52,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:28:52,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-04 12:28:52,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-10-04 12:28:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:54,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:54,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-04 12:28:54,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:28:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:28:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:28:54,342 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-10-04 12:28:58,813 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-10-04 12:28:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:58,822 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:28:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:28:58,822 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-10-04 12:28:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:58,822 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:28:58,823 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:28:58,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2018-10-04 12:28:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:28:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:28:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:28:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:28:58,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:28:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:58,828 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:28:58,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:28:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:28:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:28:58,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:58,829 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 12:28:58,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:58,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:58,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-10-04 12:28:58,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:58,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:58,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:58,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:58,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:59,330 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-10-04 12:28:59,537 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2018-10-04 12:28:59,830 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2018-10-04 12:29:00,224 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-10-04 12:29:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:00,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:00,248 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:29:00,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:00,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:00,292 INFO L477 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 [2018-10-04 12:29:00,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:00,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:00,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:29:00,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:29:00,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:00,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:00,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:29:00,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:29:00,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:00,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:00,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:29:00,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-04 12:29:00,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:00,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:00,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-10-04 12:29:00,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-04 12:29:00,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:00,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:00,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-10-04 12:29:00,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-04 12:29:00,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:00,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:00,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-10-04 12:29:03,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-04 12:29:03,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:03,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:03,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-10-04 12:29:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:19,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-04 12:29:19,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:29:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:29:19,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=286, Unknown=4, NotChecked=0, Total=380 [2018-10-04 12:29:19,419 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-10-04 12:29:25,859 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-10-04 12:29:36,440 WARN L178 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-10-04 12:29:56,447 WARN L178 SmtUtils]: Spent 4.91 s on a formula simplification that was a NOOP. DAG size: 48 [2018-10-04 12:29:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:56,470 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:29:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:29:56,470 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-10-04 12:29:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:56,471 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:29:56,471 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:29:56,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=158, Invalid=482, Unknown=10, NotChecked=0, Total=650 [2018-10-04 12:29:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:29:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:29:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:29:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:29:56,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:29:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:56,477 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:29:56,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:29:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:29:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:29:56,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:56,478 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 12:29:56,478 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:56,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-10-04 12:29:56,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:56,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:56,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:56,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:56,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:57,224 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 25 [2018-10-04 12:29:57,525 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 29 [2018-10-04 12:29:57,979 WARN L178 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 44 [2018-10-04 12:29:58,607 WARN L178 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-10-04 12:29:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:58,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:58,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:29:58,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:58,738 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:58,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:58,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:58,777 INFO L477 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 [2018-10-04 12:29:58,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:58,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:58,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:29:58,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:29:58,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:58,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:58,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:29:58,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:29:58,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:58,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:58,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:29:59,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-04 12:29:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:59,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:59,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-10-04 12:29:59,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-04 12:29:59,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:59,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:59,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-10-04 12:29:59,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-04 12:29:59,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:29:59,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-04 12:29:59,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-10-04 12:30:02,355 INFO L303 Elim1Store]: Index analysis took 145 ms [2018-10-04 12:30:02,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-04 12:30:02,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:30:02,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-04 12:30:02,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-10-04 12:30:15,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-10-04 12:30:15,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:30:15,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-10-04 12:30:15,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-10-04 12:30:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:50,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-04 12:30:50,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:30:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:30:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=336, Unknown=16, NotChecked=0, Total=462 [2018-10-04 12:30:50,439 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2018-10-04 12:30:52,325 WARN L178 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-10-04 12:31:10,988 WARN L178 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-10-04 12:31:36,626 WARN L178 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2018-10-04 12:32:27,427 WARN L178 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-10-04 12:32:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:27,453 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:32:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:32:27,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2018-10-04 12:32:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:27,455 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:32:27,455 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:32:27,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 128.1s TimeCoverageRelationStatistics Valid=156, Invalid=518, Unknown=28, NotChecked=0, Total=702 [2018-10-04 12:32:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:32:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:32:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:32:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:32:27,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 12:32:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:27,461 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:32:27,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:32:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:32:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:32:27,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:27,461 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 12:32:27,462 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:27,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-10-04 12:32:27,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:27,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:27,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:28,015 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-10-04 12:32:28,182 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-04 12:32:28,446 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2018-10-04 12:32:28,835 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 34 [2018-10-04 12:32:29,757 WARN L178 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 52 [2018-10-04 12:32:30,317 WARN L178 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 59 [2018-10-04 12:32:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:30,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:30,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:30,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:30,376 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:32:30,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:30,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:30,430 INFO L477 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 [2018-10-04 12:32:30,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:30,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:30,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-10-04 12:32:30,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-04 12:32:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:30,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:30,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-04 12:32:30,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-10-04 12:32:30,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:30,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:30,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-10-04 12:32:30,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-04 12:32:30,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:30,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:30,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-10-04 12:32:30,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-04 12:32:30,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:30,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:30,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-10-04 12:32:31,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-04 12:32:31,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:31,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:31,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-10-04 12:32:34,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-10-04 12:32:34,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:34,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:34,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-10-04 12:32:50,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-10-04 12:32:50,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:32:50,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-10-04 12:32:50,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-10-04 12:33:18,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-10-04 12:33:18,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:18,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-10-04 12:33:18,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:95, output treesize:94 Received shutdown request... [2018-10-04 12:33:34,318 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 12:33:34,519 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:34,519 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:33:34,525 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:33:34,526 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:33:34 BoogieIcfgContainer [2018-10-04 12:33:34,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:33:34,527 INFO L168 Benchmark]: Toolchain (without parser) took 290889.16 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 99.1 MB). Free memory was 1.5 GB in the beginning and 962.3 MB in the end (delta: 510.7 MB). Peak memory consumption was 609.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:34,529 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:33:34,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:33:34,530 INFO L168 Benchmark]: Boogie Preprocessor took 21.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:33:34,530 INFO L168 Benchmark]: RCFGBuilder took 289.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:34,530 INFO L168 Benchmark]: TraceAbstraction took 290530.83 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 99.1 MB). Free memory was 1.5 GB in the beginning and 962.3 MB in the end (delta: 489.6 MB). Peak memory consumption was 588.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:34,540 INFO L336 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 289.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 290530.83 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 99.1 MB). Free memory was 1.5 GB in the beginning and 962.3 MB in the end (delta: 489.6 MB). Peak memory consumption was 588.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 13 with TraceHistMax 9, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 290.4s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 139.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 12 SDslu, 27 SDs, 0 SdLazy, 383 SolverSat, 32 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 31.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 185.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 82.6s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 106 ConstructedInterpolants, 43 QuantifiedInterpolants, 26107 SizeOfPredicates, 16 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 0/240 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArrayInit01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-33-34-562.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArrayInit01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-33-34-562.csv Completed graceful shutdown