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.3.1.ufo.BOUNDED-6.pals.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:26,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:26,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:26,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:26,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:26,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:26,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:26,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:26,714 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:26,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:26,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:26,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:26,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:26,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:26,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:26,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:26,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:26,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:26,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:26,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:26,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:26,746 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:26,748 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:26,748 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:26,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:26,749 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:26,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:26,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:26,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:26,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:26,753 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:26,754 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:26,754 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:26,754 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:26,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:26,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:26,758 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:26,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:26,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:26,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:26,783 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:26,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:26,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:26,784 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:26,784 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:26,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:26,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:26,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:26,872 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:26,873 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:26,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl [2018-07-23 13:49:26,874 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl' [2018-07-23 13:49:26,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:26,978 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:26,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:26,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:26,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:27,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:27,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:27,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:27,033 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:27,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/1) ... [2018-07-23 13:49:27,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:27,768 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:27,769 INFO L202 PluginConnector]: Adding new model pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:27 BoogieIcfgContainer [2018-07-23 13:49:27,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:27,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:27,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:27,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:27,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:26" (1/2) ... [2018-07-23 13:49:27,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159e92bf and model type pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:27, skipping insertion in model container [2018-07-23 13:49:27,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:27" (2/2) ... [2018-07-23 13:49:27,779 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl [2018-07-23 13:49:27,789 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:27,798 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:27,846 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:27,847 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:27,848 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:27,848 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:27,848 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:27,848 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:27,848 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:27,849 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:27,849 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:49:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:49:27,873 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:27,874 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:49:27,874 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash 987398, now seen corresponding path program 1 times [2018-07-23 13:49:27,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:28,065 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:28,068 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:28,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:28,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:28,072 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:28,073 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:28,073 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:28,074 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:28,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:28,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:28,094 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-23 13:49:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:28,197 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:49:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:28,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:49:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:28,215 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:49:28,217 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:49:28,222 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:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:49:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-07-23 13:49:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:49:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:49:28,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 13:49:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:28,268 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:49:28,269 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:49:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:49:28,269 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:28,270 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 13:49:28,270 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 948966809, now seen corresponding path program 1 times [2018-07-23 13:49:28,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:28,385 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:28,385 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:28,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:28,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:28,392 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:28,392 INFO L185 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 52#(and (<= ~r1 0) (<= 0 ~r1)), 53#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:28,393 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:28,396 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:28,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:28,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:28,398 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-07-23 13:49:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:28,481 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:49:28,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:28,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-07-23 13:49:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:28,482 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:49:28,483 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:49:28,484 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:49:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 13:49:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:49:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:49:28,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 13:49:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:28,495 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:49:28,496 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:49:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:49:28,497 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:28,497 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 13:49:28,497 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1424114028, now seen corresponding path program 2 times [2018-07-23 13:49:28,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:28,628 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:28,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:28,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:28,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:28,629 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:28,630 INFO L185 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(= ~mode1 (* 256 (div ~mode1 256))), 101#(= ~mode1 1), 102#(or (= ULTIMATE.start_assert_~arg 0) (and (= ULTIMATE.start_assert_~arg 1) (<= ~r1 2) (= ~mode1 0))), 103#(and (<= ~r1 2) (= ~mode1 0)), 104#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg))] [2018-07-23 13:49:28,630 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:28,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:28,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:28,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:28,632 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-07-23 13:49:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:28,819 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:49:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:28,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:49:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:28,820 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:49:28,820 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:49:28,821 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:49:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:49:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:49:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:49:28,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 13:49:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:49:28,835 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:49:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:28,836 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:28,837 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 13:49:28,837 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1520909185, now seen corresponding path program 3 times [2018-07-23 13:49:28,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:29,004 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:29,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:29,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:49:29,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:29,008 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:29,009 INFO L185 omatonBuilderFactory]: Interpolants [160#false, 161#(and (<= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) (<= 0 ~r1)), 162#(and (<= ~r1 0) (<= 0 ~r1)), 163#(or (= ~mode1 1) (and (<= ~r1 1) (<= 1 ~r1))), 164#(or (= 0 ULTIMATE.start_assert_~arg) (and (= ULTIMATE.start_assert_~arg 1) (<= ~r1 2) (or (and (<= ~r1 1) (<= 1 ~r1)) (= ~mode1 0)))), 165#(and (<= ~r1 2) (or (and (<= ~r1 1) (<= 1 ~r1)) (= ~mode1 0))), 166#(and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg)), 159#true] [2018-07-23 13:49:29,009 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:29,009 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:49:29,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:49:29,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:49:29,013 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-07-23 13:49:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:29,136 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:49:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:29,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 13:49:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:29,141 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:49:29,141 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:29,142 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:49:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-07-23 13:49:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:49:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:49:29,155 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-07-23 13:49:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:29,155 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:49:29,155 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:49:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:49:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:49:29,156 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:29,158 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 13:49:29,158 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash 247697509, now seen corresponding path program 4 times [2018-07-23 13:49:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:29,304 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:49:29,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:29,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:49:29,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:29,305 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:29,308 INFO L185 omatonBuilderFactory]: Interpolants [240#false, 241#(and (<= 0 ~send1) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send1 127) (= 0 (+ ~nomsg 1))), 242#(and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1)), 239#true] [2018-07-23 13:49:29,308 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:49:29,308 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:29,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:29,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:29,309 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-07-23 13:49:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:29,326 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:49:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:29,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-07-23 13:49:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:29,328 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:49:29,328 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:29,329 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:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:29,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-07-23 13:49:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:29,333 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:29,333 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:29,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:29,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:29,385 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2018-07-23 13:49:29,385 INFO L421 ceAbstractionStarter]: For program point L260(lines 260 266) no Hoare annotation was computed. [2018-07-23 13:49:29,386 INFO L421 ceAbstractionStarter]: For program point L204(lines 196 205) no Hoare annotation was computed. [2018-07-23 13:49:29,386 INFO L421 ceAbstractionStarter]: For program point L226(lines 218 227) no Hoare annotation was computed. [2018-07-23 13:49:29,386 INFO L421 ceAbstractionStarter]: For program point L248(lines 240 249) no Hoare annotation was computed. [2018-07-23 13:49:29,386 INFO L421 ceAbstractionStarter]: For program point L269(lines 265 276) no Hoare annotation was computed. [2018-07-23 13:49:29,388 INFO L417 ceAbstractionStarter]: At program point L302(lines 179 302) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~r1))) (or (and (not (= ~p1_old ~nomsg)) (= ~mode1 1) (<= ULTIMATE.start_assert_~arg 1) .cse0 (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_assert_~arg) .cse1) (and .cse0 (<= 0 ~send1) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~send1 127) (= 0 (+ ~nomsg 1)) .cse1))) [2018-07-23 13:49:29,388 INFO L421 ceAbstractionStarter]: For program point L209(lines 209 219) no Hoare annotation was computed. [2018-07-23 13:49:29,388 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 51 305) the Hoare annotation is: true [2018-07-23 13:49:29,388 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 51 305) the Hoare annotation is: false [2018-07-23 13:49:29,389 INFO L417 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (= ~mode1 1) (<= ULTIMATE.start_assert_~arg 1) (<= ~r1 0) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~r1)) [2018-07-23 13:49:29,389 INFO L417 ceAbstractionStarter]: At program point L296(lines 296 303) the Hoare annotation is: false [2018-07-23 13:49:29,393 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 241) no Hoare annotation was computed. [2018-07-23 13:49:29,393 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 304) the Hoare annotation is: false [2018-07-23 13:49:29,394 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 305) no Hoare annotation was computed. [2018-07-23 13:49:29,394 INFO L421 ceAbstractionStarter]: For program point L280(lines 275 281) no Hoare annotation was computed. [2018-07-23 13:49:29,414 INFO L202 PluginConnector]: Adding new model pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:29 BoogieIcfgContainer [2018-07-23 13:49:29,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:29,416 INFO L168 Benchmark]: Toolchain (without parser) took 2438.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:29,419 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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:29,420 INFO L168 Benchmark]: Boogie Preprocessor took 53.33 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:29,422 INFO L168 Benchmark]: RCFGBuilder took 736.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:29,424 INFO L168 Benchmark]: TraceAbstraction took 1643.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:29,430 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.23 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 53.33 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 736.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1643.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 304]: 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: 290]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && ~mode1 == 1) && assert_~arg <= 1) && ~r1 <= 0) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= assert_~arg) && 0 <= ~r1 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && ~mode1 == 1) && assert_~arg <= 1) && ~r1 <= 0) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= assert_~arg) && 0 <= ~r1) || ((((((~r1 <= 0 && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 79 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 30/50 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 9 NumberOfFragments, 89 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 2140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 30/50 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.3.1.ufo.BOUNDED-6.pals.c_13.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-29-449.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-29-449.csv Received shutdown request...