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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:09:22,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:09:22,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:09:22,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:09:22,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:09:22,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:09:22,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:09:22,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:09:22,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:09:22,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:09:22,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:09:22,323 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:09:22,324 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:09:22,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:09:22,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:09:22,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:09:22,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:09:22,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:09:22,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:09:22,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:09:22,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:09:22,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:09:22,343 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:09:22,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:09:22,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:09:22,344 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:09:22,345 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:09:22,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:09:22,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:09:22,351 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:09:22,352 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:09:22,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:09:22,353 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:09:22,353 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:09:22,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:09:22,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:09:22,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-28 10:09:22,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:09:22,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:09:22,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:09:22,389 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:09:22,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:09:22,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:09:22,393 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:09:22,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:09:22,394 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:09:22,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:09:22,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:09:22,394 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:09:22,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:09:22,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:09:22,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:09:22,395 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:09:22,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:09:22,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:09:22,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:09:22,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:09:22,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:09:22,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:09:22,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:09:22,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:09:22,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:09:22,399 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:09:22,399 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:09:22,399 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:09:22,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:09:22,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:09:22,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:09:22,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:09:22,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:09:22,477 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:09:22,477 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:09:22,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-09-28 10:09:22,479 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl' [2018-09-28 10:09:22,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:09:22,553 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:09:22,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:09:22,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:09:22,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:09:22,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:09:22,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:09:22,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:09:22,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:09:22,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/1) ... [2018-09-28 10:09:22,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:09:22,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:09:22,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:09:22,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:09:22,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (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-09-28 10:09:22,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:09:22,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:09:23,295 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:09:23,295 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:09:23 BoogieIcfgContainer [2018-09-28 10:09:23,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:09:23,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:09:23,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:09:23,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:09:23,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:09:22" (1/2) ... [2018-09-28 10:09:23,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bcb01d and model type pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:09:23, skipping insertion in model container [2018-09-28 10:09:23,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:09:23" (2/2) ... [2018-09-28 10:09:23,303 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl [2018-09-28 10:09:23,313 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:09:23,321 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:09:23,367 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:09:23,367 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:09:23,368 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:09:23,368 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:09:23,368 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:09:23,368 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:09:23,368 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:09:23,369 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:09:23,369 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:09:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-28 10:09:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:09:23,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:23,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:23,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:23,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-09-28 10:09:23,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:23,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:23,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:23,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:23,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:23,625 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:23,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:23,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:23,644 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-28 10:09:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:23,698 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-09-28 10:09:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:23,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-28 10:09:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:23,712 INFO L225 Difference]: With dead ends: 48 [2018-09-28 10:09:23,712 INFO L226 Difference]: Without dead ends: 31 [2018-09-28 10:09:23,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-28 10:09:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-09-28 10:09:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-28 10:09:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-09-28 10:09:23,760 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-09-28 10:09:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:23,760 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-09-28 10:09:23,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-09-28 10:09:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:09:23,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:23,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:23,762 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:23,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-09-28 10:09:23,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:23,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:23,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:23,905 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:23,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:23,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:23,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:23,908 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-09-28 10:09:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:23,949 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-09-28 10:09:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:23,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-28 10:09:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:23,951 INFO L225 Difference]: With dead ends: 85 [2018-09-28 10:09:23,952 INFO L226 Difference]: Without dead ends: 57 [2018-09-28 10:09:23,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-28 10:09:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-09-28 10:09:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-28 10:09:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-09-28 10:09:23,971 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-09-28 10:09:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:23,971 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-09-28 10:09:23,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-09-28 10:09:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:09:23,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:23,973 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:23,973 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:23,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-09-28 10:09:23,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:23,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:24,085 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:24,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:24,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:24,086 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-09-28 10:09:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:24,168 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-09-28 10:09:24,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:24,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-28 10:09:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:24,177 INFO L225 Difference]: With dead ends: 163 [2018-09-28 10:09:24,177 INFO L226 Difference]: Without dead ends: 109 [2018-09-28 10:09:24,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-28 10:09:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-28 10:09:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-28 10:09:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-09-28 10:09:24,226 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-09-28 10:09:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:24,231 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-09-28 10:09:24,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-09-28 10:09:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:09:24,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:24,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:24,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:24,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-09-28 10:09:24,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:24,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:24,359 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:24,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:09:24,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:24,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:24,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:24,361 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-09-28 10:09:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:24,467 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-09-28 10:09:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:24,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-28 10:09:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:24,470 INFO L225 Difference]: With dead ends: 269 [2018-09-28 10:09:24,470 INFO L226 Difference]: Without dead ends: 163 [2018-09-28 10:09:24,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-28 10:09:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-09-28 10:09:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-28 10:09:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-09-28 10:09:24,503 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-09-28 10:09:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:24,503 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-09-28 10:09:24,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-09-28 10:09:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 10:09:24,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:24,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:24,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:24,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-09-28 10:09:24,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:24,680 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:24,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:09:24,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:09:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:09:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-28 10:09:24,682 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-09-28 10:09:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:24,820 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-09-28 10:09:24,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:09:24,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-28 10:09:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:24,823 INFO L225 Difference]: With dead ends: 293 [2018-09-28 10:09:24,824 INFO L226 Difference]: Without dead ends: 291 [2018-09-28 10:09:24,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-28 10:09:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-28 10:09:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-09-28 10:09:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-28 10:09:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-09-28 10:09:24,867 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-09-28 10:09:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:24,868 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-09-28 10:09:24,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:09:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-09-28 10:09:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-28 10:09:24,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:24,870 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:24,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:24,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:24,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-09-28 10:09:24,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:24,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:24,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:24,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:24,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:24,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:24,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:24,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:24,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:24,994 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-09-28 10:09:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:25,104 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-09-28 10:09:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:25,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-28 10:09:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:25,109 INFO L225 Difference]: With dead ends: 525 [2018-09-28 10:09:25,109 INFO L226 Difference]: Without dead ends: 351 [2018-09-28 10:09:25,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-28 10:09:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-09-28 10:09:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-28 10:09:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-09-28 10:09:25,200 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-09-28 10:09:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:25,200 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-09-28 10:09:25,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-09-28 10:09:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-28 10:09:25,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:25,203 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:25,204 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:25,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-09-28 10:09:25,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:25,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:25,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:25,433 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-28 10:09:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:09:25,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:09:25,602 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-09-28 10:09:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:25,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:09:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-28 10:09:25,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:09:25,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-28 10:09:25,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:09:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:09:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 10:09:25,916 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-09-28 10:09:26,686 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 10:09:27,055 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-28 10:09:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:28,922 INFO L93 Difference]: Finished difference Result 827 states and 1068 transitions. [2018-09-28 10:09:28,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-28 10:09:28,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-09-28 10:09:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:28,926 INFO L225 Difference]: With dead ends: 827 [2018-09-28 10:09:28,926 INFO L226 Difference]: Without dead ends: 481 [2018-09-28 10:09:28,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-28 10:09:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-28 10:09:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 307. [2018-09-28 10:09:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-28 10:09:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2018-09-28 10:09:29,013 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 28 [2018-09-28 10:09:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:29,014 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2018-09-28 10:09:29,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:09:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2018-09-28 10:09:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-28 10:09:29,017 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:09:29,017 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-28 10:09:29,018 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:09:29,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 10:09:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2104861015, now seen corresponding path program 2 times [2018-09-28 10:09:29,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:09:29,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:09:29,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:29,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:09:29,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:09:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:09:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-09-28 10:09:29,127 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:09:29,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:09:29,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:09:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:09:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:29,128 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand 3 states. [2018-09-28 10:09:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:09:29,175 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2018-09-28 10:09:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:09:29,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-09-28 10:09:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:09:29,176 INFO L225 Difference]: With dead ends: 357 [2018-09-28 10:09:29,177 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:09:29,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-28 10:09:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:09:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:09:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:09:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:09:29,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-09-28 10:09:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:09:29,179 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:09:29,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:09:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:09:29,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:09:29,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:09:29,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:29,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:09:30,584 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-28 10:09:31,394 WARN L178 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-09-28 10:09:31,732 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-28 10:09:31,893 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-28 10:09:32,431 WARN L178 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-09-28 10:09:32,947 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-28 10:09:32,950 INFO L422 ceAbstractionStarter]: At program point L254(lines 254 264) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-28 10:09:32,951 INFO L422 ceAbstractionStarter]: At program point L349(lines 344 350) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-28 10:09:32,951 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 370) no Hoare annotation was computed. [2018-09-28 10:09:32,951 INFO L422 ceAbstractionStarter]: At program point L271(lines 263 272) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-28 10:09:32,951 INFO L422 ceAbstractionStarter]: At program point L329(lines 329 335) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-28 10:09:32,951 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 371) no Hoare annotation was computed. [2018-09-28 10:09:32,951 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 371) no Hoare annotation was computed. [2018-09-28 10:09:32,952 INFO L422 ceAbstractionStarter]: At program point L276(lines 276 286) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-28 10:09:32,952 INFO L422 ceAbstractionStarter]: At program point L338(lines 334 345) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-28 10:09:32,952 INFO L422 ceAbstractionStarter]: At program point L231(lines 231 242) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:09:32,952 INFO L422 ceAbstractionStarter]: At program point L359(lines 359 366) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-28 10:09:32,952 INFO L422 ceAbstractionStarter]: At program point L293(lines 285 294) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-09-28 10:09:32,952 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 371) no Hoare annotation was computed. [2018-09-28 10:09:32,953 INFO L422 ceAbstractionStarter]: At program point L368(lines 224 368) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse3) (and (<= 1 ~mode4) .cse0 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~mode4 1) .cse1 .cse2 .cse3 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:09:32,953 INFO L422 ceAbstractionStarter]: At program point L298(lines 298 309) the Hoare annotation is: (let ((.cse3 (exists ((v_~r1_9 Int)) (let ((.cse13 (mod v_~r1_9 256))) (and (= (+ .cse13 1) ~r1) (<= .cse13 0))))) (.cse4 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse1 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse9 (= ULTIMATE.start_assert_~arg 1)) (.cse0 (<= 1 ~mode4)) (.cse10 (<= 1 ULTIMATE.start_check_~tmp~85)) (.cse5 (<= ~mode4 1)) (.cse8 (not (= ~p3_old ~nomsg))) (.cse2 (<= ~send3 127)) (.cse11 (not (= ~p3_new ~nomsg))) (.cse6 (= 0 (+ ~nomsg 1))) (.cse12 (<= ~r1 (* 256 (div ~r1 256)))) (.cse7 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse3 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (and .cse2 .cse1 .cse9 .cse0 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse2 .cse11 .cse6 .cse12 (= ~mode4 (* 256 (div ~mode4 256))) .cse7))) [2018-09-28 10:09:32,953 INFO L422 ceAbstractionStarter]: At program point L315(lines 308 316) the Hoare annotation is: (and (<= 1 ~mode4) (<= ~send3 127) (<= ~mode4 1) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= 0 ~send3)) [2018-09-28 10:09:32,953 INFO L422 ceAbstractionStarter]: At program point L249(lines 241 250) the Hoare annotation is: (let ((.cse4 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256))) .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse7 (mod v_~r1_9 256))) (and (= (+ .cse7 1) ~r1) (<= .cse7 0)))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse5 .cse6))) [2018-09-28 10:09:32,953 INFO L422 ceAbstractionStarter]: At program point L365(lines 365 369) the Hoare annotation is: false [2018-09-28 10:09:32,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:32,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,035 INFO L202 PluginConnector]: Adding new model pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:09:33 BoogieIcfgContainer [2018-09-28 10:09:33,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:09:33,036 INFO L168 Benchmark]: Toolchain (without parser) took 10486.15 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.8 MB). Peak memory consumption was 489.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:33,038 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.78 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-09-28 10:09:33,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.25 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-09-28 10:09:33,039 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 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-09-28 10:09:33,040 INFO L168 Benchmark]: RCFGBuilder took 650.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:33,040 INFO L168 Benchmark]: TraceAbstraction took 9739.18 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.1 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. [2018-09-28 10:09:33,045 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.78 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 Procedure Inliner took 48.25 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 41.56 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 650.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9739.18 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 24.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.1 MB). Peak memory consumption was 458.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 370]: 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: 263]: Loop Invariant [2018-09-28 10:09:33,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 285]: Loop Invariant [2018-09-28 10:09:33,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 254]: Loop Invariant [2018-09-28 10:09:33,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 276]: Loop Invariant [2018-09-28 10:09:33,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 298]: Loop Invariant [2018-09-28 10:09:33,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((((1 <= ~mode4 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode4) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && assert_~arg == 1) && 1 <= ~mode4) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((1 <= ~mode4 && ~send3 <= 127) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((1 <= ~mode4 && ~send3 <= 127) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || ((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 241]: Loop Invariant [2018-09-28 10:09:33,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:09:33,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((1 <= ~mode4 && ~send3 <= 127) && assert_~arg == 1) && 1 <= check_~tmp~85) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~send3 <= 127 && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || (((((((1 <= ~mode4 && ~send3 <= 127) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 9.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 179 SDslu, 174 SDs, 0 SdLazy, 208 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 298 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 72 NumberOfFragments, 1161 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5056 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 439 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 8 QuantifiedInterpolants, 21881 SizeOfPredicates, 1 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 101/117 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.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-09-33-078.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-09-33-078.csv Received shutdown request...