java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:46:55,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:46:55,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:46:55,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:46:55,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:46:55,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:46:55,266 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:46:55,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:46:55,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:46:55,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:46:55,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:46:55,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:46:55,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:46:55,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:46:55,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:46:55,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:46:55,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:46:55,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:46:55,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:46:55,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:46:55,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:46:55,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:46:55,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:46:55,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:46:55,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:46:55,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:46:55,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:46:55,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:46:55,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:46:55,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:46:55,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:46:55,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:46:55,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:46:55,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:46:55,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:46:55,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:46:55,317 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:46:55,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:46:55,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:46:55,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:46:55,345 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:46:55,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:46:55,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:46:55,349 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:46:55,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:46:55,350 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:46:55,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:46:55,350 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:46:55,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:46:55,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:46:55,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:46:55,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:46:55,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:46:55,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:46:55,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:46:55,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:46:55,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:46:55,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:46:55,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:46:55,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:55,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:46:55,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:46:55,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:46:55,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:46:55,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:46:55,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:46:55,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:46:55,355 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:46:55,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:46:55,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:46:55,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:46:55,451 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:46:55,451 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:46:55,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl [2018-10-04 09:46:55,452 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl' [2018-10-04 09:46:55,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:46:55,549 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:46:55,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:55,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:46:55,551 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:46:55,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:55,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:46:55,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:46:55,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:46:55,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... [2018-10-04 09:46:55,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:46:55,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:46:55,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:46:55,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:46:55,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:46:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:46:56,218 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:46:56,219 INFO L202 PluginConnector]: Adding new model pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:56 BoogieIcfgContainer [2018-10-04 09:46:56,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:46:56,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:46:56,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:46:56,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:46:56,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:55" (1/2) ... [2018-10-04 09:46:56,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b847203 and model type pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:46:56, skipping insertion in model container [2018-10-04 09:46:56,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:56" (2/2) ... [2018-10-04 09:46:56,227 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl [2018-10-04 09:46:56,236 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:46:56,245 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:46:56,292 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:46:56,292 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:46:56,293 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:46:56,293 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:46:56,293 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:46:56,293 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:46:56,293 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:46:56,293 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:46:56,294 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:46:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-04 09:46:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:46:56,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:56,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:56,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:56,322 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1167247547, now seen corresponding path program 1 times [2018-10-04 09:46:56,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:56,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:56,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:56,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:56,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:56,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:56,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:56,577 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-04 09:46:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:56,615 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-10-04 09:46:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:56,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 09:46:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:56,629 INFO L225 Difference]: With dead ends: 42 [2018-10-04 09:46:56,629 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:46:56,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:46:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-04 09:46:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:46:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-10-04 09:46:56,673 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-10-04 09:46:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:56,674 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-10-04 09:46:56,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-10-04 09:46:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:46:56,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:56,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:56,675 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:56,675 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1352712387, now seen corresponding path program 1 times [2018-10-04 09:46:56,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:56,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:46:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:46:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:46:56,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:56,876 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-10-04 09:46:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:57,005 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-10-04 09:46:57,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:46:57,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-04 09:46:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:57,012 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:46:57,012 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:46:57,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 09:46:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:46:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-10-04 09:46:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:46:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-04 09:46:57,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-10-04 09:46:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:57,036 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-04 09:46:57,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:46:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-04 09:46:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:46:57,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:57,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:57,039 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:57,039 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1352652805, now seen corresponding path program 1 times [2018-10-04 09:46:57,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:57,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:57,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:46:57,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:57,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:57,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:46:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:46:57,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:57,184 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2018-10-04 09:46:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:57,292 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-10-04 09:46:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:46:57,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-04 09:46:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:57,294 INFO L225 Difference]: With dead ends: 97 [2018-10-04 09:46:57,294 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 09:46:57,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 09:46:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 09:46:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 09:46:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 09:46:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2018-10-04 09:46:57,342 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 13 [2018-10-04 09:46:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:57,343 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-10-04 09:46:57,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:46:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2018-10-04 09:46:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:46:57,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:57,345 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:57,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:57,345 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:57,346 INFO L82 PathProgramCache]: Analyzing trace with hash -496146579, now seen corresponding path program 1 times [2018-10-04 09:46:57,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:57,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 09:46:57,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:57,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:46:57,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:57,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:57,475 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand 3 states. [2018-10-04 09:46:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:57,524 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-10-04 09:46:57,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:57,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 09:46:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:57,526 INFO L225 Difference]: With dead ends: 163 [2018-10-04 09:46:57,526 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 09:46:57,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 09:46:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-04 09:46:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 09:46:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2018-10-04 09:46:57,562 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 24 [2018-10-04 09:46:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:57,565 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2018-10-04 09:46:57,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2018-10-04 09:46:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:46:57,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:57,568 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:46:57,568 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:57,568 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2004031215, now seen corresponding path program 1 times [2018-10-04 09:46:57,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:57,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:57,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:57,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-04 09:46:57,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:46:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:46:57,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:46:57,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:46:57,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:57,715 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand 3 states. [2018-10-04 09:46:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:46:57,838 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2018-10-04 09:46:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:46:57,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-04 09:46:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:46:57,846 INFO L225 Difference]: With dead ends: 339 [2018-10-04 09:46:57,846 INFO L226 Difference]: Without dead ends: 227 [2018-10-04 09:46:57,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:46:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-04 09:46:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-04 09:46:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 09:46:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-10-04 09:46:57,930 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 46 [2018-10-04 09:46:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:46:57,931 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-10-04 09:46:57,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:46:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-10-04 09:46:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:46:57,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:57,941 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:46:57,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:57,941 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash 622372971, now seen corresponding path program 1 times [2018-10-04 09:46:57,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:57,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:57,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:57,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-04 09:46:58,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:46:58,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:46:58,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:46:58,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:46:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-04 09:46:59,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:46:59,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-10-04 09:46:59,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:46:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:46:59,910 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:46:59,910 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 10 states. [2018-10-04 09:47:02,724 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:47:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:03,485 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2018-10-04 09:47:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:47:03,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-10-04 09:47:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:03,487 INFO L225 Difference]: With dead ends: 541 [2018-10-04 09:47:03,487 INFO L226 Difference]: Without dead ends: 196 [2018-10-04 09:47:03,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 1.4s impTime 11 [2018-10-04 09:47:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-04 09:47:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-10-04 09:47:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-04 09:47:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-10-04 09:47:03,557 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 46 [2018-10-04 09:47:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:03,557 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-10-04 09:47:03,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:47:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-10-04 09:47:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 09:47:03,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:03,560 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 09:47:03,560 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:03,561 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1967911691, now seen corresponding path program 2 times [2018-10-04 09:47:03,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:03,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-04 09:47:03,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:03,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:03,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:03,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:03,629 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 3 states. [2018-10-04 09:47:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:03,636 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-10-04 09:47:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:03,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-04 09:47:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:03,637 INFO L225 Difference]: With dead ends: 157 [2018-10-04 09:47:03,637 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:47:03,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:47:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:47:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:47:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:47:03,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-10-04 09:47:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:03,639 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:47:03,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:47:03,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:47:03,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:47:03,777 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-10-04 09:47:06,698 WARN L178 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2018-10-04 09:47:08,523 WARN L178 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2018-10-04 09:47:08,831 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2018-10-04 09:47:09,172 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2018-10-04 09:47:09,338 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 27 [2018-10-04 09:47:09,474 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 23 [2018-10-04 09:47:09,750 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2018-10-04 09:47:09,892 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 25 [2018-10-04 09:47:10,110 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 23 [2018-10-04 09:47:10,443 WARN L178 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 39 [2018-10-04 09:47:10,626 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 39 [2018-10-04 09:47:10,628 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 51 300) no Hoare annotation was computed. [2018-10-04 09:47:10,629 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 299) no Hoare annotation was computed. [2018-10-04 09:47:10,629 INFO L421 ceAbstractionStarter]: At program point L184(lines 184 195) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 09:47:10,629 INFO L421 ceAbstractionStarter]: At program point L246(lines 238 247) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (* 256 (div ~r1 256))) (.cse6 (not (= ~p1_new ~nomsg)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 (+ .cse5 2)) .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6))) [2018-10-04 09:47:10,629 INFO L421 ceAbstractionStarter]: At program point L207(lines 207 217) the Hoare annotation is: (let ((.cse3 (* 256 (div ~r1 256))) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 .cse3) .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse4) (and .cse5 .cse0 .cse1 .cse2 (<= ~r1 (+ .cse3 2)) .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse1 .cse2))) [2018-10-04 09:47:10,629 INFO L421 ceAbstractionStarter]: At program point L267(lines 263 274) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 09:47:10,629 INFO L421 ceAbstractionStarter]: At program point L294(lines 294 298) the Hoare annotation is: false [2018-10-04 09:47:10,630 INFO L421 ceAbstractionStarter]: At program point L224(lines 216 225) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (* 256 (div ~r1 256))) (.cse6 (not (= ~p1_new ~nomsg)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 (+ .cse5 2)) .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6))) [2018-10-04 09:47:10,630 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 295) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~64) (= 0 (+ ~nomsg 1))) [2018-10-04 09:47:10,630 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 51 300) no Hoare annotation was computed. [2018-10-04 09:47:10,630 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 300) no Hoare annotation was computed. [2018-10-04 09:47:10,630 INFO L421 ceAbstractionStarter]: At program point L278(lines 273 279) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~64) (= 0 (+ ~nomsg 1))) [2018-10-04 09:47:10,630 INFO L421 ceAbstractionStarter]: At program point L202(lines 194 203) the Hoare annotation is: (let ((.cse3 (* 256 (div ~r1 256))) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 .cse3) .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse4) (and .cse5 .cse0 .cse1 .cse2 (<= ~r1 (+ .cse3 2)) .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse1 .cse2))) [2018-10-04 09:47:10,630 INFO L421 ceAbstractionStarter]: At program point L297(lines 177 297) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 09:47:10,630 INFO L421 ceAbstractionStarter]: At program point L229(lines 229 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (* 256 (div ~r1 256))) (.cse6 (not (= ~p1_new ~nomsg)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 (+ .cse5 2)) .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 (<= ~r1 .cse5) .cse6))) [2018-10-04 09:47:10,631 INFO L421 ceAbstractionStarter]: At program point L258(lines 258 264) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 09:47:10,650 INFO L202 PluginConnector]: Adding new model pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:10 BoogieIcfgContainer [2018-10-04 09:47:10,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:10,651 INFO L168 Benchmark]: Toolchain (without parser) took 15102.93 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 170.1 MB). Peak memory consumption was 489.2 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:10,653 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:10,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:10,654 INFO L168 Benchmark]: Boogie Preprocessor took 27.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:10,655 INFO L168 Benchmark]: RCFGBuilder took 585.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-10-04 09:47:10,656 INFO L168 Benchmark]: TraceAbstraction took 14430.44 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 127.8 MB). Peak memory consumption was 446.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:10,662 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 585.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 14430.44 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 45.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 127.8 MB). Peak memory consumption was 446.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 299]: 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: 207]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p1_new == ~nomsg)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && !(~p1_new == ~nomsg))) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg))) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p1_new == ~nomsg)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && !(~p1_new == ~nomsg))) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg))) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p1_new == ~nomsg)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p1_new == ~nomsg)) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~64) && 0 == ~nomsg + 1 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) || (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p1_new == ~nomsg)) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~64) && 0 == ~nomsg + 1 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 14.3s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 209 SDslu, 162 SDs, 0 SdLazy, 347 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 139 NumberOfFragments, 755 HoareAnnotationTreeSize, 12 FomulaSimplifications, 4571 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 12 FomulaSimplificationsInter, 14006 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 28 QuantifiedInterpolants, 87260 SizeOfPredicates, 7 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 326/374 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_overflow.ufo.UNBOUNDED.pals.c_13.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-10-682.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c_13.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-10-682.csv Received shutdown request...