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.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:19:34,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:19:34,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:19:34,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:19:34,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:19:34,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:19:34,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:19:34,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:19:34,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:19:34,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:19:34,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:19:34,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:19:34,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:19:34,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:19:34,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:19:34,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:19:34,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:19:34,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:19:34,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:19:34,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:19:34,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:19:34,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:19:34,818 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:19:34,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:19:34,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:19:34,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:19:34,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:19:34,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:19:34,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:19:34,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:19:34,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:19:34,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:19:34,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:19:34,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:19:34,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:19:34,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:19:34,832 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:19:34,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:19:34,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:19:34,862 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:19:34,862 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:19:34,863 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:19:34,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:19:34,863 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:19:34,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:19:34,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:19:34,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:19:34,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:19:34,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:19:34,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:19:34,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:19:34,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:19:34,865 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:19:34,865 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:19:34,865 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:19:34,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:19:34,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:19:34,866 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:19:34,866 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:19:34,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:19:34,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:19:34,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:19:34,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:19:34,867 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:19:34,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:19:34,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:19:34,867 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:19:34,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:19:34,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:19:34,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:19:34,927 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:19:34,928 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:19:34,929 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.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:19:34,929 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 20:19:35,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:19:35,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:19:35,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:19:35,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:19:35,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:19:35,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:19:35,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:19:35,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:19:35,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:19:35,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... [2018-09-30 20:19:35,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:19:35,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:19:35,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:19:35,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:19:35,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:19:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:19:35,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:19:35,925 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:19:35,925 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:19:35 BoogieIcfgContainer [2018-09-30 20:19:35,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:19:35,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:19:35,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:19:35,929 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:19:35,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:35" (1/2) ... [2018-09-30 20:19:35,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9ce3ab and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:19:35, skipping insertion in model container [2018-09-30 20:19:35,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:19:35" (2/2) ... [2018-09-30 20:19:35,933 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:19:35,942 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:19:35,954 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:19:35,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:19:36,000 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:19:36,000 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:19:36,000 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:19:36,001 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:19:36,001 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:19:36,001 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:19:36,001 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:19:36,001 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:19:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 20:19:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:36,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:36,024 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-30 20:19:36,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:36,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 20:19:36,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:36,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:36,321 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:36,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:36,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:36,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:36,342 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 20:19:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:36,402 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 20:19:36,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:36,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:19:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:36,413 INFO L225 Difference]: With dead ends: 57 [2018-09-30 20:19:36,414 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 20:19:36,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 20:19:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 20:19:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:19:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 20:19:36,464 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 20:19:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:36,465 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 20:19:36,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 20:19:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:36,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:36,466 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-30 20:19:36,466 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:36,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 20:19:36,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:36,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:36,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:36,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:36,589 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 20:19:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:36,638 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 20:19:36,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:36,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:19:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:36,642 INFO L225 Difference]: With dead ends: 103 [2018-09-30 20:19:36,642 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 20:19:36,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 20:19:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 20:19:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 20:19:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 20:19:36,664 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 20:19:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:36,664 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 20:19:36,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 20:19:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:36,665 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:36,666 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-30 20:19:36,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:36,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 20:19:36,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:36,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:36,809 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:36,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:19:36,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:19:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:19:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:19:36,811 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 20:19:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:37,009 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 20:19:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:19:37,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 20:19:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:37,021 INFO L225 Difference]: With dead ends: 141 [2018-09-30 20:19:37,021 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 20:19:37,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:19:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 20:19:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 20:19:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 20:19:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 20:19:37,069 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 20:19:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:37,069 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 20:19:37,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:19:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 20:19:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:37,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:37,070 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-30 20:19:37,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:37,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 20:19:37,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:37,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:37,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:37,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:37,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:37,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,169 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 20:19:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:37,235 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 20:19:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:37,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:19:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:37,238 INFO L225 Difference]: With dead ends: 183 [2018-09-30 20:19:37,238 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:19:37,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:19:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 20:19:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:19:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 20:19:37,262 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 20:19:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:37,262 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 20:19:37,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 20:19:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:37,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:37,264 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-30 20:19:37,265 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:37,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:37,265 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 20:19:37,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:37,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:37,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:37,394 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-30 20:19:37,394 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:37,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:37,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,398 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 20:19:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:37,515 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 20:19:37,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:37,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:37,519 INFO L225 Difference]: With dead ends: 321 [2018-09-30 20:19:37,519 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 20:19:37,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 20:19:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 20:19:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 20:19:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 20:19:37,571 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 20:19:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:37,572 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 20:19:37,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 20:19:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:37,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:37,574 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-30 20:19:37,574 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:37,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 20:19:37,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:37,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:37,772 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-30 20:19:37,772 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:37,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:37,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,774 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 20:19:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:37,885 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 20:19:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:37,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:37,890 INFO L225 Difference]: With dead ends: 633 [2018-09-30 20:19:37,891 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 20:19:37,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 20:19:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 20:19:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 20:19:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 20:19:37,961 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 20:19:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:37,962 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 20:19:37,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 20:19:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:37,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:37,965 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-30 20:19:37,965 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:37,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:37,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 20:19:37,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:37,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:37,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:37,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:38,115 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-30 20:19:38,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:38,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:38,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:38,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:38,117 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 20:19:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:38,296 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 20:19:38,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:38,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:38,302 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 20:19:38,303 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 20:19:38,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 20:19:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 20:19:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 20:19:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 20:19:38,437 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 20:19:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:38,439 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 20:19:38,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 20:19:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:38,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:38,444 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-30 20:19:38,445 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:38,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 20:19:38,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:38,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:38,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:38,540 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-30 20:19:38,541 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:38,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:38,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:38,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:38,542 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 20:19:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:38,851 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 20:19:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:38,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:38,861 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 20:19:38,861 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 20:19:38,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 20:19:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 20:19:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 20:19:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 20:19:39,150 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 20:19:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:39,151 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 20:19:39,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 20:19:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:39,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:39,158 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-30 20:19:39,158 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:39,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:39,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 20:19:39,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:39,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:39,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:39,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:39,453 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-30 20:19:39,453 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:39,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:39,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:39,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:39,918 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-30 20:19:39,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:39,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 20:19:39,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:19:39,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:19:39,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:19:39,982 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 20:19:40,275 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:19:40,967 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 20:19:41,181 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 20:19:41,581 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 20:19:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:43,634 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 20:19:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:19:43,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 20:19:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:43,649 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 20:19:43,650 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 20:19:43,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:19:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 20:19:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 20:19:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 20:19:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 20:19:44,039 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 20:19:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:44,039 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 20:19:44,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:19:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 20:19:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:19:44,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:44,044 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-30 20:19:44,044 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:44,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 20:19:44,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:44,201 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-30 20:19:44,201 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:44,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:44,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:44,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:44,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:44,203 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 20:19:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:44,731 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 20:19:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:44,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:19:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:44,742 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 20:19:44,742 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 20:19:44,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 20:19:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 20:19:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 20:19:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 20:19:45,041 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 20:19:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:45,041 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 20:19:45,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 20:19:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:19:45,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:45,045 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-30 20:19:45,045 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:45,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 20:19:45,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:45,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:45,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:19:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:45,121 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-30 20:19:45,122 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:45,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:45,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:45,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:45,123 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 20:19:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:45,161 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 20:19:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:45,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:19:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:45,162 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 20:19:45,162 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:19:45,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:19:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:19:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:19:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:19:45,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 20:19:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:45,166 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:19:45,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:19:45,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:19:45,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:19:45,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,290 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 20:19:45,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,566 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:19:45,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:45,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,189 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:19:46,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:46,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:47,513 WARN L178 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:19:48,094 WARN L178 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:48,323 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:48,572 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:48,863 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:19:49,018 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:49,302 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:49,444 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:49,629 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:49,791 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:19:50,047 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:50,051 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-30 20:19:50,051 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-30 20:19:50,051 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-30 20:19:50,054 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-30 20:19:50,054 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:19:50,054 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:19:50,055 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 20:19:50,055 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-30 20:19:50,055 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-30 20:19:50,055 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:19:50,056 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-30 20:19:50,056 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:19:50,056 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-30 20:19:50,056 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 20:19:50,057 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-30 20:19:50,057 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-30 20:19:50,057 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-30 20:19:50,057 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-30 20:19:50,058 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 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:19:50,058 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-30 20:19:50,058 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-30 20:19:50,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,118 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,118 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,136 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,140 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,144 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,153 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:19:50 BoogieIcfgContainer [2018-09-30 20:19:50,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:19:50,154 INFO L168 Benchmark]: Toolchain (without parser) took 15141.37 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 159.9 MB). Free memory was 1.5 GB in the beginning and 949.2 MB in the end (delta: 522.3 MB). Peak memory consumption was 682.2 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:50,156 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:19:50,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:19:50,157 INFO L168 Benchmark]: Boogie Preprocessor took 69.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:19:50,158 INFO L168 Benchmark]: RCFGBuilder took 775.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:50,159 INFO L168 Benchmark]: TraceAbstraction took 14227.28 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 159.9 MB). Free memory was 1.4 GB in the beginning and 949.2 MB in the end (delta: 480.0 MB). Peak memory consumption was 639.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:50,163 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.22 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 62.83 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 69.67 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 775.61 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 14227.28 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 159.9 MB). Free memory was 1.4 GB in the beginning and 949.2 MB in the end (delta: 480.0 MB). Peak memory consumption was 639.9 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-30 20:19:50,173 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,175 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-30 20:19:50,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,177 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-30 20:19:50,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,179 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-30 20:19:50,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,181 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-30 20:19:50,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,183 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-30 20:19:50,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,186 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 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-30 20:19:50,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,188 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 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-30 20:19:50,189 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,190 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,190 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,191 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-30 20:19:50,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,193 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-30 20:19:50,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:50,195 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, 14.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s 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, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s 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.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-19-50-201.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-19-50-201.csv Received shutdown request...