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-d19836b [2018-09-26 21:27:01,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:27:01,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:27:01,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:27:01,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:27:01,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:27:01,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:27:01,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:27:01,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:27:01,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:27:01,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:27:01,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:27:01,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:27:01,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:27:01,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:27:01,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:27:01,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:27:01,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:27:01,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:27:01,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:27:01,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:27:01,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:27:01,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:27:01,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:27:01,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:27:01,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:27:01,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:27:01,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:27:01,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:27:01,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:27:01,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:27:01,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:27:01,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:27:01,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:27:01,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:27:01,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:27:01,366 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-26 21:27:01,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:27:01,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:27:01,392 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:27:01,392 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:27:01,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:27:01,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:27:01,396 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:27:01,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:27:01,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:27:01,397 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:27:01,397 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:27:01,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:27:01,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:27:01,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:27:01,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:27:01,398 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:27:01,398 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:27:01,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:27:01,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:27:01,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:27:01,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:27:01,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:27:01,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:27:01,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:27:01,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:27:01,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:27:01,401 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:27:01,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:27:01,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:27:01,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:27:01,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:27:01,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:27:01,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:27:01,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:27:01,484 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:27:01,485 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-26 21:27:01,485 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-09-26 21:27:01,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:27:01,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:27:01,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:27:01,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:27:01,547 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:27:01,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,591 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:27:01,592 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:27:01,592 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:27:01,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:27:01,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:27:01,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:27:01,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:27:01,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/1) ... [2018-09-26 21:27:01,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:27:01,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:27:01,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:27:01,623 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:27:01,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (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-26 21:27:01,696 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 21:27:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 21:27:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 21:27:01,879 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:27:01,880 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:27:01 BoogieIcfgContainer [2018-09-26 21:27:01,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:27:01,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:27:01,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:27:01,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:27:01,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:27:01" (1/2) ... [2018-09-26 21:27:01,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339568ad and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:27:01, skipping insertion in model container [2018-09-26 21:27:01,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:27:01" (2/2) ... [2018-09-26 21:27:01,889 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-09-26 21:27:01,899 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:27:01,906 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:27:01,957 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:27:01,958 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:27:01,958 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:27:01,958 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:27:01,958 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:27:01,959 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:27:01,959 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:27:01,959 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:27:01,959 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:27:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 21:27:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 21:27:01,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:01,981 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 21:27:01,982 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:01,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-09-26 21:27:01,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:02,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:27:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:02,133 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-26 21:27:02,135 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:27:02,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:27:02,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:27:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:27:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:27:02,153 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 21:27:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:02,205 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 21:27:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:27:02,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 21:27:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:02,218 INFO L225 Difference]: With dead ends: 11 [2018-09-26 21:27:02,218 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 21:27:02,223 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-26 21:27:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 21:27:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 21:27:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 21:27:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 21:27:02,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 21:27:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:02,259 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 21:27:02,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:27:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 21:27:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:27:02,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:02,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:27:02,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:02,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:02,261 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-09-26 21:27:02,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:02,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:02,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:27:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:02,623 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-26 21:27:02,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:02,624 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-26 21:27:02,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:27:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:02,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:02,780 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-26 21:27:02,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:02,794 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-26 21:27:02,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:02,913 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-26 21:27:02,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:02,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-09-26 21:27:02,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:27:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:27:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:27:02,947 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-09-26 21:27:03,145 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-09-26 21:27:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:03,221 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 21:27:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:27:03,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-09-26 21:27:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:03,222 INFO L225 Difference]: With dead ends: 8 [2018-09-26 21:27:03,223 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 21:27:03,224 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-26 21:27:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 21:27:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 21:27:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 21:27:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 21:27:03,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 21:27:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:03,227 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 21:27:03,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:27:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 21:27:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:27:03,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:03,228 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 21:27:03,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:03,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-09-26 21:27:03,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:03,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:27:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:03,494 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-26 21:27:03,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:03,495 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-26 21:27:03,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:27:03,514 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:27:03,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:27:03,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:03,535 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-26 21:27:03,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:03,551 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-26 21:27:03,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:03,614 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-26 21:27:03,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:03,723 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-26 21:27:03,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:27:03,833 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-26 21:27:03,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:03,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-26 21:27:03,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:27:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:27:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:27:03,859 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-09-26 21:27:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:03,975 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 21:27:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:27:03,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-09-26 21:27:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:03,976 INFO L225 Difference]: With dead ends: 9 [2018-09-26 21:27:03,977 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 21:27:03,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:27:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 21:27:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 21:27:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 21:27:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 21:27:03,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 21:27:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:03,981 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 21:27:03,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:27:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 21:27:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 21:27:03,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:03,983 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 21:27:03,983 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:03,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-09-26 21:27:03,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:03,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:03,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:27:03,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:04,621 WARN L178 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-09-26 21:27:04,677 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-26 21:27:04,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:04,678 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-26 21:27:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:27:04,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-26 21:27:04,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:27:04,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:04,714 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-26 21:27:04,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:04,724 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-26 21:27:04,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:04,754 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-26 21:27:04,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:04,770 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-26 21:27:04,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:27:04,883 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-26 21:27:04,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:04,903 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-26 21:27:04,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:27:04,972 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-26 21:27:04,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:04,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-26 21:27:04,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:27:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:27:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:27:04,994 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-09-26 21:27:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:05,108 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 21:27:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:27:05,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-09-26 21:27:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:05,109 INFO L225 Difference]: With dead ends: 10 [2018-09-26 21:27:05,109 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 21:27:05,110 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-26 21:27:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 21:27:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 21:27:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 21:27:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 21:27:05,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 21:27:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:05,113 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 21:27:05,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:27:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 21:27:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:27:05,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:05,114 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 21:27:05,115 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:05,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-09-26 21:27:05,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:05,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:05,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:05,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:27:05,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:05,442 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-09-26 21:27:05,623 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-09-26 21:27:05,659 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-26 21:27:05,659 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:05,659 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-26 21:27:05,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:27:05,675 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:27:05,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:27:05,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:05,787 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-26 21:27:05,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:05,829 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-26 21:27:05,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:05,864 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-26 21:27:05,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:05,879 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-26 21:27:05,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:27:05,913 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-26 21:27:05,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:05,936 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-26 21:27:05,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:27:05,990 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-26 21:27:05,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:06,032 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-26 21:27:06,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-26 21:27:06,195 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-26 21:27:06,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:06,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:27:06,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:27:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:27:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:27:06,217 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-09-26 21:27:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:06,469 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 21:27:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:27:06,469 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-09-26 21:27:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:06,469 INFO L225 Difference]: With dead ends: 11 [2018-09-26 21:27:06,470 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 21:27:06,470 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-26 21:27:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 21:27:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 21:27:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:27:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 21:27:06,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 21:27:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:06,474 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 21:27:06,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:27:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 21:27:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:27:06,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:06,475 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 21:27:06,475 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:06,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-09-26 21:27:06,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:06,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:27:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:07,117 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-09-26 21:27:07,137 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-26 21:27:07,138 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:07,138 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-26 21:27:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:27:07,156 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-26 21:27:07,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:27:07,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:07,171 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-26 21:27:07,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:07,179 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-26 21:27:07,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:07,204 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-26 21:27:07,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:07,244 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-26 21:27:07,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:27:07,278 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-26 21:27:07,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:07,295 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-26 21:27:07,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:27:07,356 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-26 21:27:07,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:07,376 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-26 21:27:07,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-26 21:27:07,473 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-26 21:27:07,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:07,501 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-26 21:27:07,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-26 21:27:07,852 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-26 21:27:07,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:07,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:27:07,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:27:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:27:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:27:07,876 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-09-26 21:27:08,539 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-09-26 21:27:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:08,554 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 21:27:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:27:08,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-09-26 21:27:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:08,556 INFO L225 Difference]: With dead ends: 12 [2018-09-26 21:27:08,556 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 21:27:08,557 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-26 21:27:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 21:27:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 21:27:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 21:27:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 21:27:08,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 21:27:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:08,561 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 21:27:08,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:27:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 21:27:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:27:08,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:08,562 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 21:27:08,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:08,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-09-26 21:27:08,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:08,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:08,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:27:08,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:09,181 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2018-09-26 21:27:09,488 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-09-26 21:27:09,509 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-26 21:27:09,510 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:09,510 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-26 21:27:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:27:09,536 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-26 21:27:09,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:27:09,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:09,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-26 21:27:09,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:09,583 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-26 21:27:09,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:09,765 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-26 21:27:09,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:09,794 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-26 21:27:09,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:27:09,823 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-26 21:27:09,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:09,840 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-26 21:27:09,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:27:09,961 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-26 21:27:09,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:09,987 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-26 21:27:09,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-26 21:27:10,074 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-26 21:27:10,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:10,102 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-26 21:27:10,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-26 21:27:10,329 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-26 21:27:10,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:10,363 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-26 21:27:10,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-26 21:27:12,489 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-26 21:27:12,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:12,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-26 21:27:12,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:27:12,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:27:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:27:12,510 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-09-26 21:27:16,966 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-09-26 21:27:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:27:17,021 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 21:27:17,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:27:17,021 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-09-26 21:27:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:27:17,021 INFO L225 Difference]: With dead ends: 13 [2018-09-26 21:27:17,022 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 21:27:17,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2018-09-26 21:27:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 21:27:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 21:27:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 21:27:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 21:27:17,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 21:27:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:27:17,028 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 21:27:17,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:27:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 21:27:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:27:17,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:27:17,029 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 21:27:17,029 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:27:17,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:27:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-09-26 21:27:17,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:27:17,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:27:17,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:17,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:27:17,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:27:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:17,534 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-09-26 21:27:17,963 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2018-09-26 21:27:18,255 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2018-09-26 21:27:18,541 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-09-26 21:27:18,566 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-26 21:27:18,567 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:27:18,567 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-26 21:27:18,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:27:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:27:18,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:27:18,607 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-26 21:27:18,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:18,612 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-26 21:27:18,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:27:18,648 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-26 21:27:18,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:18,660 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-26 21:27:18,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:27:18,768 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-26 21:27:18,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:18,826 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-26 21:27:18,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:27:18,865 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-26 21:27:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:18,885 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-26 21:27:18,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-26 21:27:18,957 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-26 21:27:18,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:18,982 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-26 21:27:18,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-26 21:27:19,240 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-26 21:27:19,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:19,272 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-26 21:27:19,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-26 21:27:21,925 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-26 21:27:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:27:21,975 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-26 21:27:21,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-26 21:27:37,497 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-26 21:27:37,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:27:37,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-26 21:27:37,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:27:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:27:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=286, Unknown=4, NotChecked=0, Total=380 [2018-09-26 21:27:37,519 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-09-26 21:27:43,902 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-09-26 21:27:54,543 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-09-26 21:28:14,747 WARN L178 SmtUtils]: Spent 4.90 s on a formula simplification that was a NOOP. DAG size: 48 [2018-09-26 21:28:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:28:14,772 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 21:28:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:28:14,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-09-26 21:28:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:28:14,773 INFO L225 Difference]: With dead ends: 14 [2018-09-26 21:28:14,773 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 21:28:14,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=158, Invalid=482, Unknown=10, NotChecked=0, Total=650 [2018-09-26 21:28:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 21:28:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 21:28:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 21:28:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 21:28:14,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 21:28:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:28:14,779 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 21:28:14,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:28:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 21:28:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:28:14,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:28:14,780 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 21:28:14,780 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:28:14,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:28:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-09-26 21:28:14,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:28:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:28:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:28:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:28:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:28:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:28:15,546 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 25 [2018-09-26 21:28:15,817 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 29 [2018-09-26 21:28:16,269 WARN L178 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 44 [2018-09-26 21:28:16,934 WARN L178 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-09-26 21:28:17,157 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-26 21:28:17,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:28:17,158 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-26 21:28:17,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:28:17,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:28:17,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:28:17,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:28:17,256 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-26 21:28:17,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:17,263 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-26 21:28:17,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:28:17,289 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-26 21:28:17,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:17,307 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-26 21:28:17,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:28:17,344 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-26 21:28:17,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:17,356 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-26 21:28:17,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:28:17,399 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-26 21:28:17,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:17,418 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-26 21:28:17,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-26 21:28:17,643 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-26 21:28:17,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:17,669 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-26 21:28:17,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-26 21:28:17,941 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-26 21:28:17,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:17,978 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-26 21:28:17,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-26 21:28:20,958 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-26 21:28:20,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:21,000 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-26 21:28:21,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-26 21:28:34,516 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-26 21:28:34,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:28:34,563 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-26 21:28:34,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-26 21:29:08,817 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-26 21:29:08,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:29:08,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-26 21:29:08,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:29:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:29:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=336, Unknown=16, NotChecked=0, Total=462 [2018-09-26 21:29:08,839 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2018-09-26 21:29:10,714 WARN L178 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-09-26 21:29:28,745 WARN L178 SmtUtils]: Spent 12.12 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-09-26 21:29:54,521 WARN L178 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2018-09-26 21:30:46,067 WARN L178 SmtUtils]: Spent 12.22 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-09-26 21:30:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:30:46,103 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 21:30:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:30:46,103 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2018-09-26 21:30:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:30:46,104 INFO L225 Difference]: With dead ends: 15 [2018-09-26 21:30:46,104 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 21:30:46,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 129.0s TimeCoverageRelationStatistics Valid=156, Invalid=518, Unknown=28, NotChecked=0, Total=702 [2018-09-26 21:30:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 21:30:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 21:30:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 21:30:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 21:30:46,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 21:30:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:30:46,109 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 21:30:46,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:30:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 21:30:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:30:46,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:30:46,110 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 21:30:46,110 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:30:46,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:30:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-09-26 21:30:46,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:30:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:30:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:30:46,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:30:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:30:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:30:46,614 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-09-26 21:30:46,936 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-09-26 21:30:47,176 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2018-09-26 21:30:47,562 WARN L178 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 34 [2018-09-26 21:30:48,436 WARN L178 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 52 [2018-09-26 21:30:49,030 WARN L178 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 59 [2018-09-26 21:30:49,142 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-26 21:30:49,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:30:49,143 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-26 21:30:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:30:49,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-26 21:30:49,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:30:49,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:30:49,251 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-26 21:30:49,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:49,298 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-26 21:30:49,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-26 21:30:49,323 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-26 21:30:49,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:49,335 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-26 21:30:49,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-26 21:30:49,390 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-26 21:30:49,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:49,409 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-26 21:30:49,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-26 21:30:49,516 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-26 21:30:49,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:49,599 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-26 21:30:49,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-26 21:30:49,751 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-26 21:30:49,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:49,776 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-26 21:30:49,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-26 21:30:50,206 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-26 21:30:50,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:50,242 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-26 21:30:50,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-26 21:30:52,908 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-26 21:30:52,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:30:52,943 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-26 21:30:52,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-26 21:31:09,222 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-26 21:31:09,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:09,265 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-26 21:31:09,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-26 21:31:37,150 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-26 21:31:37,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:31:37,201 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-26 21:31:37,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:95, output treesize:94 Received shutdown request... [2018-09-26 21:31:50,299 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-26 21:31:50,500 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:31:50,501 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:31:50,506 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:31:50,506 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:31:50 BoogieIcfgContainer [2018-09-26 21:31:50,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:31:50,507 INFO L168 Benchmark]: Toolchain (without parser) took 288964.47 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 129.5 MB). Free memory was 1.4 GB in the beginning and 968.1 MB in the end (delta: 481.8 MB). Peak memory consumption was 611.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:31:50,508 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-26 21:31:50,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 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-26 21:31:50,509 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 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-26 21:31:50,509 INFO L168 Benchmark]: RCFGBuilder took 258.48 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-26 21:31:50,510 INFO L168 Benchmark]: TraceAbstraction took 288624.91 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 129.5 MB). Free memory was 1.4 GB in the beginning and 968.1 MB in the end (delta: 460.7 MB). Peak memory consumption was 590.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:31:50,515 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.19 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 48.16 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 26.88 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 258.48 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 288624.91 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 129.5 MB). Free memory was 1.4 GB in the beginning and 968.1 MB in the end (delta: 460.7 MB). Peak memory consumption was 590.2 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, 288.5s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 140.5s 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 186.6s 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.7s 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-26_21-31-50-525.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-26_21-31-50-525.csv Completed graceful shutdown