java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:52:39,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:52:39,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:52:39,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:52:39,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:52:39,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:52:39,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:52:39,902 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:52:39,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:52:39,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:52:39,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:52:39,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:52:39,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:52:39,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:52:39,909 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:52:39,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:52:39,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:52:39,912 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:52:39,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:52:39,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:52:39,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:52:39,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:52:39,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:52:39,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:52:39,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:52:39,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:52:39,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:52:39,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:52:39,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:52:39,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:52:39,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:52:39,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:52:39,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:52:39,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:52:39,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:52:39,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:52:39,933 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:52:39,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:52:39,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:52:39,956 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:52:39,956 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:52:39,957 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:52:39,957 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:52:39,957 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:52:39,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:52:39,958 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:52:39,958 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:52:39,958 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:52:39,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:52:39,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:52:39,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:52:39,962 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:52:39,962 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:52:39,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:52:39,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:52:39,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:52:39,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:52:39,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:52:39,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:52:39,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:52:39,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:52:39,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:52:39,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:52:39,964 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:52:39,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:52:39,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:52:39,965 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:52:39,965 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:52:40,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:52:40,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:52:40,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:52:40,034 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:52:40,035 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:52:40,036 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-26 21:52:40,036 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-26 21:52:40,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:52:40,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:52:40,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:52:40,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:52:40,145 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:52:40,164 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,182 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:52:40,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:52:40,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:52:40,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:52:40,204 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,205 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,208 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,209 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,219 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,225 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,232 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 26.09 09:52:40" (1/1) ... [2018-09-26 21:52:40,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:52:40,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:52:40,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:52:40,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:52:40,244 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 26.09 09:52:40" (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-26 21:52:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:52:40,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:52:41,140 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:52:41,141 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 26.09 09:52:41 BoogieIcfgContainer [2018-09-26 21:52:41,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:52:41,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:52:41,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:52:41,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:52:41,146 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 26.09 09:52:40" (1/2) ... [2018-09-26 21:52:41,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d51627 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 26.09 09:52:41, skipping insertion in model container [2018-09-26 21:52:41,147 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 26.09 09:52:41" (2/2) ... [2018-09-26 21:52:41,149 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-26 21:52:41,160 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:52:41,169 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:52:41,221 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:52:41,222 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:52:41,222 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:52:41,222 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:52:41,223 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:52:41,223 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:52:41,223 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:52:41,223 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:52:41,223 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:52:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-26 21:52:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:41,246 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:41,247 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-26 21:52:41,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:41,256 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-26 21:52:41,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:41,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:41,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:41,614 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-26 21:52:41,616 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:41,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:41,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:41,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:41,642 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-26 21:52:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:41,829 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-26 21:52:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:41,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:52:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:41,842 INFO L225 Difference]: With dead ends: 57 [2018-09-26 21:52:41,843 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:52:41,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:52:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-26 21:52:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:52:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-26 21:52:41,890 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-26 21:52:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:41,891 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-26 21:52:41,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-26 21:52:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:41,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:41,892 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-26 21:52:41,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:41,893 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-26 21:52:41,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:41,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:41,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:41,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:42,018 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-26 21:52:42,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:42,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:42,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:42,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:42,022 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-26 21:52:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:42,073 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-26 21:52:42,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:42,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:52:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:42,075 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:52:42,076 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:52:42,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:52:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-26 21:52:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 21:52:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-26 21:52:42,113 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-26 21:52:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:42,115 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-26 21:52:42,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-26 21:52:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:42,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:42,117 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-26 21:52:42,117 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:42,117 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:42,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-26 21:52:42,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:42,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:42,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:42,299 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-26 21:52:42,300 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:42,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:52:42,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:52:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:52:42,302 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:42,303 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-26 21:52:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:42,763 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-26 21:52:42,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:52:42,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-26 21:52:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:42,776 INFO L225 Difference]: With dead ends: 141 [2018-09-26 21:52:42,776 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 21:52:42,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 21:52:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-26 21:52:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 21:52:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-26 21:52:42,822 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-26 21:52:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:42,822 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-26 21:52:42,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:52:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-26 21:52:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:52:42,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:42,824 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-26 21:52:42,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:42,825 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-26 21:52:42,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:42,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:42,949 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-26 21:52:42,949 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:42,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:42,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:42,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:42,951 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-26 21:52:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:43,055 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-26 21:52:43,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:43,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:52:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:43,063 INFO L225 Difference]: With dead ends: 183 [2018-09-26 21:52:43,063 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:52:43,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:52:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 21:52:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:52:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-26 21:52:43,095 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-26 21:52:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:43,095 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-26 21:52:43,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-26 21:52:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:43,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:43,100 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-26 21:52:43,100 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:43,100 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-26 21:52:43,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:43,258 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-26 21:52:43,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:43,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:43,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:43,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:43,260 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-26 21:52:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:43,561 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-26 21:52:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:43,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:43,565 INFO L225 Difference]: With dead ends: 321 [2018-09-26 21:52:43,565 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 21:52:43,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 21:52:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-26 21:52:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:52:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-26 21:52:43,636 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-26 21:52:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:43,636 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-26 21:52:43,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-26 21:52:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:43,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:43,642 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-26 21:52:43,642 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:43,642 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-26 21:52:43,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:43,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:43,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:43,757 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-26 21:52:43,758 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:43,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:43,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:43,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:43,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:43,759 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-26 21:52:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:44,000 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-26 21:52:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:44,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:44,004 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:52:44,004 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 21:52:44,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 21:52:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-26 21:52:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 21:52:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-26 21:52:44,072 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-26 21:52:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:44,072 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-26 21:52:44,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-26 21:52:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:44,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:44,076 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-26 21:52:44,076 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:44,077 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-26 21:52:44,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:44,188 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-26 21:52:44,188 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:44,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:44,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:44,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:44,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:44,189 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-26 21:52:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:44,469 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-26 21:52:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:44,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:44,478 INFO L225 Difference]: With dead ends: 1257 [2018-09-26 21:52:44,479 INFO L226 Difference]: Without dead ends: 839 [2018-09-26 21:52:44,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-26 21:52:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-26 21:52:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-26 21:52:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-26 21:52:44,602 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-26 21:52:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:44,603 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-26 21:52:44,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-26 21:52:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:44,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:44,610 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-26 21:52:44,611 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:44,611 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-26 21:52:44,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:44,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:44,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:44,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:44,744 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-26 21:52:44,745 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:44,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:44,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:44,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:44,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:44,746 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-26 21:52:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:45,153 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-26 21:52:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:45,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:52:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:45,163 INFO L225 Difference]: With dead ends: 2505 [2018-09-26 21:52:45,163 INFO L226 Difference]: Without dead ends: 1671 [2018-09-26 21:52:45,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-26 21:52:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-26 21:52:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-26 21:52:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-26 21:52:45,382 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-26 21:52:45,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:45,383 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-26 21:52:45,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-26 21:52:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:52:45,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:45,386 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-26 21:52:45,387 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:45,387 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-26 21:52:45,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:45,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:45,603 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-26 21:52:45,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:52:45,604 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-26 21:52:45,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:45,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:52:46,871 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-26 21:52:46,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:52:46,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:52:46,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:52:46,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:52:46,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:46,910 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-26 21:52:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:52,877 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-26 21:52:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:52:52,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-26 21:52:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:52,891 INFO L225 Difference]: With dead ends: 4801 [2018-09-26 21:52:52,891 INFO L226 Difference]: Without dead ends: 3135 [2018-09-26 21:52:52,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-26 21:52:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-26 21:52:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-26 21:52:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-26 21:52:53,273 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-26 21:52:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:53,274 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-26 21:52:53,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:52:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-26 21:52:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:52:53,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:53,279 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-26 21:52:53,279 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:53,280 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:53,280 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-26 21:52:53,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:53,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:53,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:53,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:52:53,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:53,423 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-26 21:52:53,424 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:53,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:52:53,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:53,425 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:53,425 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-26 21:52:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:53,985 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-26 21:52:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:53,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:52:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:53,993 INFO L225 Difference]: With dead ends: 4873 [2018-09-26 21:52:53,994 INFO L226 Difference]: Without dead ends: 2215 [2018-09-26 21:52:53,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-26 21:52:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-26 21:52:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-26 21:52:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-26 21:52:54,314 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-26 21:52:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:54,315 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-26 21:52:54,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-26 21:52:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 21:52:54,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:52:54,318 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-26 21:52:54,318 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:52:54,318 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:52:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-26 21:52:54,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:52:54,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:52:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:54,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:52:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:52:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:52:54,406 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-26 21:52:54,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:52:54,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:52:54,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:52:54,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:52:54,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:52:54,408 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-26 21:52:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:52:54,451 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-26 21:52:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:52:54,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-26 21:52:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:52:54,451 INFO L225 Difference]: With dead ends: 1799 [2018-09-26 21:52:54,452 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:52:54,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:52:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:52:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:52:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:52:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:52:54,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-26 21:52:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:52:54,458 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:52:54,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:52:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:52:54,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:52:54,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:52:54,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,665 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-26 21:52:54,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,972 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:52:54,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:54,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,606 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-26 21:52:55,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:55,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:52:56,551 WARN L178 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:52:57,579 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:57,749 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:58,013 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:58,428 WARN L178 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:52:58,548 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:58,697 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-26 21:52:58,830 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-26 21:52:59,207 WARN L178 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:59,544 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:59,725 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:52:59,858 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-26 21:53:00,043 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:53:00,047 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-26 21:53:00,047 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-26 21:53:00,047 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-26 21:53:00,047 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-26 21:53:00,048 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:53:00,048 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:53:00,048 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-26 21:53:00,048 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-26 21:53:00,048 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-26 21:53:00,048 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-26 21:53:00,048 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-26 21:53:00,048 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-26 21:53:00,049 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-26 21:53:00,049 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-26 21:53:00,049 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-26 21:53:00,049 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-26 21:53:00,049 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-26 21:53:00,050 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-26 21:53:00,050 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-26 21:53:00,050 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-26 21:53:00,050 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-26 21:53:00,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,111 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,122 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,122 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,131 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 26.09 09:53:00 BoogieIcfgContainer [2018-09-26 21:53:00,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:00,138 INFO L168 Benchmark]: Toolchain (without parser) took 19995.77 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 266.9 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -198.1 MB). Peak memory consumption was 700.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:00,139 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:00,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:00,140 INFO L168 Benchmark]: Boogie Preprocessor took 50.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:53:00,141 INFO L168 Benchmark]: RCFGBuilder took 898.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:00,142 INFO L168 Benchmark]: TraceAbstraction took 18989.68 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 266.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -240.4 MB). Peak memory consumption was 657.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:00,150 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 898.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18989.68 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 266.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -240.4 MB). Peak memory consumption was 657.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-09-26 21:53:00,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,170 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-26 21:53:00,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,172 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-26 21:53:00,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,172 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,173 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,173 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-26 21:53:00,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,174 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,175 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-26 21:53:00,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-26 21:53:00,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 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-26 21:53:00,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,180 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,181 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-26 21:53:00,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,182 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-26 21:53:00,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,183 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,184 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,184 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-26 21:53:00,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:53:00,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 18.8s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-53-00-194.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_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-53-00-194.csv Received shutdown request...