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.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 10:35:45,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:35:45,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:35:45,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:35:45,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:35:45,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:35:45,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:35:45,140 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:35:45,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:35:45,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:35:45,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:35:45,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:35:45,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:35:45,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:35:45,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:35:45,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:35:45,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:35:45,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:35:45,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:35:45,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:35:45,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:35:45,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:35:45,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:35:45,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:35:45,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:35:45,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:35:45,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:35:45,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:35:45,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:35:45,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:35:45,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:35:45,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:35:45,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:35:45,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:35:45,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:35:45,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:35:45,176 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-28 10:35:45,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:35:45,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:35:45,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:35:45,192 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:35:45,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:35:45,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:35:45,193 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:35:45,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:35:45,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:35:45,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:35:45,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:35:45,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:35:45,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:35:45,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:35:45,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:35:45,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:35:45,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:35:45,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:35:45,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:35:45,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:35:45,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:35:45,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:35:45,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:35:45,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:35:45,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:35:45,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:35:45,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:35:45,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:35:45,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:35:45,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:35:45,198 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-28 10:35:45,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:35:45,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:35:45,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:35:45,277 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:35:45,277 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:35:45,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-28 10:35:45,278 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-28 10:35:45,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:35:45,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:35:45,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:35:45,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:35:45,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:35:45,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:35:45,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:35:45,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:35:45,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:35:45,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/1) ... [2018-09-28 10:35:45,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:35:45,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:35:45,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:35:45,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:35:45,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (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-28 10:35:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 10:35:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 10:35:46,197 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 10:35:46,198 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:35:46 BoogieIcfgContainer [2018-09-28 10:35:46,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:35:46,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:35:46,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:35:46,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:35:46,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:35:45" (1/2) ... [2018-09-28 10:35:46,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a67957e and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:35:46, skipping insertion in model container [2018-09-28 10:35:46,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:35:46" (2/2) ... [2018-09-28 10:35:46,211 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-28 10:35:46,221 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:35:46,234 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:35:46,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:35:46,287 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:35:46,288 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:35:46,288 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:35:46,288 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:35:46,288 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:35:46,288 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:35:46,288 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:35:46,289 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:35:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-28 10:35:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:35:46,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:46,317 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:46,318 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:46,325 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:46,326 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-28 10:35:46,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:46,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:46,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:46,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:46,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:46,588 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-28 10:35:46,591 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:46,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:35:46,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:46,608 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:46,609 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-28 10:35:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:46,738 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-28 10:35:46,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:46,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-28 10:35:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:46,752 INFO L225 Difference]: With dead ends: 51 [2018-09-28 10:35:46,752 INFO L226 Difference]: Without dead ends: 33 [2018-09-28 10:35:46,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-28 10:35:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-28 10:35:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-28 10:35:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-28 10:35:46,802 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-28 10:35:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:46,802 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-28 10:35:46,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-28 10:35:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:35:46,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:46,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:46,804 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:46,804 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-28 10:35:46,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:46,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:46,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:46,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:46,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:46,939 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-28 10:35:46,942 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:46,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:35:46,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:46,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:46,945 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-28 10:35:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:47,021 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-28 10:35:47,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:47,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-28 10:35:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:47,026 INFO L225 Difference]: With dead ends: 91 [2018-09-28 10:35:47,027 INFO L226 Difference]: Without dead ends: 61 [2018-09-28 10:35:47,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-28 10:35:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-28 10:35:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-28 10:35:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-28 10:35:47,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-28 10:35:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:47,060 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-28 10:35:47,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-28 10:35:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:35:47,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:47,061 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:47,061 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:47,061 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-28 10:35:47,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:47,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:47,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:47,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:47,203 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-28 10:35:47,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:47,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:35:47,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:47,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:47,205 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-28 10:35:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:47,275 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-28 10:35:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:47,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-28 10:35:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:47,279 INFO L225 Difference]: With dead ends: 175 [2018-09-28 10:35:47,279 INFO L226 Difference]: Without dead ends: 117 [2018-09-28 10:35:47,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-28 10:35:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-28 10:35:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-28 10:35:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-28 10:35:47,318 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-28 10:35:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:47,321 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-28 10:35:47,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-28 10:35:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:35:47,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:47,322 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:47,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:47,323 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:47,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-28 10:35:47,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:47,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:47,427 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-28 10:35:47,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:47,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:35:47,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:47,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:47,431 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-28 10:35:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:47,506 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-28 10:35:47,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:47,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-28 10:35:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:47,509 INFO L225 Difference]: With dead ends: 343 [2018-09-28 10:35:47,509 INFO L226 Difference]: Without dead ends: 229 [2018-09-28 10:35:47,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-28 10:35:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-28 10:35:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-28 10:35:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-28 10:35:47,561 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-28 10:35:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:47,562 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-28 10:35:47,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-28 10:35:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:35:47,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:47,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:47,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:47,567 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-28 10:35:47,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:47,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:47,666 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-28 10:35:47,666 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:47,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:35:47,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:47,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:47,667 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-28 10:35:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:47,948 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-28 10:35:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:47,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-28 10:35:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:47,953 INFO L225 Difference]: With dead ends: 569 [2018-09-28 10:35:47,953 INFO L226 Difference]: Without dead ends: 343 [2018-09-28 10:35:47,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-28 10:35:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-28 10:35:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-28 10:35:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-28 10:35:48,031 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-28 10:35:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:48,036 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-28 10:35:48,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-28 10:35:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 10:35:48,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:48,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:48,038 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:48,038 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-28 10:35:48,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:48,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:48,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:48,258 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-28 10:35:48,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:48,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:35:48,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:35:48,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:35:48,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:48,260 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-28 10:35:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:49,033 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-28 10:35:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:35:49,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-28 10:35:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:49,038 INFO L225 Difference]: With dead ends: 610 [2018-09-28 10:35:49,038 INFO L226 Difference]: Without dead ends: 608 [2018-09-28 10:35:49,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-28 10:35:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-28 10:35:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-28 10:35:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-28 10:35:49,140 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-28 10:35:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:49,140 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-28 10:35:49,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:35:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-28 10:35:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-28 10:35:49,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:49,143 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:49,143 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:49,144 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-28 10:35:49,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:49,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:49,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:49,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:35:49,262 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:49,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:35:49,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:49,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:49,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:49,263 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-28 10:35:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:49,615 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-28 10:35:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:49,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-28 10:35:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:49,623 INFO L225 Difference]: With dead ends: 1113 [2018-09-28 10:35:49,625 INFO L226 Difference]: Without dead ends: 743 [2018-09-28 10:35:49,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-28 10:35:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-28 10:35:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-28 10:35:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-28 10:35:49,766 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-28 10:35:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:49,767 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-28 10:35:49,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-28 10:35:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-28 10:35:49,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:49,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:35:49,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:49,773 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-28 10:35:49,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:49,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:35:50,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:35:50,024 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-28 10:35:50,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:50,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:35:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-28 10:35:50,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:35:50,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-28 10:35:50,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:35:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:35:50,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:50,709 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-28 10:35:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:54,795 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-28 10:35:54,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 10:35:54,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-28 10:35:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:54,803 INFO L225 Difference]: With dead ends: 2109 [2018-09-28 10:35:54,803 INFO L226 Difference]: Without dead ends: 1371 [2018-09-28 10:35:54,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-28 10:35:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-28 10:35:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-28 10:35:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-28 10:35:54,992 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-28 10:35:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:54,992 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-28 10:35:54,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:35:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-28 10:35:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-28 10:35:54,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:54,998 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-28 10:35:54,998 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:54,998 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-28 10:35:54,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:54,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:55,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:35:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-28 10:35:55,134 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:55,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:35:55,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:55,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:55,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:55,135 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-28 10:35:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:55,584 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-28 10:35:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:55,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-28 10:35:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:55,592 INFO L225 Difference]: With dead ends: 2161 [2018-09-28 10:35:55,592 INFO L226 Difference]: Without dead ends: 975 [2018-09-28 10:35:55,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-28 10:35:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-28 10:35:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-28 10:35:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-28 10:35:55,770 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-28 10:35:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:55,771 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-28 10:35:55,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-28 10:35:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-28 10:35:55,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:35:55,773 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-28 10:35:55,774 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:35:55,774 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:35:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-28 10:35:55,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:35:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:35:55,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:55,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:35:55,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:35:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:35:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-28 10:35:55,839 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:35:55,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:35:55,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:35:55,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:35:55,840 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:35:55,840 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-28 10:35:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:35:55,862 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-28 10:35:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:35:55,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-28 10:35:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:35:55,862 INFO L225 Difference]: With dead ends: 799 [2018-09-28 10:35:55,862 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:35:55,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:35:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:35:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:35:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:35:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:35:55,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-28 10:35:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:35:55,865 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:35:55,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:35:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:35:55,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:35:55,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:35:55,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:55,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:56,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:35:58,516 WARN L178 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-28 10:35:58,733 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-28 10:35:59,377 WARN L178 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:35:59,659 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-28 10:36:00,691 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-28 10:36:00,808 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-28 10:36:01,025 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-28 10:36:01,609 WARN L178 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-28 10:36:01,860 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-28 10:36:02,034 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-28 10:36:02,288 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-28 10:36:02,515 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-28 10:36:02,653 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-28 10:36:03,061 WARN L178 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-28 10:36:03,064 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-28 10:36:03,064 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-28 10:36:03,064 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-28 10:36:03,064 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-28 10:36:03,064 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-09-28 10:36:03,065 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-28 10:36:03,065 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-28 10:36:03,065 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-28 10:36:03,065 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-28 10:36:03,065 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-28 10:36:03,065 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-28 10:36:03,065 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-28 10:36:03,065 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-28 10:36:03,066 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-28 10:36:03,066 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-28 10:36:03,066 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-28 10:36:03,066 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-28 10:36:03,066 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-28 10:36:03,066 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-28 10:36:03,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,116 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,123 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,125 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,126 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,128 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,130 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,136 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:36:03 BoogieIcfgContainer [2018-09-28 10:36:03,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:36:03,137 INFO L168 Benchmark]: Toolchain (without parser) took 17773.94 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 124.3 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -26.9 MB). Peak memory consumption was 596.8 MB. Max. memory is 7.1 GB. [2018-09-28 10:36:03,139 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:36:03,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.46 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-28 10:36:03,140 INFO L168 Benchmark]: Boogie Preprocessor took 61.86 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-28 10:36:03,140 INFO L168 Benchmark]: RCFGBuilder took 711.36 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:36:03,141 INFO L168 Benchmark]: TraceAbstraction took 16937.20 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 124.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -58.6 MB). Peak memory consumption was 565.1 MB. Max. memory is 7.1 GB. [2018-09-28 10:36:03,146 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.46 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 61.86 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 711.36 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16937.20 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 124.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -58.6 MB). Peak memory consumption was 565.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 398]: Loop Invariant [2018-09-28 10:36:03,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-09-28 10:36:03,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-09-28 10:36:03,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,182 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-09-28 10:36:03,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-09-28 10:36:03,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-09-28 10:36:03,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant [2018-09-28 10:36:03,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-09-28 10:36:03,209 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,209 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,210 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-28 10:36:03,210 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 16.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 7.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_10-36-03-223.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_10-36-03-223.csv Received shutdown request...