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.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:44:16,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:44:16,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:44:16,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:44:16,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:44:16,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:44:16,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:44:16,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:44:16,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:44:16,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:44:16,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:44:16,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:44:16,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:44:16,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:44:16,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:44:16,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:44:16,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:44:16,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:44:16,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:44:16,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:44:16,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:44:16,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:44:16,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:44:16,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:44:16,471 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:44:16,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:44:16,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:44:16,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:44:16,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:44:16,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:44:16,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:44:16,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:44:16,477 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:44:16,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:44:16,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:44:16,479 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:44:16,480 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-23 19:44:16,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:44:16,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:44:16,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:44:16,497 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:44:16,499 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:44:16,500 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:44:16,500 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:44:16,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:44:16,500 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:44:16,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:44:16,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:44:16,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:44:16,501 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:44:16,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:44:16,502 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:44:16,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:44:16,502 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:44:16,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:44:16,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:44:16,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:44:16,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:44:16,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:44:16,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:44:16,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:44:16,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:44:16,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:44:16,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:44:16,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:44:16,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:44:16,507 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:44:16,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:44:16,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:44:16,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:44:16,603 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:44:16,603 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:44:16,605 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.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-23 19:44:16,605 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-23 19:44:16,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:44:16,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:44:16,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:44:16,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:44:16,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:44:16,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:44:16,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:44:16,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:44:16,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:44:16,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/1) ... [2018-09-23 19:44:16,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:44:16,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:44:16,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:44:16,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:44:16,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (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-23 19:44:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 19:44:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 19:44:17,646 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 19:44:17,646 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:44:17 BoogieIcfgContainer [2018-09-23 19:44:17,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:44:17,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:44:17,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:44:17,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:44:17,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:16" (1/2) ... [2018-09-23 19:44:17,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25269c7c and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:44:17, skipping insertion in model container [2018-09-23 19:44:17,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:44:17" (2/2) ... [2018-09-23 19:44:17,654 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-23 19:44:17,664 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:44:17,675 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:44:17,722 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:44:17,723 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:44:17,723 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:44:17,724 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:44:17,724 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:44:17,724 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:44:17,724 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:44:17,724 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:44:17,724 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:44:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-23 19:44:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:17,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:17,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:17,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:17,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-23 19:44:17,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:18,035 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-23 19:44:18,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:18,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:18,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:18,060 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-23 19:44:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:18,125 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-23 19:44:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:18,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-23 19:44:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:18,139 INFO L225 Difference]: With dead ends: 57 [2018-09-23 19:44:18,139 INFO L226 Difference]: Without dead ends: 37 [2018-09-23 19:44:18,143 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-23 19:44:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-23 19:44:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-23 19:44:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-23 19:44:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-23 19:44:18,191 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-23 19:44:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:18,191 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-23 19:44:18,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-23 19:44:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:18,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:18,192 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:18,193 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:18,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-23 19:44:18,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:18,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:18,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:18,373 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-23 19:44:18,373 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:18,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:18,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:18,376 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-23 19:44:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:18,431 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-23 19:44:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:18,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-23 19:44:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:18,435 INFO L225 Difference]: With dead ends: 103 [2018-09-23 19:44:18,436 INFO L226 Difference]: Without dead ends: 69 [2018-09-23 19:44:18,437 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-23 19:44:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-23 19:44:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-23 19:44:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-23 19:44:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-23 19:44:18,457 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-23 19:44:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:18,458 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-23 19:44:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-23 19:44:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:18,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:18,459 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:18,460 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:18,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-23 19:44:18,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:18,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:18,664 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-23 19:44:18,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:18,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:44:18,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:44:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:44:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:44:18,669 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-23 19:44:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:18,956 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-23 19:44:18,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:44:18,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-23 19:44:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:18,961 INFO L225 Difference]: With dead ends: 141 [2018-09-23 19:44:18,962 INFO L226 Difference]: Without dead ends: 139 [2018-09-23 19:44:18,963 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-23 19:44:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-23 19:44:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-23 19:44:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-23 19:44:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-23 19:44:18,988 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-23 19:44:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:18,989 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-23 19:44:18,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:44:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-23 19:44:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:18,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:18,991 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:18,991 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:18,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-23 19:44:18,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:19,142 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-23 19:44:19,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:19,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:19,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:19,145 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-23 19:44:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:19,255 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-23 19:44:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:19,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-23 19:44:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:19,257 INFO L225 Difference]: With dead ends: 183 [2018-09-23 19:44:19,257 INFO L226 Difference]: Without dead ends: 109 [2018-09-23 19:44:19,261 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-23 19:44:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-23 19:44:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-23 19:44:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 19:44:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-23 19:44:19,302 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-23 19:44:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:19,303 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-23 19:44:19,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-23 19:44:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:19,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:19,305 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:19,306 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:19,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-23 19:44:19,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:19,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:19,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:19,455 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:19,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:19,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:19,457 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-23 19:44:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:19,546 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-23 19:44:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:19,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:19,549 INFO L225 Difference]: With dead ends: 321 [2018-09-23 19:44:19,549 INFO L226 Difference]: Without dead ends: 215 [2018-09-23 19:44:19,550 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-23 19:44:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-23 19:44:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-23 19:44:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-23 19:44:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-23 19:44:19,596 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-23 19:44:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:19,597 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-23 19:44:19,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-23 19:44:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:19,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:19,599 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:19,599 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:19,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-23 19:44:19,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:19,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:19,790 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:19,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:19,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:19,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:19,792 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-23 19:44:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:19,935 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-23 19:44:19,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:19,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:19,939 INFO L225 Difference]: With dead ends: 633 [2018-09-23 19:44:19,939 INFO L226 Difference]: Without dead ends: 423 [2018-09-23 19:44:19,940 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-23 19:44:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-23 19:44:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-23 19:44:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-23 19:44:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-23 19:44:20,022 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-23 19:44:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:20,023 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-23 19:44:20,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-23 19:44:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:20,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:20,026 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:20,026 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:20,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-23 19:44:20,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:20,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:20,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:20,176 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:20,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:20,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:20,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:20,178 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-23 19:44:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:20,373 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-23 19:44:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:20,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:20,379 INFO L225 Difference]: With dead ends: 1257 [2018-09-23 19:44:20,380 INFO L226 Difference]: Without dead ends: 839 [2018-09-23 19:44:20,382 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-23 19:44:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-23 19:44:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-23 19:44:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-23 19:44:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-23 19:44:20,517 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-23 19:44:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:20,517 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-23 19:44:20,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-23 19:44:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:20,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:20,521 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:20,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:20,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-23 19:44:20,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:20,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:20,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:20,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:20,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:20,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:20,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:20,668 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-23 19:44:21,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:21,014 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-23 19:44:21,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:21,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:21,024 INFO L225 Difference]: With dead ends: 2505 [2018-09-23 19:44:21,024 INFO L226 Difference]: Without dead ends: 1671 [2018-09-23 19:44:21,027 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-23 19:44:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-23 19:44:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-23 19:44:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-23 19:44:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-23 19:44:21,281 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-23 19:44:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:21,281 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-23 19:44:21,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-23 19:44:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:21,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:21,285 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:21,285 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:21,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-23 19:44:21,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:21,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:21,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:44:21,437 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-23 19:44:21,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:21,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:44:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-23 19:44:21,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:44:21,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-23 19:44:21,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:44:21,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:44:21,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:44:21,940 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-23 19:44:22,172 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-23 19:44:22,529 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:44:23,339 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-23 19:44:23,563 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-23 19:44:25,962 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-23 19:44:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:26,197 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-23 19:44:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:44:26,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-23 19:44:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:26,214 INFO L225 Difference]: With dead ends: 4801 [2018-09-23 19:44:26,215 INFO L226 Difference]: Without dead ends: 3135 [2018-09-23 19:44:26,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:44:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-23 19:44:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-23 19:44:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-23 19:44:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-23 19:44:26,649 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-23 19:44:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:26,649 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-23 19:44:26,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:44:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-23 19:44:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-23 19:44:26,655 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:26,655 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 19:44:26,656 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:26,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-23 19:44:26,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:26,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:26,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:26,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-23 19:44:26,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:26,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:26,826 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-23 19:44:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:27,442 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-23 19:44:27,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:27,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-23 19:44:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:27,454 INFO L225 Difference]: With dead ends: 4873 [2018-09-23 19:44:27,455 INFO L226 Difference]: Without dead ends: 2215 [2018-09-23 19:44:27,458 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-23 19:44:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-23 19:44:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-23 19:44:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-23 19:44:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-23 19:44:27,783 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-23 19:44:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:27,783 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-23 19:44:27,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-23 19:44:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-23 19:44:27,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:27,787 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-23 19:44:27,787 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:27,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-23 19:44:27,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:27,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:27,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:44:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-23 19:44:27,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:27,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:27,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:27,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:27,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:27,874 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-23 19:44:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:27,916 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-23 19:44:27,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:27,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-23 19:44:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:27,919 INFO L225 Difference]: With dead ends: 1799 [2018-09-23 19:44:27,919 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 19:44:27,922 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-23 19:44:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 19:44:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 19:44:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 19:44:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 19:44:27,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-23 19:44:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:27,923 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 19:44:27,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 19:44:27,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 19:44:27,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 19:44:28,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,080 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-23 19:44:28,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,390 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-23 19:44:28,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:28,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,028 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-23 19:44:29,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:29,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:30,306 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-23 19:44:31,255 WARN L178 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:31,407 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:31,740 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:32,132 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-23 19:44:32,245 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:32,353 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-23 19:44:32,559 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:32,683 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:32,842 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:33,028 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-23 19:44:33,276 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:33,280 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-23 19:44:33,280 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:33,280 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) 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-23 19:44:33,281 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-23 19:44:33,281 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-23 19:44:33,281 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-23 19:44:33,281 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-23 19:44:33,281 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:33,281 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) 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-23 19:44:33,282 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-23 19:44:33,282 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:33,282 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-23 19:44:33,282 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) 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-23 19:44:33,283 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:33,283 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) 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-23 19:44:33,283 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-23 19:44:33,284 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) 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-23 19:44:33,284 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) 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-23 19:44:33,284 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-23 19:44:33,284 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) 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-23 19:44:33,285 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) 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-23 19:44:33,300 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,302 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,304 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,305 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,307 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,308 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,309 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,310 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,311 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,312 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,313 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,314 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,315 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,316 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,317 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,318 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,319 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,320 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,323 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,324 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,325 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,327 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,329 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,329 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,331 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,331 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,333 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,339 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,341 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,341 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,342 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,346 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,346 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,348 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:44:33 BoogieIcfgContainer [2018-09-23 19:44:33,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:44:33,349 INFO L168 Benchmark]: Toolchain (without parser) took 16642.54 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 163.6 MB). Free memory was 1.5 GB in the beginning and 963.8 MB in the end (delta: 501.9 MB). Peak memory consumption was 665.5 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:33,351 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.32 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-23 19:44:33,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.00 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-23 19:44:33,352 INFO L168 Benchmark]: Boogie Preprocessor took 38.94 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-23 19:44:33,352 INFO L168 Benchmark]: RCFGBuilder took 837.08 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-23 19:44:33,353 INFO L168 Benchmark]: TraceAbstraction took 15701.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 163.6 MB). Free memory was 1.4 GB in the beginning and 978.3 MB in the end (delta: 445.1 MB). Peak memory consumption was 608.7 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:33,359 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.32 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 58.00 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 38.94 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 837.08 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 15701.17 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 163.6 MB). Free memory was 1.4 GB in the beginning and 978.3 MB in the end (delta: 445.1 MB). Peak memory consumption was 608.7 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] - 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: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-09-23 19:44:33,369 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,370 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,370 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,371 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: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-23 19:44:33,372 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,372 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,373 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,373 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: 485]: Loop Invariant [2018-09-23 19:44:33,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,374 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,375 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,375 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: 416]: Loop Invariant [2018-09-23 19:44:33,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~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))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-23 19:44:33,378 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,379 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,379 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,379 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: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-23 19:44:33,381 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,381 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,382 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,382 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: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-23 19:44:33,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,383 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,384 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,384 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: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-23 19:44:33,385 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,386 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,387 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: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-23 19:44:33,388 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,388 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,389 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,389 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~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))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-23 19:44:33,390 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,390 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,391 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:33,391 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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 15.5s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-44-33-399.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-44-33-399.csv Received shutdown request...