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.6.ufo.UNBOUNDED.pals.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:37:00,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:37:00,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:37:00,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:37:00,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:37:00,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:37:00,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:37:00,526 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:37:00,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:37:00,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:37:00,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:37:00,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:37:00,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:37:00,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:37:00,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:37:00,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:37:00,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:37:00,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:37:00,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:37:00,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:37:00,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:37:00,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:37:00,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:37:00,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:37:00,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:37:00,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:37:00,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:37:00,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:37:00,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:37:00,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:37:00,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:37:00,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:37:00,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:37:00,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:37:00,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:37:00,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:37:00,576 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-09-28 10:37:00,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:37:00,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:37:00,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:37:00,601 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:37:00,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:37:00,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:37:00,602 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:37:00,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:37:00,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:37:00,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:37:00,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:37:00,604 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:37:00,605 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:37:00,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:37:00,605 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:37:00,605 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:37:00,605 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:37:00,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:37:00,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:37:00,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:37:00,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:37:00,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:37:00,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:37:00,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:37:00,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:37:00,608 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:37:00,608 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:37:00,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:37:00,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:37:00,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:37:00,609 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-28 10:37:00,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:37:00,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:37:00,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:37:00,700 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:37:00,700 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:37:00,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-09-28 10:37:00,701 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl' [2018-09-28 10:37:00,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:37:00,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:37:00,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:37:00,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:37:00,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:37:00,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:37:00,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:37:00,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:37:00,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:37:00,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/1) ... [2018-09-28 10:37:00,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:37:00,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:37:00,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:37:00,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:37:00,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (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:37:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:37:01,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:37:01,659 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:37:01,660 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:37:01 BoogieIcfgContainer [2018-09-28 10:37:01,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:37:01,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:37:01,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:37:01,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:37:01,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:37:00" (1/2) ... [2018-09-28 10:37:01,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c55fd6 and model type pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:37:01, skipping insertion in model container [2018-09-28 10:37:01,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:37:01" (2/2) ... [2018-09-28 10:37:01,668 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-09-28 10:37:01,678 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:37:01,687 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:37:01,736 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:37:01,737 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:37:01,737 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:37:01,737 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:37:01,738 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:37:01,738 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:37:01,738 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:37:01,738 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:37:01,738 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:37:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-28 10:37:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-28 10:37:01,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:01,764 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:01,765 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:01,773 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-09-28 10:37:01,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:01,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:01,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:01,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:02,063 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:37:02,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:02,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:02,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:02,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:02,092 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-09-28 10:37:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:02,240 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-09-28 10:37:02,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:02,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-28 10:37:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:02,255 INFO L225 Difference]: With dead ends: 60 [2018-09-28 10:37:02,256 INFO L226 Difference]: Without dead ends: 39 [2018-09-28 10:37:02,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-28 10:37:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-09-28 10:37:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-28 10:37:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-09-28 10:37:02,309 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-09-28 10:37:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:02,309 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-09-28 10:37:02,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-09-28 10:37:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-28 10:37:02,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:02,311 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:02,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:02,311 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-09-28 10:37:02,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:02,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:02,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:02,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:02,454 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:37:02,455 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:02,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:02,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:02,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:02,457 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-09-28 10:37:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:02,583 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-09-28 10:37:02,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:02,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-28 10:37:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:02,586 INFO L225 Difference]: With dead ends: 109 [2018-09-28 10:37:02,586 INFO L226 Difference]: Without dead ends: 73 [2018-09-28 10:37:02,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-28 10:37:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-09-28 10:37:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-28 10:37:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-09-28 10:37:02,607 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-09-28 10:37:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:02,608 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-09-28 10:37:02,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-09-28 10:37:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-28 10:37:02,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:02,610 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:02,610 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:02,611 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-09-28 10:37:02,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:02,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:02,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:02,779 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:37:02,779 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:02,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:02,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:02,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:02,781 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-09-28 10:37:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:02,903 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-09-28 10:37:02,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:02,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-28 10:37:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:02,909 INFO L225 Difference]: With dead ends: 211 [2018-09-28 10:37:02,909 INFO L226 Difference]: Without dead ends: 141 [2018-09-28 10:37:02,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-28 10:37:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-09-28 10:37:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-28 10:37:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-09-28 10:37:02,946 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-09-28 10:37:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:02,946 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-09-28 10:37:02,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-09-28 10:37:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-28 10:37:02,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:02,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:02,948 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:02,948 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-09-28 10:37:02,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:02,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:02,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:03,090 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:37:03,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:03,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:03,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:03,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:03,092 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:03,092 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-09-28 10:37:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:03,320 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-09-28 10:37:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:03,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-28 10:37:03,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:03,329 INFO L225 Difference]: With dead ends: 349 [2018-09-28 10:37:03,330 INFO L226 Difference]: Without dead ends: 211 [2018-09-28 10:37:03,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-28 10:37:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-09-28 10:37:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-28 10:37:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-09-28 10:37:03,372 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-09-28 10:37:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:03,372 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-09-28 10:37:03,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-09-28 10:37:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-28 10:37:03,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:03,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:03,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:03,374 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-09-28 10:37:03,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:03,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:03,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:03,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:03,505 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:37:03,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:03,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:37:03,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:37:03,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:37:03,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:03,507 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-09-28 10:37:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:03,746 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-09-28 10:37:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:37:03,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-09-28 10:37:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:03,750 INFO L225 Difference]: With dead ends: 377 [2018-09-28 10:37:03,750 INFO L226 Difference]: Without dead ends: 375 [2018-09-28 10:37:03,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-28 10:37:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-09-28 10:37:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-28 10:37:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-09-28 10:37:03,816 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-09-28 10:37:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:03,816 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-09-28 10:37:03,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:37:03,816 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-09-28 10:37:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-28 10:37:03,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:03,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:37:03,819 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:03,819 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-09-28 10:37:03,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:03,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:03,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:03,938 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:03,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:03,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:03,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:03,939 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-09-28 10:37:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:04,105 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-09-28 10:37:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:04,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-28 10:37:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:04,110 INFO L225 Difference]: With dead ends: 669 [2018-09-28 10:37:04,110 INFO L226 Difference]: Without dead ends: 447 [2018-09-28 10:37:04,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-28 10:37:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-09-28 10:37:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-28 10:37:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-09-28 10:37:04,195 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-09-28 10:37:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:04,196 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-09-28 10:37:04,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-09-28 10:37:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-28 10:37:04,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:04,199 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:37:04,201 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:04,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-09-28 10:37:04,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:04,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:04,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:04,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:04,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:04,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:04,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:04,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:04,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:04,348 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:04,348 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-09-28 10:37:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:04,755 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-09-28 10:37:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:04,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-28 10:37:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:04,762 INFO L225 Difference]: With dead ends: 1329 [2018-09-28 10:37:04,762 INFO L226 Difference]: Without dead ends: 887 [2018-09-28 10:37:04,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-09-28 10:37:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-09-28 10:37:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-09-28 10:37:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-09-28 10:37:04,907 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-09-28 10:37:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:04,908 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-09-28 10:37:04,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-09-28 10:37:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-28 10:37:04,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:04,921 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:04,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:04,922 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-09-28 10:37:04,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:04,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:05,051 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:05,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:37:05,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:05,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:05,052 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-09-28 10:37:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:05,581 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-09-28 10:37:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:05,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-28 10:37:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:05,592 INFO L225 Difference]: With dead ends: 2649 [2018-09-28 10:37:05,592 INFO L226 Difference]: Without dead ends: 1767 [2018-09-28 10:37:05,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-09-28 10:37:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-09-28 10:37:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-09-28 10:37:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-09-28 10:37:05,901 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-09-28 10:37:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:05,902 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-09-28 10:37:05,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-09-28 10:37:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-28 10:37:05,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:05,905 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:37:05,905 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:05,906 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-09-28 10:37:05,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:05,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:37:06,294 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:37:06,294 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:37:06,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:06,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:37:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-28 10:37:07,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:37:07,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-28 10:37:07,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:37:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:37:07,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:07,332 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-09-28 10:37:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:12,948 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-09-28 10:37:12,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-28 10:37:12,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-09-28 10:37:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:12,957 INFO L225 Difference]: With dead ends: 4087 [2018-09-28 10:37:12,957 INFO L226 Difference]: Without dead ends: 1617 [2018-09-28 10:37:12,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-09-28 10:37:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-09-28 10:37:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-09-28 10:37:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-09-28 10:37:13,198 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-09-28 10:37:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:13,198 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-09-28 10:37:13,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:37:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-09-28 10:37:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-28 10:37:13,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:37:13,201 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-28 10:37:13,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:37:13,202 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:37:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-09-28 10:37:13,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:37:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:37:13,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:13,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:37:13,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:37:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:37:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-28 10:37:13,295 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:37:13,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:37:13,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:37:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:37:13,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:37:13,296 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-09-28 10:37:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:37:13,330 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-09-28 10:37:13,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:37:13,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-09-28 10:37:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:37:13,331 INFO L225 Difference]: With dead ends: 1464 [2018-09-28 10:37:13,331 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:37:13,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:37:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:37:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:37:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:37:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:37:13,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-09-28 10:37:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:37:13,335 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:37:13,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:37:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:37:13,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:37:13,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:37:13,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:13,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:37:15,062 WARN L178 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-28 10:37:15,286 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-28 10:37:15,729 WARN L178 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:37:15,948 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-28 10:37:16,922 WARN L178 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-28 10:37:17,545 WARN L178 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-09-28 10:37:17,992 WARN L178 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-09-28 10:37:18,136 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:37:18,286 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:37:18,398 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-09-28 10:37:18,598 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-28 10:37:18,895 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-09-28 10:37:19,068 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-09-28 10:37:19,172 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-09-28 10:37:19,173 INFO L422 ceAbstractionStarter]: At program point L440(lines 440 450) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-09-28 10:37:19,173 INFO L422 ceAbstractionStarter]: At program point L374(lines 374 384) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:37:19,174 INFO L422 ceAbstractionStarter]: At program point L457(lines 449 458) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-09-28 10:37:19,174 INFO L422 ceAbstractionStarter]: At program point L391(lines 383 392) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse4 .cse5))) [2018-09-28 10:37:19,174 INFO L422 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-09-28 10:37:19,174 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-09-28 10:37:19,174 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-09-28 10:37:19,174 INFO L422 ceAbstractionStarter]: At program point L495(lines 490 496) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-28 10:37:19,175 INFO L422 ceAbstractionStarter]: At program point L396(lines 396 406) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode4)) (.cse7 (<= ~mode4 1)) (.cse9 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse0 (<= ~send3 127)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse6 (= ~mode3 (* 256 (div ~mode3 256))) .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse4 .cse5))) [2018-09-28 10:37:19,175 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-09-28 10:37:19,175 INFO L422 ceAbstractionStarter]: At program point L413(lines 405 414) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~132) .cse5 .cse8 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6))) [2018-09-28 10:37:19,175 INFO L422 ceAbstractionStarter]: At program point L347(lines 339 348) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:37:19,175 INFO L422 ceAbstractionStarter]: At program point L475(lines 475 481) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-09-28 10:37:19,176 INFO L422 ceAbstractionStarter]: At program point L484(lines 480 491) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~r1 (* 256 (div ~r1 256))) .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-09-28 10:37:19,176 INFO L422 ceAbstractionStarter]: At program point L418(lines 418 428) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse8 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~132) .cse5 .cse8 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6))) [2018-09-28 10:37:19,176 INFO L422 ceAbstractionStarter]: At program point L352(lines 352 362) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:37:19,176 INFO L422 ceAbstractionStarter]: At program point L505(lines 505 512) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-09-28 10:37:19,176 INFO L422 ceAbstractionStarter]: At program point L435(lines 427 436) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse3 (<= ~mode4 1)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse2 (mod v_~r1_9 256))) (and (= (+ .cse2 1) ~r1) (<= .cse2 0)))) .cse3 .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-09-28 10:37:19,177 INFO L422 ceAbstractionStarter]: At program point L369(lines 361 370) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:37:19,177 INFO L422 ceAbstractionStarter]: At program point L328(lines 328 340) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:37:19,177 INFO L422 ceAbstractionStarter]: At program point L514(lines 321 514) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-09-28 10:37:19,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,204 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,208 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,209 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,214 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,215 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,217 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,224 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,233 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:37:19 BoogieIcfgContainer [2018-09-28 10:37:19,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:37:19,234 INFO L168 Benchmark]: Toolchain (without parser) took 18403.98 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 222.3 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -24.3 MB). Peak memory consumption was 642.1 MB. Max. memory is 7.1 GB. [2018-09-28 10:37:19,236 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:37:19,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.42 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:37:19,237 INFO L168 Benchmark]: Boogie Preprocessor took 49.35 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:37:19,237 INFO L168 Benchmark]: RCFGBuilder took 718.84 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-28 10:37:19,238 INFO L168 Benchmark]: TraceAbstraction took 17572.18 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 222.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.1 MB). Peak memory consumption was 589.2 MB. Max. memory is 7.1 GB. [2018-09-28 10:37:19,243 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.42 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 49.35 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 718.84 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17572.18 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 222.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.1 MB). Peak memory consumption was 589.2 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] - 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: 516]: 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: 480]: Loop Invariant [2018-09-28 10:37:19,261 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,262 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,266 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 440]: Loop Invariant [2018-09-28 10:37:19,267 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,268 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,271 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant [2018-09-28 10:37:19,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,275 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,276 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 396]: Loop Invariant [2018-09-28 10:37:19,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,277 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,278 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 449]: Loop Invariant [2018-09-28 10:37:19,280 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,281 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,287 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 427]: Loop Invariant [2018-09-28 10:37:19,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,288 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,289 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 405]: Loop Invariant [2018-09-28 10:37:19,293 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,294 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,296 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,297 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~send3 <= 127 && 1 <= ~mode4) && assert_~arg == 1) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 383]: Loop Invariant [2018-09-28 10:37:19,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,298 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,303 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 475]: Loop Invariant [2018-09-28 10:37:19,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-09-28 10:37:19,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1765occurred in iteration=8, 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 738 NumberOfFragments, 1408 HoareAnnotationTreeSize, 18 FomulaSimplifications, 41599 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 18 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 334 ConstructedInterpolants, 12 QuantifiedInterpolants, 42481 SizeOfPredicates, 1 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 167/187 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.6.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-37-19-311.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-37-19-311.csv Received shutdown request...