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.4.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:09,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:09,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:09,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:09,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:09,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:09,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:09,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:09,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:09,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:09,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:09,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:09,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:09,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:09,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:09,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:09,066 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:09,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:09,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:09,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:09,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:09,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:09,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:09,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:09,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:09,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:09,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:09,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:09,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:09,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:09,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:09,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:09,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:09,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:09,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:09,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:09,094 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:49:09,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:09,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:09,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:09,110 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:09,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:09,110 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:09,110 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:09,111 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:09,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:09,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:09,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:09,191 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:09,192 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:09,193 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.4.ufo.BOUNDED-8.pals.c_10.bpl [2018-07-23 13:49:09,193 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl' [2018-07-23 13:49:09,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:09,273 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:09,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:09,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:09,273 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:09,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:09,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:09,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:09,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:09,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/1) ... [2018-07-23 13:49:09,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:10,030 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:10,031 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:10 BoogieIcfgContainer [2018-07-23 13:49:10,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:10,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:10,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:10,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:10,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:09" (1/2) ... [2018-07-23 13:49:10,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f818bc5 and model type pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:10, skipping insertion in model container [2018-07-23 13:49:10,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:10" (2/2) ... [2018-07-23 13:49:10,042 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl [2018-07-23 13:49:10,053 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:10,063 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:10,115 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:10,116 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:10,116 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:10,116 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:10,116 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:10,117 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:10,117 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:10,117 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:10,117 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:49:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:49:10,142 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:10,143 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:49:10,143 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:10,149 INFO L82 PathProgramCache]: Analyzing trace with hash 990345, now seen corresponding path program 1 times [2018-07-23 13:49:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:10,346 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:49:10,350 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:10,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:10,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:10,354 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:49:10,355 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:49:10,355 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:49:10,356 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:10,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:10,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:10,377 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:49:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:10,479 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:49:10,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:10,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:49:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:10,503 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:49:10,503 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:49:10,507 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:49:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:49:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:49:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:49:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:49:10,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:49:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:10,548 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:49:10,548 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:49:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:49:10,549 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:10,550 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:49:10,550 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 951799901, now seen corresponding path program 1 times [2018-07-23 13:49:10,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:10,644 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:49:10,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:10,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:10,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:10,645 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:49:10,645 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 52#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 53#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:10,646 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:49:10,648 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:10,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:10,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:10,650 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:49:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:10,798 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:49:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:10,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:49:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:10,801 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:49:10,802 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:49:10,803 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:49:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:49:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:49:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:49:10,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:49:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:10,809 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:49:10,810 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:49:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:49:10,810 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:10,811 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:49:10,811 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash -148250831, now seen corresponding path program 2 times [2018-07-23 13:49:10,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:10,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:10,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:10,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:10,957 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:49:10,957 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(= ~mode1 (* 256 (div ~mode1 256))), 101#(and (<= 1 ~mode1) (<= ~mode1 1)), 102#(or (= ULTIMATE.start_assert_~arg 0) (and (<= ~r1 3) (= ~mode1 0))), 103#(and (<= ~r1 3) (= ~mode1 0)), 104#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:10,959 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:10,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:10,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:10,960 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-07-23 13:49:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:11,102 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:49:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:11,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:49:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:11,103 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:49:11,103 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:49:11,104 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:49:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:49:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:49:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:49:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:49:11,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:49:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:49:11,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:49:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:11,111 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:11,111 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:49:11,111 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -735049467, now seen corresponding path program 3 times [2018-07-23 13:49:11,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:11,222 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:49:11,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:11,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:11,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:11,224 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:49:11,224 INFO L185 omatonBuilderFactory]: Interpolants [160#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1)), 161#(and (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256)))) (<= 0 ~r1) (<= ~r1 3) (= ~mode1 0)), 162#(and (<= 0 (+ ~r1 1)) (<= 1 (+ ~r1 (* 256 (div (+ (- ~r1) 1) 256)))) (<= ~r1 3)), 163#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 157#true, 158#false, 159#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1))] [2018-07-23 13:49:11,225 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:49:11,225 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:11,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:11,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:11,226 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-23 13:49:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:11,335 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:49:11,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:11,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 13:49:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:11,336 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:49:11,337 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:11,338 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:49:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:49:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:49:11,344 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-07-23 13:49:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:11,344 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:49:11,345 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:49:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:49:11,346 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:11,346 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:49:11,346 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1077400147, now seen corresponding path program 4 times [2018-07-23 13:49:11,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:11,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:11,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:49:11,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:11,583 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:49:11,584 INFO L185 omatonBuilderFactory]: Interpolants [240#(and (<= ~r1 1) (= ~mode1 0) (<= 1 ~r1)), 241#(and (<= 1 ~mode1) (<= ~mode1 1) (<= ~r1 1) (<= 1 ~r1)), 242#(and (or (<= 258 ~r1) (and (<= 2 (+ ~r1 (* 256 (div (+ (- ~r1) 2) 256)))) (<= 0 ~r1))) (= ~mode1 0)), 243#(or (and (<= 2 (+ ~r1 (* 256 (div (+ (- ~r1) 2) 256)))) (<= 0 ~r1) (<= ~r1 3)) (= ULTIMATE.start_assert_~arg 0)), 244#(and (<= 2 (+ ~r1 (* 256 (div (+ (- ~r1) 2) 256)))) (<= 0 ~r1) (<= ~r1 3)), 245#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 236#true, 237#false, 238#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 239#(and (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= 0 ~r1))] [2018-07-23 13:49:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:11,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:49:11,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:49:11,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:11,586 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2018-07-23 13:49:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:11,849 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-23 13:49:11,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:49:11,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-07-23 13:49:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:11,851 INFO L225 Difference]: With dead ends: 22 [2018-07-23 13:49:11,851 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:49:11,852 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:49:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:49:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-07-23 13:49:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:49:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 13:49:11,860 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-07-23 13:49:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:11,860 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 13:49:11,860 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:49:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 13:49:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:49:11,862 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:11,862 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 13:49:11,863 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash 602783317, now seen corresponding path program 5 times [2018-07-23 13:49:11,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:12,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:12,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:49:12,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:12,055 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:49:12,059 INFO L185 omatonBuilderFactory]: Interpolants [338#true, 339#false, 340#(and (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) (<= 0 ~send3)), 341#(and (<= 1 ~mode4) (<= ~mode4 1) (not (= ~p3_old ~nomsg)))] [2018-07-23 13:49:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:12,060 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:12,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:12,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:12,062 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2018-07-23 13:49:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:12,088 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 13:49:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:12,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-07-23 13:49:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:12,089 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:49:12,089 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:12,090 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:49:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:12,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-07-23 13:49:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:12,094 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:12,094 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:12,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:12,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:12,154 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-07-23 13:49:12,154 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 293) no Hoare annotation was computed. [2018-07-23 13:49:12,155 INFO L417 ceAbstractionStarter]: At program point L382(lines 382 389) the Hoare annotation is: false [2018-07-23 13:49:12,155 INFO L421 ceAbstractionStarter]: For program point L366(lines 361 367) no Hoare annotation was computed. [2018-07-23 13:49:12,158 INFO L417 ceAbstractionStarter]: At program point L388(lines 255 388) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ~mode4) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) .cse1 (not (= ~p3_old ~nomsg))) (and .cse0 (<= ~send3 127) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256))) (<= 0 ~send3) .cse1))) [2018-07-23 13:49:12,159 INFO L421 ceAbstractionStarter]: For program point L321(lines 312 322) no Hoare annotation was computed. [2018-07-23 13:49:12,159 INFO L421 ceAbstractionStarter]: For program point L341(lines 335 342) no Hoare annotation was computed. [2018-07-23 13:49:12,159 INFO L421 ceAbstractionStarter]: For program point L326(lines 326 336) no Hoare annotation was computed. [2018-07-23 13:49:12,159 INFO L421 ceAbstractionStarter]: For program point L303(lines 303 313) no Hoare annotation was computed. [2018-07-23 13:49:12,160 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 74 391) the Hoare annotation is: true [2018-07-23 13:49:12,160 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 74 391) the Hoare annotation is: false [2018-07-23 13:49:12,160 INFO L421 ceAbstractionStarter]: For program point L278(lines 272 279) no Hoare annotation was computed. [2018-07-23 13:49:12,160 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 362) no Hoare annotation was computed. [2018-07-23 13:49:12,164 INFO L417 ceAbstractionStarter]: At program point L376(lines 376 383) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ~r1 0) (<= 1 ~mode4) (<= 1 ~mode1) (<= ~mode1 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~r1) (not (= ~p3_old ~nomsg))) [2018-07-23 13:49:12,164 INFO L421 ceAbstractionStarter]: For program point L298(lines 292 299) no Hoare annotation was computed. [2018-07-23 13:49:12,164 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 390) the Hoare annotation is: false [2018-07-23 13:49:12,164 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 391) no Hoare annotation was computed. [2018-07-23 13:49:12,182 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:12 BoogieIcfgContainer [2018-07-23 13:49:12,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:12,184 INFO L168 Benchmark]: Toolchain (without parser) took 2911.91 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: 232.9 MB). Peak memory consumption was 232.9 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:12,186 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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:49:12,187 INFO L168 Benchmark]: Boogie Preprocessor took 68.51 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:49:12,187 INFO L168 Benchmark]: RCFGBuilder took 689.03 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:12,188 INFO L168 Benchmark]: TraceAbstraction took 2149.92 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.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:12,194 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.15 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 68.51 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 689.03 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2149.92 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.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 376]: Loop Invariant Derived loop invariant: (((((((assert_~arg <= 1 && ~r1 <= 0) && 1 <= ~mode4) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && 0 <= ~r1) && !(~p3_old == ~nomsg) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((assert_~arg <= 1 && ~r1 <= 0) && 1 <= ~mode4) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode4 <= 1) && 1 <= assert_~arg) && 0 <= ~r1) && !(~p3_old == ~nomsg)) || (((((((~r1 <= 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && 0 <= ~r1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 22 SDslu, 39 SDs, 0 SdLazy, 141 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 56/106 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, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 102 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 5278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 56/106 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.4.ufo.BOUNDED-8.pals.c_10.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-12-216.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-12-216.csv Received shutdown request...