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-1cc990c [2018-09-30 20:20:57,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:20:57,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:20:57,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:20:57,261 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:20:57,262 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:20:57,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:20:57,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:20:57,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:20:57,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:20:57,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:20:57,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:20:57,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:20:57,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:20:57,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:20:57,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:20:57,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:20:57,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:20:57,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:20:57,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:20:57,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:20:57,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:20:57,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:20:57,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:20:57,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:20:57,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:20:57,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:20:57,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:20:57,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:20:57,288 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:20:57,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:20:57,289 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:20:57,289 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:20:57,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:20:57,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:20:57,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:20:57,291 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-09-30 20:20:57,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:20:57,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:20:57,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:20:57,316 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:20:57,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:20:57,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:20:57,317 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:20:57,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:20:57,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:20:57,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:20:57,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:20:57,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:20:57,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:20:57,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:20:57,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:20:57,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:20:57,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:20:57,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:20:57,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:20:57,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:20:57,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:20:57,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:20:57,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:20:57,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:20:57,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:20:57,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:20:57,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:20:57,321 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:20:57,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:20:57,322 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:20:57,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:20:57,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:20:57,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:20:57,381 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:20:57,382 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:20:57,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-09-30 20:20:57,383 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-09-30 20:20:57,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:20:57,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:20:57,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:20:57,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:20:57,433 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:20:57,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,471 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:20:57,472 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:20:57,472 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:20:57,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:20:57,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:20:57,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:20:57,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:20:57,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/1) ... [2018-09-30 20:20:57,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:20:57,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:20:57,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:20:57,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:20:57,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (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-09-30 20:20:57,570 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-30 20:20:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 20:20:57,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 20:20:57,739 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:20:57,739 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:20:57 BoogieIcfgContainer [2018-09-30 20:20:57,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:20:57,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:20:57,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:20:57,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:20:57,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:20:57" (1/2) ... [2018-09-30 20:20:57,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc02456 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:20:57, skipping insertion in model container [2018-09-30 20:20:57,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:20:57" (2/2) ... [2018-09-30 20:20:57,747 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-09-30 20:20:57,757 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:20:57,764 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:20:57,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:20:57,812 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:20:57,812 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:20:57,812 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:20:57,812 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:20:57,812 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:20:57,813 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:20:57,813 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:20:57,813 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:20:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-30 20:20:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 20:20:57,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:57,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 20:20:57,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:57,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-09-30 20:20:57,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:57,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:57,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:20:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:57,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:58,001 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-30 20:20:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:58,031 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 20:20:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:58,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-30 20:20:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:58,044 INFO L225 Difference]: With dead ends: 11 [2018-09-30 20:20:58,044 INFO L226 Difference]: Without dead ends: 5 [2018-09-30 20:20:58,049 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-09-30 20:20:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-30 20:20:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-30 20:20:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-30 20:20:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 20:20:58,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-30 20:20:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:58,090 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-30 20:20:58,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 20:20:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:20:58,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:58,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:20:58,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:58,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-09-30 20:20:58,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:58,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:58,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:58,392 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:20:58,392 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-09-30 20:20:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:58,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:20:58,593 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-09-30 20:20:58,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:20:58,706 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-09-30 20:20:58,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:20:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:58,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:20:58,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-09-30 20:20:58,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:20:58,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:20:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:20:58,871 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-09-30 20:20:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:59,117 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-30 20:20:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:20:59,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-09-30 20:20:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:59,120 INFO L225 Difference]: With dead ends: 8 [2018-09-30 20:20:59,121 INFO L226 Difference]: Without dead ends: 6 [2018-09-30 20:20:59,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:20:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-30 20:20:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-30 20:20:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 20:20:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 20:20:59,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-30 20:20:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:59,125 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 20:20:59,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:20:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 20:20:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:20:59,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:59,126 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-30 20:20:59,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:59,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-09-30 20:20:59,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:59,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:59,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:59,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:59,479 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2018-09-30 20:20:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:59,481 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:20:59,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 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-09-30 20:20:59,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:20:59,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:20:59,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:20:59,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:20:59,543 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-09-30 20:20:59,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:20:59,558 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-09-30 20:20:59,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:20:59,617 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-09-30 20:20:59,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:20:59,637 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-09-30 20:20:59,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:20:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:59,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:20:59,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 20:20:59,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:20:59,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:20:59,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:20:59,898 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-09-30 20:21:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:21:00,037 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 20:21:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:21:00,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-09-30 20:21:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:21:00,038 INFO L225 Difference]: With dead ends: 9 [2018-09-30 20:21:00,039 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 20:21:00,039 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-09-30 20:21:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 20:21:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 20:21:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 20:21:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 20:21:00,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-30 20:21:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:21:00,043 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 20:21:00,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:21:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 20:21:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 20:21:00,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:21:00,044 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-30 20:21:00,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:21:00,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:21:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-09-30 20:21:00,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:21:00,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:21:00,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:00,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:21:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:21:00,671 WARN L178 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-09-30 20:21:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:00,719 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:21:00,719 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-09-30 20:21:00,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:21:00,735 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 20:21:00,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:21:00,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:21:00,757 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-09-30 20:21:00,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:00,767 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-09-30 20:21:00,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:21:00,814 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-09-30 20:21:00,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:00,829 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-09-30 20:21:00,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:21:00,937 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-09-30 20:21:00,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:00,958 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-09-30 20:21:00,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:21:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:01,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:21:01,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 20:21:01,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:21:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:21:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:21:01,050 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-09-30 20:21:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:21:01,165 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 20:21:01,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:21:01,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-09-30 20:21:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:21:01,166 INFO L225 Difference]: With dead ends: 10 [2018-09-30 20:21:01,166 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 20:21:01,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:21:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 20:21:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 20:21:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 20:21:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 20:21:01,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-30 20:21:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:21:01,170 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 20:21:01,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:21:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 20:21:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:21:01,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:21:01,171 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-30 20:21:01,171 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:21:01,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:21:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-09-30 20:21:01,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:21:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:21:01,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:01,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:21:01,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:21:01,682 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-09-30 20:21:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:01,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:21:01,718 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-09-30 20:21:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:21:01,734 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:21:01,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:21:01,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:21:01,849 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-09-30 20:21:01,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:01,900 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-09-30 20:21:01,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:21:01,921 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-09-30 20:21:01,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:01,933 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-09-30 20:21:01,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:21:01,965 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-09-30 20:21:01,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:01,982 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-09-30 20:21:01,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:21:02,035 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-09-30 20:21:02,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:02,063 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-09-30 20:21:02,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 20:21:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:02,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:21:02,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:21:02,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:21:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:21:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:21:02,223 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-09-30 20:21:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:21:02,420 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 20:21:02,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:21:02,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-09-30 20:21:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:21:02,422 INFO L225 Difference]: With dead ends: 11 [2018-09-30 20:21:02,422 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 20:21:02,423 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-09-30 20:21:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 20:21:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 20:21:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 20:21:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 20:21:02,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-30 20:21:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:21:02,427 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 20:21:02,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:21:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 20:21:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:21:02,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:21:02,428 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-30 20:21:02,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:21:02,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:21:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-09-30 20:21:02,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:21:02,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:21:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:02,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:21:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:21:02,898 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2018-09-30 20:21:03,104 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-09-30 20:21:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:03,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:21:03,126 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-09-30 20:21:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:21:03,145 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 20:21:03,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:21:03,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:21:03,160 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-09-30 20:21:03,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:03,167 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-09-30 20:21:03,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:21:03,197 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-09-30 20:21:03,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:03,209 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-09-30 20:21:03,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:21:03,245 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-09-30 20:21:03,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:03,268 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-09-30 20:21:03,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:21:03,333 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-09-30 20:21:03,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:03,369 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-09-30 20:21:03,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 20:21:03,448 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-09-30 20:21:03,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:03,666 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-09-30 20:21:03,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 20:21:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:03,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:21:03,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:21:03,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:21:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:21:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:21:03,965 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-09-30 20:21:04,431 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-09-30 20:21:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:21:04,445 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 20:21:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:21:04,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-09-30 20:21:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:21:04,448 INFO L225 Difference]: With dead ends: 12 [2018-09-30 20:21:04,448 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 20:21:04,449 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-09-30 20:21:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 20:21:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-30 20:21:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 20:21:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 20:21:04,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-30 20:21:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:21:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 20:21:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:21:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 20:21:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:21:04,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:21:04,454 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-30 20:21:04,454 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:21:04,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:21:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-09-30 20:21:04,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:21:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:21:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:04,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:21:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:21:05,129 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2018-09-30 20:21:05,418 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-09-30 20:21:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:05,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:21:05,446 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-09-30 20:21:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:21:05,466 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-30 20:21:05,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:21:05,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:21:05,482 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-09-30 20:21:05,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:05,490 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-09-30 20:21:05,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:21:05,541 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-09-30 20:21:05,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:05,572 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-09-30 20:21:05,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:21:05,772 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-09-30 20:21:05,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:05,789 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-09-30 20:21:05,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:21:05,861 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-09-30 20:21:05,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:05,882 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-09-30 20:21:05,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 20:21:06,028 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-09-30 20:21:06,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:06,055 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-09-30 20:21:06,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 20:21:06,258 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-09-30 20:21:06,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:06,291 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-09-30 20:21:06,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 20:21:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:08,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:21:08,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 20:21:08,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:21:08,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:21:08,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:21:08,442 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-09-30 20:21:12,899 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-09-30 20:21:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:21:12,908 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 20:21:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:21:12,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-09-30 20:21:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:21:12,910 INFO L225 Difference]: With dead ends: 13 [2018-09-30 20:21:12,910 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:21:12,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2018-09-30 20:21:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:21:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 20:21:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 20:21:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 20:21:12,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-30 20:21:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:21:12,916 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 20:21:12,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:21:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 20:21:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:21:12,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:21:12,917 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-30 20:21:12,917 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:21:12,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:21:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-09-30 20:21:12,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:21:12,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:21:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:12,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:21:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:21:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:21:13,436 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-09-30 20:21:13,632 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2018-09-30 20:21:13,925 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2018-09-30 20:21:14,324 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-09-30 20:21:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:14,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:21:14,349 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-09-30 20:21:14,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:21:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:21:14,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:21:14,386 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-09-30 20:21:14,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:14,398 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-09-30 20:21:14,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:21:14,424 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-09-30 20:21:14,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:14,433 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-09-30 20:21:14,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:21:14,543 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-09-30 20:21:14,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:14,587 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-09-30 20:21:14,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:21:14,627 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-09-30 20:21:14,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:14,647 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-09-30 20:21:14,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 20:21:14,725 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-09-30 20:21:14,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:14,750 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-09-30 20:21:14,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 20:21:15,007 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-09-30 20:21:15,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:15,037 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-09-30 20:21:15,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 20:21:17,656 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-09-30 20:21:17,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:21:17,693 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-09-30 20:21:17,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 20:21:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:21:33,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:21:33,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 20:21:33,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:21:33,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:21:33,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=286, Unknown=4, NotChecked=0, Total=380 [2018-09-30 20:21:33,133 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-09-30 20:21:39,573 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-09-30 20:21:50,271 WARN L178 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-09-30 20:22:10,457 WARN L178 SmtUtils]: Spent 4.93 s on a formula simplification that was a NOOP. DAG size: 48 [2018-09-30 20:22:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:22:10,481 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 20:22:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:22:10,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-09-30 20:22:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:22:10,482 INFO L225 Difference]: With dead ends: 14 [2018-09-30 20:22:10,482 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 20:22:10,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=158, Invalid=482, Unknown=10, NotChecked=0, Total=650 [2018-09-30 20:22:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 20:22:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 20:22:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 20:22:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 20:22:10,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-30 20:22:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:22:10,488 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 20:22:10,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:22:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 20:22:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:22:10,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:22:10,489 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-30 20:22:10,489 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:22:10,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:22:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-09-30 20:22:10,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:22:10,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:22:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:22:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:22:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:22:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:22:11,406 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 25 [2018-09-30 20:22:11,669 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 29 [2018-09-30 20:22:12,120 WARN L178 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 44 [2018-09-30 20:22:12,723 WARN L178 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-09-30 20:22:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:22:12,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:22:12,827 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-09-30 20:22:12,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:22:12,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:22:12,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:22:12,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:22:12,915 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-09-30 20:22:12,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:12,923 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-09-30 20:22:12,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:22:12,948 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-09-30 20:22:12,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:12,964 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-09-30 20:22:12,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:22:12,996 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-09-30 20:22:12,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:13,009 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-09-30 20:22:13,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:22:13,054 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-09-30 20:22:13,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:13,074 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-09-30 20:22:13,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 20:22:13,157 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-09-30 20:22:13,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:13,183 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-09-30 20:22:13,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 20:22:13,428 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-09-30 20:22:13,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:13,461 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-09-30 20:22:13,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 20:22:16,394 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-09-30 20:22:16,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:16,433 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-09-30 20:22:16,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 20:22:29,819 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-09-30 20:22:29,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:22:29,862 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-09-30 20:22:29,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-30 20:23:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:23:03,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:23:03,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 20:23:03,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:23:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:23:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=336, Unknown=16, NotChecked=0, Total=462 [2018-09-30 20:23:03,826 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2018-09-30 20:23:05,664 WARN L178 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-09-30 20:23:23,691 WARN L178 SmtUtils]: Spent 11.96 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-09-30 20:23:49,354 WARN L178 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2018-09-30 20:24:40,518 WARN L178 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-09-30 20:24:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:24:40,543 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 20:24:40,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:24:40,545 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2018-09-30 20:24:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:24:40,545 INFO L225 Difference]: With dead ends: 15 [2018-09-30 20:24:40,546 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 20:24:40,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 127.7s TimeCoverageRelationStatistics Valid=156, Invalid=518, Unknown=28, NotChecked=0, Total=702 [2018-09-30 20:24:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 20:24:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 20:24:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 20:24:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 20:24:40,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-30 20:24:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:24:40,551 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 20:24:40,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:24:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 20:24:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:24:40,552 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:24:40,552 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-30 20:24:40,552 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:24:40,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:24:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-09-30 20:24:40,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:24:40,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:24:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:24:40,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:24:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:24:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:24:41,051 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-09-30 20:24:41,222 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-09-30 20:24:41,479 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2018-09-30 20:24:41,864 WARN L178 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 34 [2018-09-30 20:24:42,762 WARN L178 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 52 [2018-09-30 20:24:43,421 WARN L178 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 59 [2018-09-30 20:24:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:24:43,454 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:24:43,454 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-09-30 20:24:43,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:24:43,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 20:24:43,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:24:43,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:24:43,550 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-09-30 20:24:43,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:43,555 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-09-30 20:24:43,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-30 20:24:43,579 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-09-30 20:24:43,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:43,593 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-09-30 20:24:43,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-30 20:24:43,644 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-09-30 20:24:43,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:43,658 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-09-30 20:24:43,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-30 20:24:43,708 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-09-30 20:24:43,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:43,772 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-09-30 20:24:43,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-30 20:24:43,877 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-09-30 20:24:43,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:43,932 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-09-30 20:24:43,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-30 20:24:44,325 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-09-30 20:24:44,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:44,397 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-09-30 20:24:44,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-30 20:24:47,093 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-09-30 20:24:47,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:24:47,130 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-09-30 20:24:47,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-30 20:25:03,460 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-09-30 20:25:03,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:03,513 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-09-30 20:25:03,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-30 20:25:31,314 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-09-30 20:25:31,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:25:31,368 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-09-30 20:25:31,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:95, output treesize:94 Received shutdown request... [2018-09-30 20:25:47,443 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-30 20:25:47,644 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:25:47,644 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:25:47,649 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:25:47,650 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:25:47 BoogieIcfgContainer [2018-09-30 20:25:47,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:25:47,650 INFO L168 Benchmark]: Toolchain (without parser) took 290221.11 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 160.4 MB). Free memory was 1.4 GB in the beginning and 992.8 MB in the end (delta: 435.7 MB). Peak memory consumption was 596.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:25:47,651 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:25:47,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:25:47,652 INFO L168 Benchmark]: Boogie Preprocessor took 21.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:25:47,652 INFO L168 Benchmark]: RCFGBuilder took 242.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:25:47,653 INFO L168 Benchmark]: TraceAbstraction took 289909.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 160.4 MB). Free memory was 1.4 GB in the beginning and 992.8 MB in the end (delta: 414.5 MB). Peak memory consumption was 574.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:25:47,655 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 242.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 289909.22 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 160.4 MB). Free memory was 1.4 GB in the beginning and 992.8 MB in the end (delta: 414.5 MB). Peak memory consumption was 574.9 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, 289.8s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 139.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 12 SDslu, 27 SDs, 0 SdLazy, 383 SolverSat, 32 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 30.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 185.5s 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.2s SatisfiabilityAnalysisTime, 82.1s 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-09-30_20-25-47-668.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-09-30_20-25-47-668.csv Completed graceful shutdown