java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:48:39,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:48:39,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:48:39,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:48:39,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:48:39,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:48:39,546 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:48:39,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:48:39,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:48:39,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:48:39,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:48:39,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:48:39,552 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:48:39,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:48:39,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:48:39,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:48:39,556 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:48:39,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:48:39,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:48:39,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:48:39,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:48:39,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:48:39,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:48:39,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:48:39,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:48:39,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:48:39,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:48:39,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:48:39,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:48:39,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:48:39,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:48:39,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:48:39,572 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:48:39,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:48:39,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:48:39,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:48:39,574 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:48:39,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:48:39,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:48:39,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:48:39,590 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:48:39,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:48:39,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:48:39,591 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:48:39,591 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:48:39,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:48:39,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:48:39,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:48:39,677 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:48:39,678 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:48:39,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl [2018-07-23 13:48:39,679 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl' [2018-07-23 13:48:39,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:48:39,786 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:48:39,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:48:39,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:48:39,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:48:39,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:48:39,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:48:39,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:48:39,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:48:39,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/1) ... [2018-07-23 13:48:39,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:48:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:48:40,506 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:48:40,507 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:40 BoogieIcfgContainer [2018-07-23 13:48:40,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:48:40,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:48:40,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:48:40,513 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:48:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:39" (1/2) ... [2018-07-23 13:48:40,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c37d0 and model type pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:48:40, skipping insertion in model container [2018-07-23 13:48:40,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:40" (2/2) ... [2018-07-23 13:48:40,522 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl [2018-07-23 13:48:40,533 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:48:40,544 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:48:40,583 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:48:40,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:48:40,585 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:48:40,585 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:48:40,585 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:48:40,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:48:40,586 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:48:40,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:48:40,586 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:48:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:48:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:48:40,609 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:40,610 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:48:40,610 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 979518, now seen corresponding path program 1 times [2018-07-23 13:48:40,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:40,796 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:48:40,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:48:40,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:40,800 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256)))), 12#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:40,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:40,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:40,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:40,816 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:48:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:40,912 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:48:40,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:40,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:48:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:40,926 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:48:40,926 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:48:40,930 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:48:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:48:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:48:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:48:40,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:48:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:40,979 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:48:40,979 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:48:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:48:40,980 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:40,980 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:48:40,981 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash 941392015, now seen corresponding path program 1 times [2018-07-23 13:48:40,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:41,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:48:41,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,091 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 52#(and (<= ~r1 0) (<= 0 ~r1)), 53#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:48:41,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:48:41,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:48:41,095 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:48:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:41,185 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:48:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:48:41,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:48:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:41,190 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:48:41,190 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:48:41,194 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:48:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:48:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:48:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:48:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:48:41,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:48:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:48:41,203 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:48:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:48:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:48:41,204 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:41,204 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:48:41,204 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1560297824, now seen corresponding path program 2 times [2018-07-23 13:48:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:41,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:48:41,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,372 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 101#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 102#(and (<= ~r1 1) (= ~mode1 0)), 103#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,373 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:48:41,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:48:41,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:48:41,374 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-23 13:48:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:41,483 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:48:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:48:41,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-07-23 13:48:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:41,484 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:48:41,484 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:48:41,485 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:48:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:48:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 13:48:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:48:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:48:41,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:48:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:41,490 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:48:41,490 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:48:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:48:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:48:41,491 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:41,491 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:48:41,491 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash -502547343, now seen corresponding path program 3 times [2018-07-23 13:48:41,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:41,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:48:41,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,657 INFO L185 omatonBuilderFactory]: Interpolants [160#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 161#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 162#(and (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256)))) (= ~mode1 0)), 163#(and (<= 1 ~mode1) (<= ~mode1 1) (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256))))), 164#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 158#true, 159#false] [2018-07-23 13:48:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,658 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:48:41,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:48:41,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:48:41,659 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 13:48:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:41,804 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:48:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:48:41,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:48:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:41,806 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:48:41,806 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:48:41,807 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:48:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:48:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 13:48:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:48:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:48:41,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:48:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:41,823 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:48:41,823 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:48:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:48:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:48:41,824 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:41,824 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:48:41,826 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1911584254, now seen corresponding path program 4 times [2018-07-23 13:48:41,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:41,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:48:41,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,977 INFO L185 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 230#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 231#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 232#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 1) (<= 1 ~r1)), 233#(and (<= ~r1 2) (= ~mode1 0)), 234#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:41,978 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:48:41,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:48:41,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:48:41,979 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-07-23 13:48:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:42,100 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:48:42,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:48:42,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-23 13:48:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:42,102 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:48:42,102 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:48:42,103 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:48:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:48:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:48:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:48:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:48:42,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:48:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:42,111 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:48:42,112 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:48:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:48:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:48:42,113 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:42,113 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:48:42,113 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1213609811, now seen corresponding path program 5 times [2018-07-23 13:48:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-23 13:48:42,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:42,238 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:48:42,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:48:42,239 INFO L185 omatonBuilderFactory]: Interpolants [309#true, 310#false, 311#(and (<= 0 ~send1) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send1 127) (= 0 (+ ~nomsg 1))), 312#(and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~send1 (+ (* 256 (div ~send1 256)) 255))))] [2018-07-23 13:48:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-07-23 13:48:42,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:42,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:42,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:42,240 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-07-23 13:48:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:42,253 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:48:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:42,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:48:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:42,254 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:48:42,254 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:48:42,255 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:48:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:48:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:48:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:48:42,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-07-23 13:48:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:42,256 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:48:42,257 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:48:42,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:48:42,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:48:42,306 INFO L421 ceAbstractionStarter]: For program point L267(lines 260 268) no Hoare annotation was computed. [2018-07-23 13:48:42,307 INFO L417 ceAbstractionStarter]: At program point L300(lines 300 307) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~send1 (+ (* 256 (div ~send1 256)) 255))) (<= 0 ~r1)) [2018-07-23 13:48:42,308 INFO L421 ceAbstractionStarter]: For program point L227(lines 219 228) no Hoare annotation was computed. [2018-07-23 13:48:42,308 INFO L421 ceAbstractionStarter]: For program point L247(lines 241 248) no Hoare annotation was computed. [2018-07-23 13:48:42,308 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 220) no Hoare annotation was computed. [2018-07-23 13:48:42,308 INFO L417 ceAbstractionStarter]: At program point L306(lines 306 313) the Hoare annotation is: false [2018-07-23 13:48:42,308 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 57 315) the Hoare annotation is: true [2018-07-23 13:48:42,309 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 57 315) the Hoare annotation is: false [2018-07-23 13:48:42,309 INFO L421 ceAbstractionStarter]: For program point L290(lines 285 291) no Hoare annotation was computed. [2018-07-23 13:48:42,309 INFO L421 ceAbstractionStarter]: For program point L252(lines 252 261) no Hoare annotation was computed. [2018-07-23 13:48:42,309 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 242) no Hoare annotation was computed. [2018-07-23 13:48:42,309 INFO L421 ceAbstractionStarter]: For program point L279(lines 279 286) no Hoare annotation was computed. [2018-07-23 13:48:42,311 INFO L417 ceAbstractionStarter]: At program point L312(lines 201 312) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and (not (= ~p1_old ~nomsg)) (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ~mode1) (<= ~mode1 1) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~send1 (+ (* 256 (div ~send1 256)) 255))) .cse1) (and .cse0 (<= 0 ~send1) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send1 127) (= 0 (+ ~nomsg 1)) .cse1))) [2018-07-23 13:48:42,312 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 314) the Hoare annotation is: false [2018-07-23 13:48:42,312 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 315) no Hoare annotation was computed. [2018-07-23 13:48:42,326 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:48:42 BoogieIcfgContainer [2018-07-23 13:48:42,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:48:42,327 INFO L168 Benchmark]: Toolchain (without parser) took 2542.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:42,329 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-07-23 13:48:42,330 INFO L168 Benchmark]: Boogie Preprocessor took 76.41 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-07-23 13:48:42,331 INFO L168 Benchmark]: RCFGBuilder took 644.09 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-07-23 13:48:42,332 INFO L168 Benchmark]: TraceAbstraction took 1816.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 158.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:42,336 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.21 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 76.41 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 644.09 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 1816.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 158.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 314]: 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: 300]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= assert_~arg) && !(~send1 == 256 * (~send1 / 256) + 255)) && 0 <= ~r1 - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && assert_~arg <= 1) && ~r1 <= 0) && 1 <= ~mode1) && ~mode1 <= 1) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= assert_~arg) && !(~send1 == 256 * (~send1 / 256) + 255)) && 0 <= ~r1) || ((((((~r1 <= 0 && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 14 SDslu, 44 SDs, 0 SdLazy, 116 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 29/70 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, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 115 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 3935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 29/70 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/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-48-42-349.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-48-42-349.csv Received shutdown request...