java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:39:23,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:39:23,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:39:23,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:39:23,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:39:23,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:39:23,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:39:23,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:39:23,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:39:23,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:39:23,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:39:23,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:39:23,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:39:23,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:39:23,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:39:23,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:39:23,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:39:23,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:39:23,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:39:23,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:39:23,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:39:23,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:39:23,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:39:23,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:39:23,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:39:23,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:39:23,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:39:23,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:39:23,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:39:23,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:39:23,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:39:23,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:39:23,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:39:23,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:39:23,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:39:23,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:39:23,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:39:23,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:39:23,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:39:23,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:39:23,586 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:39:23,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:39:23,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:39:23,587 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:39:23,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:39:23,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:39:23,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:39:23,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:39:23,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:39:23,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:39:23,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:39:23,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:39:23,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:39:23,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:39:23,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:39:23,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:39:23,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:39:23,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:39:23,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:39:23,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:39:23,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:39:23,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:39:23,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:39:23,591 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:39:23,591 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:39:23,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:39:23,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:39:23,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:39:23,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:39:23,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:39:23,665 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:39:23,666 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:39:23,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 23:39:23,667 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 23:39:23,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:39:23,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:39:23,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:39:23,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:39:23,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:39:23,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:39:23,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:39:23,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:39:23,805 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:39:23,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/1) ... [2018-09-30 23:39:23,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:39:23,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:39:23,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:39:23,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:39:23,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (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-30 23:39:23,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:39:23,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:39:24,527 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:39:24,528 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:39:24 BoogieIcfgContainer [2018-09-30 23:39:24,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:39:24,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:39:24,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:39:24,532 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:39:24,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:23" (1/2) ... [2018-09-30 23:39:24,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc96bc3 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:39:24, skipping insertion in model container [2018-09-30 23:39:24,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:39:24" (2/2) ... [2018-09-30 23:39:24,536 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 23:39:24,545 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:39:24,554 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:39:24,604 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:39:24,605 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:39:24,605 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:39:24,605 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:39:24,605 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:39:24,606 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:39:24,606 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:39:24,606 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:39:24,606 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:39:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-30 23:39:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:39:24,629 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:24,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:24,631 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:24,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-30 23:39:24,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:24,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:24,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:24,907 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-30 23:39:24,910 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:24,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:24,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:24,929 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-30 23:39:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:24,982 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-30 23:39:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:24,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 23:39:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:24,995 INFO L225 Difference]: With dead ends: 51 [2018-09-30 23:39:24,996 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 23:39:24,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 23:39:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-30 23:39:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 23:39:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-30 23:39:25,042 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-30 23:39:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:25,043 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-30 23:39:25,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-30 23:39:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:39:25,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:25,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:25,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:25,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-30 23:39:25,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:25,191 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-30 23:39:25,191 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:25,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:25,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,194 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-30 23:39:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:25,251 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-30 23:39:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:25,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 23:39:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:25,256 INFO L225 Difference]: With dead ends: 91 [2018-09-30 23:39:25,256 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 23:39:25,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 23:39:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-30 23:39:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 23:39:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-30 23:39:25,276 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-30 23:39:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:25,277 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-30 23:39:25,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-30 23:39:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:39:25,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:25,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:25,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:25,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-30 23:39:25,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:25,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:25,394 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-30 23:39:25,395 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:25,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:25,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:25,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:25,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,396 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-30 23:39:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:25,469 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-30 23:39:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:25,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 23:39:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:25,473 INFO L225 Difference]: With dead ends: 175 [2018-09-30 23:39:25,474 INFO L226 Difference]: Without dead ends: 117 [2018-09-30 23:39:25,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-30 23:39:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-30 23:39:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 23:39:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-30 23:39:25,503 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-30 23:39:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:25,504 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-30 23:39:25,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-30 23:39:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:39:25,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:25,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:25,505 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:25,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-30 23:39:25,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:25,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:25,643 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-30 23:39:25,643 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:25,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:25,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:25,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,645 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-30 23:39:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:25,713 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-30 23:39:25,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:25,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 23:39:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:25,717 INFO L225 Difference]: With dead ends: 343 [2018-09-30 23:39:25,717 INFO L226 Difference]: Without dead ends: 229 [2018-09-30 23:39:25,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-30 23:39:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-30 23:39:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-30 23:39:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-30 23:39:25,793 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-30 23:39:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:25,793 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-30 23:39:25,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-30 23:39:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:39:25,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:25,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:25,799 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:25,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:25,799 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-30 23:39:25,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:25,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:25,913 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-30 23:39:25,913 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:25,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:25,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:25,914 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-30 23:39:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:26,043 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-30 23:39:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:26,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 23:39:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:26,048 INFO L225 Difference]: With dead ends: 569 [2018-09-30 23:39:26,048 INFO L226 Difference]: Without dead ends: 343 [2018-09-30 23:39:26,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-30 23:39:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-30 23:39:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-30 23:39:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-30 23:39:26,114 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-30 23:39:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:26,115 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-30 23:39:26,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-30 23:39:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:39:26,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:26,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:26,118 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:26,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-30 23:39:26,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:26,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:26,309 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-30 23:39:26,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:26,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:39:26,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:39:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:39:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:39:26,311 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-30 23:39:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:26,509 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-30 23:39:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:39:26,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-30 23:39:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:26,519 INFO L225 Difference]: With dead ends: 610 [2018-09-30 23:39:26,519 INFO L226 Difference]: Without dead ends: 608 [2018-09-30 23:39:26,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:39:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-30 23:39:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-30 23:39:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-30 23:39:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-30 23:39:26,661 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-30 23:39:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:26,665 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-30 23:39:26,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:39:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-30 23:39:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 23:39:26,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:26,671 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] [2018-09-30 23:39:26,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:26,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-30 23:39:26,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:26,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:26,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:26,871 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:26,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:39:26,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:26,872 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-30 23:39:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:27,058 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-30 23:39:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:27,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 23:39:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:27,064 INFO L225 Difference]: With dead ends: 1113 [2018-09-30 23:39:27,065 INFO L226 Difference]: Without dead ends: 743 [2018-09-30 23:39:27,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-30 23:39:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-30 23:39:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-30 23:39:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-30 23:39:27,197 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-30 23:39:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:27,198 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-30 23:39:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-30 23:39:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 23:39:27,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:27,204 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:27,204 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:27,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-30 23:39:27,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:27,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:27,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:27,395 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-30 23:39:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:27,511 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:39:27,512 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-30 23:39:27,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:27,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:39:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:39:27,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:39:27,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 23:39:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:39:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:39:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:39:27,858 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-30 23:39:29,950 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 23:39:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:30,213 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-30 23:39:30,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:39:30,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-30 23:39:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:30,220 INFO L225 Difference]: With dead ends: 2109 [2018-09-30 23:39:30,221 INFO L226 Difference]: Without dead ends: 1371 [2018-09-30 23:39:30,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:39:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-30 23:39:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-30 23:39:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-30 23:39:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-30 23:39:30,511 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-30 23:39:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:30,511 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-30 23:39:30,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:39:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-30 23:39:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 23:39:30,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:30,516 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 23:39:30,516 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:30,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-30 23:39:30,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:30,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:30,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 23:39:30,670 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:30,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:39:30,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:30,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:30,671 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-30 23:39:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:31,027 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-30 23:39:31,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:31,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 23:39:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:31,032 INFO L225 Difference]: With dead ends: 2161 [2018-09-30 23:39:31,033 INFO L226 Difference]: Without dead ends: 975 [2018-09-30 23:39:31,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-30 23:39:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-30 23:39:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-30 23:39:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-30 23:39:31,229 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-30 23:39:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:31,230 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-30 23:39:31,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-30 23:39:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 23:39:31,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:31,232 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 23:39:31,232 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:31,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-30 23:39:31,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:31,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:31,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:39:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-30 23:39:31,309 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:31,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:31,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:31,310 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-30 23:39:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:31,328 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-30 23:39:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:31,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-30 23:39:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:31,329 INFO L225 Difference]: With dead ends: 799 [2018-09-30 23:39:31,329 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:39:31,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:39:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:39:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:39:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:39:31,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-30 23:39:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:31,332 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:39:31,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:39:31,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:39:31,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:39:31,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:31,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:32,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:39:34,130 WARN L178 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 23:39:34,382 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:39:34,845 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 23:39:35,150 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 23:39:35,449 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 23:39:35,572 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 23:39:35,770 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-30 23:39:35,911 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:39:36,197 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-30 23:39:36,430 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-30 23:39:36,565 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-30 23:39:36,679 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-30 23:39:36,682 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-30 23:39:36,683 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 23:39:36,683 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 23:39:36,683 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-30 23:39:36,683 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-30 23:39:36,684 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-30 23:39:36,684 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-30 23:39:36,684 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 23:39:36,684 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-30 23:39:36,684 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-30 23:39:36,684 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-30 23:39:36,685 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:39:36,685 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:39:36,685 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-30 23:39:36,685 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:39:36,685 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 23:39:36,685 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 23:39:36,686 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-30 23:39:36,686 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-30 23:39:36,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,705 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,725 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,728 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,728 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,730 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,730 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,732 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,732 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,734 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,735 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,737 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,737 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,741 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,741 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,743 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,743 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,747 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:39:36 BoogieIcfgContainer [2018-09-30 23:39:36,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:39:36,748 INFO L168 Benchmark]: Toolchain (without parser) took 12999.76 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 164.6 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -161.3 MB). Peak memory consumption was 618.1 MB. Max. memory is 7.1 GB. [2018-09-30 23:39:36,750 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:39:36,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.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-30 23:39:36,751 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 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-30 23:39:36,751 INFO L168 Benchmark]: RCFGBuilder took 690.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 23:39:36,756 INFO L168 Benchmark]: TraceAbstraction took 12218.48 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 164.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -203.5 MB). Peak memory consumption was 575.8 MB. Max. memory is 7.1 GB. [2018-09-30 23:39:36,761 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.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. * Boogie Preprocessor took 32.55 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 690.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12218.48 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 164.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -203.5 MB). Peak memory consumption was 575.8 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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-09-30 23:39:36,782 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,782 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,784 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,784 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-09-30 23:39:36,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,786 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,787 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,787 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-09-30 23:39:36,798 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,799 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,800 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,800 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-09-30 23:39:36,803 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,804 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,805 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-09-30 23:39:36,806 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,808 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,809 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,810 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-09-30 23:39:36,811 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,811 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,814 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,815 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant [2018-09-30 23:39:36,816 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,816 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,817 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,817 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-09-30 23:39:36,819 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,819 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,820 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:39:36,820 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 12.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred 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, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-39-36-827.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-39-36-827.csv Received shutdown request...