java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:46:11,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:46:11,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:46:11,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:46:11,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:46:11,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:46:11,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:46:11,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:46:11,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:46:11,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:46:11,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:46:11,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:46:11,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:46:11,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:46:11,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:46:11,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:46:11,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:46:11,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:46:11,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:46:11,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:46:11,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:46:11,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:46:11,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:46:11,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:46:11,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:46:11,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:46:11,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:46:11,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:46:11,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:46:11,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:46:11,279 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:46:11,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:46:11,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:46:11,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:46:11,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:46:11,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:46:11,287 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-30 20:46:11,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:46:11,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:46:11,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:46:11,314 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:46:11,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:46:11,315 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:46:11,315 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:46:11,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:46:11,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:46:11,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:46:11,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:46:11,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:46:11,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:46:11,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:46:11,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:46:11,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:46:11,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:46:11,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:46:11,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:46:11,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:46:11,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:46:11,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:46:11,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:46:11,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:46:11,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:46:11,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:46:11,322 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:46:11,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:46:11,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:46:11,323 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:46:11,323 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:46:11,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:46:11,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:46:11,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:46:11,401 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:46:11,402 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:46:11,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:46:11,404 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 20:46:11,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:46:11,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:46:11,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:46:11,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:46:11,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:46:11,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:46:11,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:46:11,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:46:11,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:46:11,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... [2018-09-30 20:46:11,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:46:11,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:46:11,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:46:11,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:46:11,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:46:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:46:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:46:12,383 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:46:12,383 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:46:12 BoogieIcfgContainer [2018-09-30 20:46:12,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:46:12,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:46:12,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:46:12,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:46:12,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:11" (1/2) ... [2018-09-30 20:46:12,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c98a878 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:46:12, skipping insertion in model container [2018-09-30 20:46:12,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:46:12" (2/2) ... [2018-09-30 20:46:12,392 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 20:46:12,401 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:46:12,415 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:46:12,465 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:46:12,466 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:46:12,466 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:46:12,466 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:46:12,466 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:46:12,466 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:46:12,467 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:46:12,467 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:46:12,467 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:46:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 20:46:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:12,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:12,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:12,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:12,498 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 20:46:12,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:12,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:12,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:12,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:12,807 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:12,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:12,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:12,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:12,824 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 20:46:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:12,934 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 20:46:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:12,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:46:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:12,947 INFO L225 Difference]: With dead ends: 57 [2018-09-30 20:46:12,948 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 20:46:12,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 20:46:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 20:46:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:46:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 20:46:12,996 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 20:46:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:12,997 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 20:46:12,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 20:46:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:12,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:12,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:12,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:12,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 20:46:12,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:13,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:13,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:13,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:13,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:13,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:13,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:13,197 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 20:46:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:13,361 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 20:46:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:13,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:46:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:13,363 INFO L225 Difference]: With dead ends: 103 [2018-09-30 20:46:13,364 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 20:46:13,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 20:46:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 20:46:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 20:46:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 20:46:13,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 20:46:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:13,385 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 20:46:13,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 20:46:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:13,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:13,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:13,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:13,388 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:13,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 20:46:13,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:13,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:13,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:13,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:13,516 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:13,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:46:13,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:46:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:46:13,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:13,517 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 20:46:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:13,871 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 20:46:13,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:46:13,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 20:46:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:13,884 INFO L225 Difference]: With dead ends: 141 [2018-09-30 20:46:13,884 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 20:46:13,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:46:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 20:46:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 20:46:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 20:46:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 20:46:13,929 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 20:46:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:13,930 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 20:46:13,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:46:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 20:46:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:46:13,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:13,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:13,934 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:13,934 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 20:46:13,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:13,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:13,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:13,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:13,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:14,079 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:14,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:14,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:14,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:14,080 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 20:46:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:14,181 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 20:46:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:14,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:46:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:14,185 INFO L225 Difference]: With dead ends: 183 [2018-09-30 20:46:14,188 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:46:14,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:46:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 20:46:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:46:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 20:46:14,228 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 20:46:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:14,228 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 20:46:14,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 20:46:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:14,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:14,230 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:14,231 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:14,231 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 20:46:14,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:14,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:14,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:14,384 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:14,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:14,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:14,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:14,385 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 20:46:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:14,498 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 20:46:14,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:14,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:14,502 INFO L225 Difference]: With dead ends: 321 [2018-09-30 20:46:14,502 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 20:46:14,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 20:46:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 20:46:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 20:46:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 20:46:14,544 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 20:46:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:14,545 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 20:46:14,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 20:46:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:14,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:14,547 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:14,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:14,548 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 20:46:14,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:14,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:14,670 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:14,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:14,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:14,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:14,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:14,673 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 20:46:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:14,908 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 20:46:14,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:14,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:14,913 INFO L225 Difference]: With dead ends: 633 [2018-09-30 20:46:14,913 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 20:46:14,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 20:46:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 20:46:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 20:46:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 20:46:14,993 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 20:46:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:14,994 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 20:46:14,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 20:46:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:14,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:14,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:14,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:14,997 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 20:46:14,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:15,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:15,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:15,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:15,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:15,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:15,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:15,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:15,096 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 20:46:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:15,429 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 20:46:15,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:15,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:15,435 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 20:46:15,435 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 20:46:15,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 20:46:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 20:46:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 20:46:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 20:46:15,553 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 20:46:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:15,554 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 20:46:15,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 20:46:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:15,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:15,569 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:15,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:15,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 20:46:15,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:15,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:15,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:15,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:15,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:15,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:15,703 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:15,703 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 20:46:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:16,068 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 20:46:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:16,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:46:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:16,077 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 20:46:16,077 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 20:46:16,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 20:46:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 20:46:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 20:46:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 20:46:16,287 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 20:46:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:16,288 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 20:46:16,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 20:46:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:46:16,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:16,291 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:16,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:16,291 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 20:46:16,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:16,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:16,403 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:46:16,404 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:46:16,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:16,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:46:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:46:17,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:46:17,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 20:46:17,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:46:17,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:46:17,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:17,492 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 20:46:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:22,550 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 20:46:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:46:22,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 20:46:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:22,566 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 20:46:22,566 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 20:46:22,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-09-30 20:46:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 20:46:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 20:46:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 20:46:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 20:46:22,943 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 20:46:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:22,943 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 20:46:22,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:46:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 20:46:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:46:22,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:22,949 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:46:22,949 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:22,950 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:22,950 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 20:46:22,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:22,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:22,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 20:46:23,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:23,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:23,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:23,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:23,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:23,100 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 20:46:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:23,634 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 20:46:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:23,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:46:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:23,643 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 20:46:23,644 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 20:46:23,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 20:46:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 20:46:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 20:46:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 20:46:23,991 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 20:46:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:23,991 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 20:46:23,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 20:46:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:46:23,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:23,994 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 20:46:23,994 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:23,994 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 20:46:23,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:23,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:23,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:23,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:46:23,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-30 20:46:24,100 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:24,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:24,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:24,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:24,101 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 20:46:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:24,137 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 20:46:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:24,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 20:46:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:24,137 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 20:46:24,138 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:46:24,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:46:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:46:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:46:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:46:24,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 20:46:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:24,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:46:24,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:46:24,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:46:24,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:46:24,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,286 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 20:46:24,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,550 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:46:24,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,696 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 20:46:24,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:24,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,202 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 20:46:25,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:25,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:46:26,448 WARN L178 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:46:27,058 WARN L178 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:27,180 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:27,349 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:27,548 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:46:27,730 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:27,853 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 20:46:28,246 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:28,843 WARN L178 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:29,097 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:29,258 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 20:46:29,481 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 20:46:29,484 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 20:46:29,485 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:29,486 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,486 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 20:46:29,486 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:46:29,486 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:46:29,486 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 20:46:29,487 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 20:46:29,487 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:29,487 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,487 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:46:29,488 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:29,488 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 20:46:29,488 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,488 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 20:46:29,489 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,489 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 20:46:29,489 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,489 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 20:46:29,490 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,490 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 20:46:29,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,504 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,509 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,509 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,511 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,511 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,513 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,513 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,515 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,515 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,517 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,517 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,519 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,519 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,521 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,521 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,522 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,523 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,527 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,527 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,529 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,529 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,531 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,531 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,533 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,533 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,534 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,535 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,539 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,539 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,542 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,544 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:46:29 BoogieIcfgContainer [2018-09-30 20:46:29,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:46:29,546 INFO L168 Benchmark]: Toolchain (without parser) took 18062.80 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 320.3 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -341.2 MB). Peak memory consumption was 734.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:29,547 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:29,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:29,548 INFO L168 Benchmark]: Boogie Preprocessor took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:29,549 INFO L168 Benchmark]: RCFGBuilder took 805.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:29,550 INFO L168 Benchmark]: TraceAbstraction took 17160.22 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 320.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -383.5 MB). Peak memory consumption was 692.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:29,554 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.69 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 805.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17160.22 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 320.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -383.5 MB). Peak memory consumption was 692.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] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-09-30 20:46:29,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,567 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,567 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-30 20:46:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-30 20:46:29,571 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,571 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,572 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,573 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-30 20:46:29,574 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,574 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,575 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,575 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-30 20:46:29,576 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,576 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,577 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-30 20:46:29,579 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,579 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,580 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,580 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-30 20:46:29,581 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,581 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,582 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,582 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-30 20:46:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,583 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,584 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-30 20:46:29,585 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,586 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,586 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,587 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-30 20:46:29,587 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 20:46:29,588 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 17.0s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-46-29-595.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-46-29-595.csv Received shutdown request...