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/20170304-DifficultPathPrograms/linear_search.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:26:01,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:26:01,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:26:01,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:26:01,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:26:01,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:26:01,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:26:01,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:26:01,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:26:01,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:26:01,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:26:01,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:26:01,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:26:01,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:26:01,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:26:01,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:26:01,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:26:01,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:26:01,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:26:01,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:26:01,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:26:01,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:26:01,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:26:01,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:26:01,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:26:01,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:26:01,677 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:26:01,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:26:01,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:26:01,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:26:01,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:26:01,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:26:01,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:26:01,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:26:01,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:26:01,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:26:01,683 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:26:01,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:26:01,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:26:01,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:26:01,711 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:26:01,714 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:26:01,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:26:01,715 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:26:01,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:26:01,716 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:26:01,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:26:01,716 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:26:01,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:26:01,716 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:26:01,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:26:01,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:26:01,717 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:26:01,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:26:01,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:26:01,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:26:01,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:26:01,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:26:01,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:26:01,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:26:01,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:26:01,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:26:01,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:26:01,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:26:01,720 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:26:01,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:26:01,721 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:26:01,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:26:01,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:26:01,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:26:01,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:26:01,790 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:26:01,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl [2018-10-04 12:26:01,791 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl' [2018-10-04 12:26:01,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:26:01,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:26:01,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:26:01,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:26:01,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:26:01,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:26:01,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:26:01,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:26:01,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:26:01,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/1) ... [2018-10-04 12:26:01,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:26:01,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:26:01,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:26:01,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:26:01,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26: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-10-04 12:26:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:26:02,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:26:02,339 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:26:02,340 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:26:02 BoogieIcfgContainer [2018-10-04 12:26:02,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:26:02,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:26:02,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:26:02,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:26:02,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:01" (1/2) ... [2018-10-04 12:26:02,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d48d and model type linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:26:02, skipping insertion in model container [2018-10-04 12:26:02,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:26:02" (2/2) ... [2018-10-04 12:26:02,348 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.i_5.bpl [2018-10-04 12:26:02,358 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:26:02,366 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:26:02,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:26:02,419 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:26:02,419 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:26:02,419 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:26:02,419 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:26:02,420 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:26:02,422 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:26:02,422 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:26:02,423 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:26:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:26:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:26:02,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:02,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:26:02,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:02,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:26:02,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:02,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:02,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:02,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:02,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:02,957 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-04 12:26:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:03,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:03,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:26:03,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:26:03,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:26:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:26:03,075 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2018-10-04 12:26:03,262 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-10-04 12:26:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:03,327 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:26:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:03,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 12:26:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:03,341 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:26:03,341 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:26:03,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:26:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:26:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:26:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:26:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:26:03,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 12:26:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:03,382 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:26:03,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:26:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:26:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:26:03,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:03,383 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 12:26:03,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:03,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 12:26:03,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:03,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:03,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:03,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:03,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:03,666 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-04 12:26:03,913 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 18 [2018-10-04 12:26:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:04,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:04,011 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:26:04,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:04,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:04,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-10-04 12:26:04,165 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 16 treesize of output 15 [2018-10-04 12:26:04,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-10-04 12:26:04,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 16 treesize of output 15 [2018-10-04 12:26:04,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2018-10-04 12:26:04,330 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 16 treesize of output 15 [2018-10-04 12:26:04,331 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-10-04 12:26:04,588 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 16 treesize of output 15 [2018-10-04 12:26:04,588 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:04,662 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:10,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-04 12:26:10,999 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:292, output treesize:74 [2018-10-04 12:26:11,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-04 12:26:11,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-10-04 12:26:11,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-10-04 12:26:11,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-10-04 12:26:11,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-04 12:26:11,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-04 12:26:11,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-10-04 12:26:11,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-04 12:26:11,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2018-10-04 12:26:11,504 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,541 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:26:11,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-04 12:26:11,638 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:193, output treesize:74 [2018-10-04 12:26:11,824 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-04 12:26:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:26:11,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:26:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:26:12,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:26:12,000 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 10 states. [2018-10-04 12:26:12,149 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-04 12:26:12,377 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-04 12:26:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:12,447 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:26:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:26:12,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-10-04 12:26:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:12,448 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:26:12,448 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:26:12,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:26:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:26:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:26:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:26:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:26:12,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 12:26:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:12,456 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:26:12,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:26:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:26:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:26:12,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:12,457 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 12:26:12,457 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:12,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 12:26:12,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:12,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:12,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:12,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:12,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:12,912 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:26:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:26:12,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-04 12:26:12,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:26:12,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-04 12:26:13,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:13,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-10-04 12:26:13,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:26:13,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:26:13,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:26:13,157 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 12:26:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:13,541 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:26:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:26:13,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:26:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:13,543 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:26:13,543 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:26:13,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:26:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:26:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:26:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:26:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:26:13,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2018-10-04 12:26:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:13,545 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:26:13,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:26:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:26:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:26:13,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:26:13,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:26:13,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:26:13,765 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 11 103) no Hoare annotation was computed. [2018-10-04 12:26:13,765 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 11 103) no Hoare annotation was computed. [2018-10-04 12:26:13,765 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 11 103) no Hoare annotation was computed. [2018-10-04 12:26:13,766 INFO L421 ceAbstractionStarter]: At program point L91(lines 91 101) the Hoare annotation is: false [2018-10-04 12:26:13,766 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) no Hoare annotation was computed. [2018-10-04 12:26:13,766 INFO L421 ceAbstractionStarter]: At program point L75(lines 75 92) the Hoare annotation is: (let ((.cse0 (mod ~SIZE 4294967296))) (and (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) .cse0) (< 2147483647 .cse0)) (and (= .cse0 ULTIMATE.start_linear_search_~n) (<= .cse0 2147483647))) (< (mod ULTIMATE.start_linear_search_~j~5 4294967296) .cse0))) [2018-10-04 12:26:13,766 INFO L421 ceAbstractionStarter]: At program point L100(lines 65 100) the Hoare annotation is: (let ((.cse0 (mod ~SIZE 4294967296))) (or (and (= (+ ULTIMATE.start_linear_search_~n 4294967296) .cse0) (< 2147483647 .cse0)) (and (= .cse0 ULTIMATE.start_linear_search_~n) (<= .cse0 2147483647)))) [2018-10-04 12:26:13,776 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:26:13 BoogieIcfgContainer [2018-10-04 12:26:13,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:26:13,777 INFO L168 Benchmark]: Toolchain (without parser) took 11927.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 343.7 MB). Peak memory consumption was 343.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:13,778 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:13,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:13,779 INFO L168 Benchmark]: Boogie Preprocessor took 32.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:13,780 INFO L168 Benchmark]: RCFGBuilder took 407.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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-10-04 12:26:13,781 INFO L168 Benchmark]: TraceAbstraction took 11435.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 322.6 MB). Peak memory consumption was 322.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:13,784 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 407.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 11435.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 322.6 MB). Peak memory consumption was 322.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((linear_search_~n + 4294967296 == ~SIZE % 4294967296 && 2147483647 < ~SIZE % 4294967296) || (~SIZE % 4294967296 == linear_search_~n && ~SIZE % 4294967296 <= 2147483647)) && linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (linear_search_~n + 4294967296 == ~SIZE % 4294967296 && 2147483647 < ~SIZE % 4294967296) || (~SIZE % 4294967296 == linear_search_~n && ~SIZE % 4294967296 <= 2147483647) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 11.3s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 7 SDtfs, 8 SDslu, 5 SDs, 0 SdLazy, 42 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=2, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 9 NumberOfFragments, 59 HoareAnnotationTreeSize, 3 FomulaSimplifications, 283 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 377 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 32 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 4009 SizeOfPredicates, 26 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-26-13-797.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_search.i_5.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-26-13-797.csv Received shutdown request...