java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:19:26,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:19:26,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:19:26,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:19:26,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:19:26,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:19:26,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:19:26,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:19:26,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:19:26,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:19:26,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:19:26,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:19:26,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:19:26,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:19:26,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:19:26,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:19:26,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:19:26,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:19:26,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:19:26,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:19:26,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:19:26,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:19:26,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:19:26,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:19:26,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:19:26,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:19:26,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:19:26,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:19:26,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:19:26,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:19:26,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:19:26,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:19:26,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:19:26,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:19:26,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:19:26,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:19:26,925 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:26,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:19:26,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:19:26,941 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:19:26,941 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:19:26,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:19:26,942 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:19:26,942 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:19:26,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:19:26,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:19:26,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:19:26,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:19:26,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:19:26,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:19:26,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:19:26,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:19:26,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:19:26,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:19:26,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:19:26,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:19:26,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:19:26,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:19:26,945 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:19:26,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:19:26,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:19:26,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:19:26,946 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:19:26,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:19:26,946 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:19:26,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:19:26,947 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:19:27,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:19:27,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:19:27,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:19:27,030 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:19:27,030 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:19:27,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:19:27,032 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 20:19:27,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:19:27,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:19:27,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:19:27,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:19:27,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:19:27,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:19:27,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:19:27,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:19:27,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:19:27,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/1) ... [2018-09-30 20:19:27,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:19:27,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:19:27,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:19:27,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:19:27,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (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:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:19:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:19:28,019 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:19:28,020 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:19:28 BoogieIcfgContainer [2018-09-30 20:19:28,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:19:28,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:19:28,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:19:28,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:19:28,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:19:27" (1/2) ... [2018-09-30 20:19:28,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af8866 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:19:28, skipping insertion in model container [2018-09-30 20:19:28,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:19:28" (2/2) ... [2018-09-30 20:19:28,029 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:19:28,039 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:19:28,047 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:19:28,098 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:19:28,098 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:19:28,098 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:19:28,099 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:19:28,099 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:19:28,099 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:19:28,099 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:19:28,099 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:19:28,099 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:19:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 20:19:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:28,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:28,121 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:28,122 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:28,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 20:19:28,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:28,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:28,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:28,486 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:28,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:28,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:28,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:28,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:28,516 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 20:19:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:28,586 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 20:19:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:28,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:19:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:28,598 INFO L225 Difference]: With dead ends: 57 [2018-09-30 20:19:28,598 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 20:19:28,602 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:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 20:19:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 20:19:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:19:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 20:19:28,644 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 20:19:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:28,645 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 20:19:28,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 20:19:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:28,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:28,646 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:28,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:28,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 20:19:28,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:28,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:28,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:28,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:28,772 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:28,772 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:28,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:28,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:28,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:28,776 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 20:19:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:28,838 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 20:19:28,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:28,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:19:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:28,841 INFO L225 Difference]: With dead ends: 103 [2018-09-30 20:19:28,841 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 20:19:28,845 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:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 20:19:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 20:19:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 20:19:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 20:19:28,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 20:19:28,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:28,883 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 20:19:28,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 20:19:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:28,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:28,884 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:28,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:28,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 20:19:28,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:28,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:28,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:28,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:28,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:29,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:29,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:19:29,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:19:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:19:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:19:29,040 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 20:19:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:29,211 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 20:19:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:19:29,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 20:19:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:29,216 INFO L225 Difference]: With dead ends: 141 [2018-09-30 20:19:29,217 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 20:19:29,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:19:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 20:19:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 20:19:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 20:19:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 20:19:29,254 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 20:19:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:29,255 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 20:19:29,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:19:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 20:19:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:19:29,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:29,256 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:29,257 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:29,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 20:19:29,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:29,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:29,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:29,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:29,376 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:29,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:29,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:29,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:29,381 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 20:19:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:29,504 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 20:19:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:29,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:19:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:29,506 INFO L225 Difference]: With dead ends: 183 [2018-09-30 20:19:29,507 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:19:29,508 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:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:19:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 20:19:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:19:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 20:19:29,533 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 20:19:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:29,533 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 20:19:29,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 20:19:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:29,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:29,536 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:29,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:29,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 20:19:29,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:29,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:29,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:29,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:29,674 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:29,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:29,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:29,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:29,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:29,676 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 20:19:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:29,755 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 20:19:29,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:29,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:29,758 INFO L225 Difference]: With dead ends: 321 [2018-09-30 20:19:29,758 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 20:19:29,759 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:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 20:19:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 20:19:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 20:19:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 20:19:29,802 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 20:19:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:29,803 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 20:19:29,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 20:19:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:29,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:29,805 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:29,806 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:29,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 20:19:29,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:29,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:29,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:29,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:29,907 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:29,908 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:29,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:29,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:29,911 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 20:19:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:30,106 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 20:19:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:30,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:30,110 INFO L225 Difference]: With dead ends: 633 [2018-09-30 20:19:30,110 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 20:19:30,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 20:19:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 20:19:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 20:19:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 20:19:30,206 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 20:19:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 20:19:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 20:19:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:30,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:30,214 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:30,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 20:19:30,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:30,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:30,396 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:30,397 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:30,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:30,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:30,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:30,398 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 20:19:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:30,607 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 20:19:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:30,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:30,612 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 20:19:30,613 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 20:19:30,618 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:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 20:19:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 20:19:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 20:19:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 20:19:30,774 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 20:19:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:30,775 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 20:19:30,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 20:19:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:30,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:30,785 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:30,785 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:30,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 20:19:30,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:30,964 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:30,965 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:30,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:30,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:30,966 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 20:19:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:31,348 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 20:19:31,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:31,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:19:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:31,359 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 20:19:31,359 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 20:19:31,361 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:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 20:19:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 20:19:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 20:19:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 20:19:31,653 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 20:19:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:31,654 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 20:19:31,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 20:19:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:19:31,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:31,659 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:31,659 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:31,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 20:19:31,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:31,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:31,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:31,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:31,947 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:31,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:31,947 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:31,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:32,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:32,490 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:32,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:32,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 20:19:32,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:19:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:19:32,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:19:32,572 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 20:19:32,811 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 20:19:33,154 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:19:36,175 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 20:19:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:36,401 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 20:19:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:19:36,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 20:19:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:36,418 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 20:19:36,418 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 20:19:36,423 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:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 20:19:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 20:19:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 20:19:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 20:19:36,811 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 20:19:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:36,812 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 20:19:36,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:19:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 20:19:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:19:36,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:36,816 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:36,816 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:36,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 20:19:36,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:36,984 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:36,984 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:36,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:19:36,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:36,986 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 20:19:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:37,474 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 20:19:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:37,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:19:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:37,485 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 20:19:37,485 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 20:19:37,488 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,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 20:19:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 20:19:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 20:19:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 20:19:37,844 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 20:19:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:37,845 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 20:19:37,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 20:19:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:19:37,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:37,848 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:37,848 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:37,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 20:19:37,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:19:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:37,929 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:37,929 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:19:37,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:19:37,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:19:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:19:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:19:37,931 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 20:19:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:37,967 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 20:19:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:19:37,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:19:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:37,968 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 20:19:37,968 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:19:37,971 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,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:19:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:19:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:19:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:19:37,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 20:19:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:37,972 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:19:37,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:19:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:19:37,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:19:37,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:19:38,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,137 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 20:19:38,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,389 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:19:38,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:38,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,035 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:19:39,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:39,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:19:40,328 WARN L178 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:19:41,161 WARN L178 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:41,479 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:41,691 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:41,988 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:19:42,290 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:42,465 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:19:42,570 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 20:19:42,693 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:42,816 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:42,974 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:43,130 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:19:43,434 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:19:43,439 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:43,439 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:43,439 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:43,439 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:43,440 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:19:43,440 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:19:43,440 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 20:19:43,440 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:43,440 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:43,440 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:19:43,441 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:43,441 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:19:43,441 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:43,441 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:43,441 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:43,441 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:43,442 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:43,442 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:19:43,442 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 20:19:43,442 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:43,443 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:43,459 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,460 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,463 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,468 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,470 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,470 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,475 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,477 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,479 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,479 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,480 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,481 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,484 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,486 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,488 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,488 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,490 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,492 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,493 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,494 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,494 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,497 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,499 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,499 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,506 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:19:43 BoogieIcfgContainer [2018-09-30 20:19:43,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:19:43,507 INFO L168 Benchmark]: Toolchain (without parser) took 16379.36 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 204.5 MB). Free memory was 1.4 GB in the beginning and 967.3 MB in the end (delta: 475.2 MB). Peak memory consumption was 679.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:43,508 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:19:43,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:19:43,509 INFO L168 Benchmark]: Boogie Preprocessor took 37.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:19:43,510 INFO L168 Benchmark]: RCFGBuilder took 789.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:43,511 INFO L168 Benchmark]: TraceAbstraction took 15484.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 204.5 MB). Free memory was 1.4 GB in the beginning and 967.3 MB in the end (delta: 433.0 MB). Peak memory consumption was 637.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:43,515 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 789.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 15484.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 204.5 MB). Free memory was 1.4 GB in the beginning and 967.3 MB in the end (delta: 433.0 MB). Peak memory consumption was 637.4 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:43,528 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,528 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,529 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,529 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:43,531 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,531 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,532 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,532 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:43,533 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,534 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,535 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,535 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:43,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,538 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:43,541 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,543 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:43,544 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,545 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,546 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,549 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-30 20:19:43,551 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,551 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,552 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,553 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-30 20:19:43,554 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,554 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,555 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,555 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:43,557 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,557 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,559 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,559 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:43,565 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,565 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:19:43,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 15.3s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-19-43-573.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-19-43-573.csv Received shutdown request...