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.UNBOUNDED.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:48:44,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:48:44,671 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:48:44,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:48:44,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:48:44,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:48:44,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:48:44,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:48:44,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:48:44,702 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:48:44,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:48:44,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:48:44,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:48:44,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:48:44,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:48:44,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:48:44,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:48:44,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:48:44,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:48:44,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:48:44,714 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:48:44,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:48:44,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:48:44,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:48:44,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:48:44,720 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:48:44,721 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:48:44,722 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:48:44,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:48:44,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:48:44,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:48:44,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:48:44,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:48:44,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:48:44,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:48:44,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:48:44,727 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:44,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:48:44,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:48:44,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:48:44,744 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:48:44,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:48:44,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:48:44,744 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:48:44,745 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:48:44,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:48:44,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:48:44,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:48:44,808 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:48:44,809 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:48:44,810 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.UNBOUNDED.pals.c_9.bpl [2018-07-23 13:48:44,810 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl' [2018-07-23 13:48:44,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:48:44,896 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:48:44,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:48:44,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:48:44,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:48:44,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:44,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:48:44,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:48:44,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:48:44,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:48:44,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/1) ... [2018-07-23 13:48:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:48:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:48:45,677 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:48:45,677 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:45 BoogieIcfgContainer [2018-07-23 13:48:45,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:48:45,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:48:45,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:48:45,683 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:48:45,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:48:44" (1/2) ... [2018-07-23 13:48:45,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355c85f4 and model type pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:48:45, skipping insertion in model container [2018-07-23 13:48:45,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:48:45" (2/2) ... [2018-07-23 13:48:45,688 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl [2018-07-23 13:48:45,698 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:48:45,707 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:48:45,753 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:48:45,754 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:48:45,754 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:48:45,754 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:48:45,754 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:48:45,755 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:48:45,755 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:48:45,755 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:48:45,755 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:48:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:48:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:48:45,778 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:45,779 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:48:45,779 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash 979518, now seen corresponding path program 1 times [2018-07-23 13:48:45,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:45,974 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:45,977 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:48:45,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:48:45,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:45,981 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:45,982 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 12#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:45,982 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:45,983 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:45,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:46,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:46,003 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:48:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:46,106 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:48:46,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:46,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:48:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:46,127 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:48:46,127 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:48:46,134 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:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:48:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:48:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:48:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:48:46,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:48:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:48:46,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:48:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:48:46,180 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:46,181 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:48:46,181 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 941392015, now seen corresponding path program 1 times [2018-07-23 13:48:46,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:46,363 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:46,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:46,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:48:46,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:46,365 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:46,365 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 52#(and (or (= ULTIMATE.start_assert_~arg 0) (<= ~r1 (* 256 (div ~r1 256)))) (<= 1 ~mode1) (<= ~mode1 1)), 53#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (* 256 (div ~r1 256)))), 54#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:46,366 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:46,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:48:46,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:48:46,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:48:46,369 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:48:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:46,456 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:48:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:48:46,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:48:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:46,458 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:48:46,458 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:48:46,461 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:48:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:48:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:48:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:48:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:48:46,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:48:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:46,467 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:48:46,467 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:48:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:48:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:48:46,468 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:46,468 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:48:46,468 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1560297824, now seen corresponding path program 2 times [2018-07-23 13:48:46,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:46,576 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:46,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:46,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:48:46,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:46,578 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:46,578 INFO L185 omatonBuilderFactory]: Interpolants [99#true, 100#false, 101#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 102#(and (or (= ULTIMATE.start_assert_~arg 0) (<= ~r1 (* 256 (div ~r1 256)))) (<= 1 ~mode1) (<= ~mode1 1)), 103#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (* 256 (div ~r1 256)))), 104#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 105#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:46,579 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:46,579 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:48:46,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:48:46,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:48:46,580 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-07-23 13:48:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:46,663 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:48:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:48:46,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:48:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:46,668 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:48:46,668 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:48:46,669 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:48:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:48:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-07-23 13:48:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:48:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:48:46,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:48:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:46,680 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:48:46,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:48:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:48:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:48:46,681 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:46,681 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:48:46,681 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash -502547343, now seen corresponding path program 3 times [2018-07-23 13:48:46,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:46,867 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:46,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:46,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:48:46,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:46,869 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:46,872 INFO L185 omatonBuilderFactory]: Interpolants [160#true, 161#false, 162#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 163#(and (<= 1 ~mode1) (<= ~mode1 1) (or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (<= ~r1 (* 256 (div ~r1 256))))), 164#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 (* 256 (div ~r1 256)))), 165#(or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1))), 166#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 167#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 1) (<= 1 ~r1)), 168#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:48:46,872 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:46,872 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:48:46,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:48:46,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:48:46,874 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-07-23 13:48:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:47,010 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:48:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:48:47,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-07-23 13:48:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:47,011 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:48:47,012 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:48:47,012 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:48:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:48:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 13:48:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:48:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:48:47,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 13:48:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:47,023 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:48:47,023 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:48:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:48:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:48:47,024 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:47,025 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 13:48:47,025 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1911584254, now seen corresponding path program 4 times [2018-07-23 13:48:47,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:47,283 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:47,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:47,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:48:47,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:47,285 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:47,286 INFO L185 omatonBuilderFactory]: Interpolants [240#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 1) (< 0 (+ (div ~r1 256) 1))), 241#(or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (<= ~r1 2) (<= 0 ~r1) (= ~mode1 0))), 242#(and (<= ~r1 2) (<= 0 ~r1) (= ~mode1 0)), 243#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 233#true, 234#false, 235#(and (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 (* 256 (div ~r1 256)))), 236#(and (<= (* 256 (div (+ ~r1 255) 256)) ~r1) (<= 1 ~mode1) (<= ~mode1 1)), 237#(and (or (and (<= 0 ULTIMATE.start_assert_~arg) (<= ULTIMATE.start_assert_~arg 0)) (and (<= 0 (+ ~r1 1)) (= ~mode1 0) (<= ~r1 (+ (* 256 (div ~r1 256)) 1)))) (<= (div ~r1 256) 0)), 238#(and (<= 0 (+ ~r1 1)) (<= (div ~r1 256) 0) (= ~mode1 0) (<= ~r1 (+ (* 256 (div ~r1 256)) 1))), 239#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 1) (or (= ULTIMATE.start_assert_~arg 0) (< 0 (+ (div ~r1 256) 1))))] [2018-07-23 13:48:47,286 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:47,290 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:48:47,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:48:47,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:48:47,292 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-07-23 13:48:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:47,465 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:48:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:48:47,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-07-23 13:48:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:47,466 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:48:47,466 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:48:47,467 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:48:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:48:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:48:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:48:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:48:47,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 13:48:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:48:47,473 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:48:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:48:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:48:47,474 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:48:47,474 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:48:47,475 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:48:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1213609811, now seen corresponding path program 5 times [2018-07-23 13:48:47,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:48:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:48:47,576 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:47,576 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:48:47,576 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:48:47,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:48:47,577 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:47,577 INFO L185 omatonBuilderFactory]: Interpolants [320#(and (= ~mode3 (* 256 (div ~mode3 256))) (<= ~send2 127) (= ~mode2 (* 256 (div ~mode2 256))) (<= 0 ~send2) (= 0 (+ ~nomsg 1))), 321#(and (not (= ~p2_old ~nomsg)) (<= ~mode3 1) (<= 1 ~mode3)), 318#true, 319#false] [2018-07-23 13:48:47,578 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:47,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:48:47,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:48:47,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:48:47,579 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-07-23 13:48:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:48:47,592 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:48:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:48:47,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:48:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:48:47,593 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:48:47,593 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:48:47,594 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:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:48:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:48:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:48:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:48:47,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-07-23 13:48:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:48:47,596 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:48:47,597 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:48:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:48:47,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:48:47,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:48:47,663 INFO L421 ceAbstractionStarter]: For program point L223(lines 214 224) no Hoare annotation was computed. [2018-07-23 13:48:47,663 INFO L421 ceAbstractionStarter]: For program point L289(lines 284 290) no Hoare annotation was computed. [2018-07-23 13:48:47,663 INFO L421 ceAbstractionStarter]: For program point L266(lines 259 267) no Hoare annotation was computed. [2018-07-23 13:48:47,664 INFO L421 ceAbstractionStarter]: For program point L246(lines 237 247) no Hoare annotation was computed. [2018-07-23 13:48:47,665 INFO L417 ceAbstractionStarter]: At program point L308(lines 199 308) the Hoare annotation is: (let ((.cse0 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_assert_~arg) .cse0) (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (<= ~send2 127) (= ~mode2 (* 256 (div ~mode2 256))) (<= 0 ~send2) (= 0 (+ ~nomsg 1)) .cse0))) [2018-07-23 13:48:47,666 INFO L421 ceAbstractionStarter]: For program point L206(lines 206 215) no Hoare annotation was computed. [2018-07-23 13:48:47,666 INFO L421 ceAbstractionStarter]: For program point L228(lines 228 238) no Hoare annotation was computed. [2018-07-23 13:48:47,666 INFO L417 ceAbstractionStarter]: At program point L305(lines 305 309) the Hoare annotation is: false [2018-07-23 13:48:47,667 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 57 311) the Hoare annotation is: true [2018-07-23 13:48:47,667 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 57 311) the Hoare annotation is: false [2018-07-23 13:48:47,667 INFO L421 ceAbstractionStarter]: For program point L251(lines 251 260) no Hoare annotation was computed. [2018-07-23 13:48:47,667 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 285) no Hoare annotation was computed. [2018-07-23 13:48:47,668 INFO L417 ceAbstractionStarter]: At program point L299(lines 299 306) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 (* 256 (div ~r1 256)))) [2018-07-23 13:48:47,668 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 310) the Hoare annotation is: false [2018-07-23 13:48:47,668 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 311) no Hoare annotation was computed. [2018-07-23 13:48:47,683 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:48:47 BoogieIcfgContainer [2018-07-23 13:48:47,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:48:47,685 INFO L168 Benchmark]: Toolchain (without parser) took 2790.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:47,688 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:47,689 INFO L168 Benchmark]: Boogie Preprocessor took 69.48 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:47,689 INFO L168 Benchmark]: RCFGBuilder took 710.77 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:47,691 INFO L168 Benchmark]: TraceAbstraction took 2003.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:48:47,699 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.22 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 69.48 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 710.77 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2003.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 310]: 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: 299]: Loop Invariant Derived loop invariant: ((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 1.9s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 23 SDslu, 35 SDs, 0 SdLazy, 129 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s 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, 105 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 4576 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.UNBOUNDED.pals.c_9.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-48-47-727.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c_9.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-48-47-727.csv Received shutdown request...