java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:52:13,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:52:13,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:52:13,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:52:13,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:52:13,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:52:13,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:52:13,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:52:13,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:52:13,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:52:13,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:52:13,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:52:13,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:52:13,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:52:13,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:52:13,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:52:13,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:52:13,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:52:13,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:52:13,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:52:13,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:52:13,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:52:13,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:52:13,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:52:13,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:52:13,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:52:13,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:52:13,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:52:13,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:52:13,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:52:13,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:52:13,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:52:13,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:52:13,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:52:13,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:52:13,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:52:13,382 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-10-04 12:52:13,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:52:13,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:52:13,401 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:52:13,401 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:52:13,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:52:13,402 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:52:13,402 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:52:13,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:52:13,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:52:13,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:52:13,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:52:13,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:52:13,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:52:13,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:52:13,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:52:13,404 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:52:13,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:52:13,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:52:13,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:52:13,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:52:13,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:52:13,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:52:13,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:52:13,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:52:13,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:52:13,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:52:13,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:52:13,406 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:52:13,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:52:13,409 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:52:13,409 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:52:13,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:52:13,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:52:13,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:52:13,469 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:52:13,469 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:52:13,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:52:13,470 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 12:52:13,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:52:13,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:52:13,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:13,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:52:13,572 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:52:13,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:52:13,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:52:13,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:52:13,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:52:13,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/1) ... [2018-10-04 12:52:13,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:52:13,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:52:13,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:52:13,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:52:13,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (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-10-04 12:52:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:52:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:52:14,521 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:52:14,522 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:14 BoogieIcfgContainer [2018-10-04 12:52:14,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:52:14,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:52:14,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:52:14,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:52:14,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:52:13" (1/2) ... [2018-10-04 12:52:14,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251f79d0 and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:52:14, skipping insertion in model container [2018-10-04 12:52:14,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:52:14" (2/2) ... [2018-10-04 12:52:14,533 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 12:52:14,543 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:52:14,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:52:14,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:52:14,599 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:52:14,599 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:52:14,600 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:52:14,600 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:52:14,600 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:52:14,600 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:52:14,600 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:52:14,601 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:52:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:52:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:14,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:14,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:14,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:14,632 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-10-04 12:52:14,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:14,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:14,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:14,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:14,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:14,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:14,921 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-04 12:52:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:14,976 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-10-04 12:52:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:14,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:52:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:14,997 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:52:14,997 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:52:15,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:52:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-04 12:52:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:52:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-04 12:52:15,053 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-10-04 12:52:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:15,055 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-04 12:52:15,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-04 12:52:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:15,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:15,056 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:15,057 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:15,057 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-10-04 12:52:15,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:15,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:15,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:15,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:15,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:15,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:15,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:15,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:15,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:15,241 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-04 12:52:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:15,282 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-10-04 12:52:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:15,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:52:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:15,284 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:52:15,284 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:52:15,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:52:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-04 12:52:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:52:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-10-04 12:52:15,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-10-04 12:52:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:15,306 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-10-04 12:52:15,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-10-04 12:52:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:15,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:15,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:15,307 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:15,308 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-10-04 12:52:15,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:15,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:15,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:15,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:52:15,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:52:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:52:15,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:15,464 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-10-04 12:52:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:15,645 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-10-04 12:52:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:52:15,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-04 12:52:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:15,650 INFO L225 Difference]: With dead ends: 141 [2018-10-04 12:52:15,650 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:52:15,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:52:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:52:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-10-04 12:52:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:52:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-10-04 12:52:15,677 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-10-04 12:52:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:15,678 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-10-04 12:52:15,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:52:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-10-04 12:52:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:52:15,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:15,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:52:15,681 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:15,681 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:15,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-10-04 12:52:15,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:15,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:15,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:15,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:15,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:15,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:15,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:15,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:15,773 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-10-04 12:52:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:15,866 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-10-04 12:52:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:15,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-04 12:52:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:15,869 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:52:15,869 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:52:15,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:52:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-04 12:52:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:52:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-10-04 12:52:15,898 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-10-04 12:52:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:15,898 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-10-04 12:52:15,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-10-04 12:52:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:15,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:15,900 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-10-04 12:52:15,900 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:15,901 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-10-04 12:52:15,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:15,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:15,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:15,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:16,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:16,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:16,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:16,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:16,040 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-10-04 12:52:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:16,157 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-10-04 12:52:16,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:16,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:16,161 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:52:16,161 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 12:52:16,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 12:52:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-04 12:52:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:52:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-10-04 12:52:16,214 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-10-04 12:52:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:16,215 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-10-04 12:52:16,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-10-04 12:52:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:16,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:16,219 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-10-04 12:52:16,220 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:16,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-10-04 12:52:16,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:16,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:16,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:16,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:16,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:16,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:16,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:16,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:16,354 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-10-04 12:52:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:16,485 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-10-04 12:52:16,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:16,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:16,489 INFO L225 Difference]: With dead ends: 633 [2018-10-04 12:52:16,489 INFO L226 Difference]: Without dead ends: 423 [2018-10-04 12:52:16,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-04 12:52:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-04 12:52:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-04 12:52:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-10-04 12:52:16,586 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-10-04 12:52:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:16,586 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-10-04 12:52:16,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-10-04 12:52:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:16,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:16,593 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-10-04 12:52:16,594 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:16,594 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-10-04 12:52:16,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:16,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:16,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:16,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:16,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:16,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:16,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:16,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:16,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:16,748 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-10-04 12:52:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:16,938 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-10-04 12:52:16,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:16,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:16,944 INFO L225 Difference]: With dead ends: 1257 [2018-10-04 12:52:16,944 INFO L226 Difference]: Without dead ends: 839 [2018-10-04 12:52:16,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-10-04 12:52:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-10-04 12:52:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-10-04 12:52:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-10-04 12:52:17,070 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-10-04 12:52:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:17,071 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-10-04 12:52:17,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-10-04 12:52:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:17,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:17,074 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-10-04 12:52:17,074 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:17,075 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-10-04 12:52:17,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:17,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:17,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:17,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:17,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:17,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:17,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:17,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:17,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:17,196 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-10-04 12:52:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:17,500 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-10-04 12:52:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:17,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:52:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:17,510 INFO L225 Difference]: With dead ends: 2505 [2018-10-04 12:52:17,511 INFO L226 Difference]: Without dead ends: 1671 [2018-10-04 12:52:17,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-04 12:52:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-10-04 12:52:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-10-04 12:52:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-10-04 12:52:17,762 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-10-04 12:52:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:17,763 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-10-04 12:52:17,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-10-04 12:52:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:52:17,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:17,766 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-10-04 12:52:17,766 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:17,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:17,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-10-04 12:52:17,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:17,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:17,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:17,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:52:18,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:52:18,038 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-10-04 12:52:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:18,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:52:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:52:19,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:52:19,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:52:19,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:52:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:52:19,245 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:19,245 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-10-04 12:52:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:22,530 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-10-04 12:52:22,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:52:22,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-10-04 12:52:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:22,544 INFO L225 Difference]: With dead ends: 4801 [2018-10-04 12:52:22,544 INFO L226 Difference]: Without dead ends: 3135 [2018-10-04 12:52:22,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 0.9s impTime 13 [2018-10-04 12:52:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-10-04 12:52:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-10-04 12:52:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-10-04 12:52:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-10-04 12:52:22,857 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-10-04 12:52:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:22,858 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-10-04 12:52:22,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:52:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-10-04 12:52:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:52:22,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:22,862 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-10-04 12:52:22,862 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:22,862 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-10-04 12:52:22,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:22,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:52:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:52:23,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:23,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:52:23,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:23,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:23,019 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-10-04 12:52:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:23,591 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-10-04 12:52:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:23,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:52:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:23,601 INFO L225 Difference]: With dead ends: 4873 [2018-10-04 12:52:23,601 INFO L226 Difference]: Without dead ends: 2215 [2018-10-04 12:52:23,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-10-04 12:52:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-10-04 12:52:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-10-04 12:52:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-10-04 12:52:23,906 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-10-04 12:52:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:23,906 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-10-04 12:52:23,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-10-04 12:52:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:52:23,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:52:23,909 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-10-04 12:52:23,909 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:52:23,910 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:52:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-10-04 12:52:23,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:52:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:52:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:23,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:52:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:52:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:52:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-04 12:52:23,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:52:23,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:52:23,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:52:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:52:23,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:52:23,998 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-10-04 12:52:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:52:24,033 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-10-04 12:52:24,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:52:24,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-04 12:52:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:52:24,033 INFO L225 Difference]: With dead ends: 1799 [2018-10-04 12:52:24,033 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:52:24,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:52:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:52:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:52:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:52:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:52:24,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-10-04 12:52:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:52:24,037 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:52:24,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:52:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:52:24,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:52:24,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:52:24,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,207 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-10-04 12:52:24,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,520 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 12:52:24,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:24,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,171 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-10-04 12:52:25,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:25,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:52:26,452 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:52:26,873 WARN L178 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:27,050 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:27,866 WARN L178 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:28,402 WARN L178 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:52:28,593 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:28,707 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-04 12:52:28,814 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-04 12:52:29,171 WARN L178 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:29,308 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:29,433 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:29,580 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-04 12:52:29,868 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:52:29,872 INFO L421 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-10-04 12:52:29,872 INFO L421 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-10-04 12:52:29,873 INFO L421 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-10-04 12:52:29,873 INFO L421 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-10-04 12:52:29,873 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:52:29,873 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:52:29,873 INFO L421 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-10-04 12:52:29,874 INFO L421 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-10-04 12:52:29,874 INFO L421 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-10-04 12:52:29,874 INFO L421 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 12:52:29,874 INFO L421 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-10-04 12:52:29,875 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-10-04 12:52:29,875 INFO L421 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-10-04 12:52:29,875 INFO L421 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-10-04 12:52:29,875 INFO L421 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-10-04 12:52:29,876 INFO L421 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-10-04 12:52:29,876 INFO L421 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-10-04 12:52:29,876 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-10-04 12:52:29,876 INFO L421 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 12:52:29,877 INFO L421 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-10-04 12:52:29,877 INFO L421 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-10-04 12:52:29,890 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,891 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,893 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,894 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,896 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,896 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,898 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,898 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,900 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,900 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,902 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,902 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,904 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,904 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,906 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,907 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,908 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,909 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,910 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,911 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,913 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,914 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,915 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,916 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,917 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,917 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,919 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,919 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,921 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,921 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,923 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,923 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,926 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,926 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,928 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,928 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,929 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,929 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,931 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,933 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:52:29 BoogieIcfgContainer [2018-10-04 12:52:29,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:52:29,934 INFO L168 Benchmark]: Toolchain (without parser) took 16364.76 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 203.4 MB). Free memory was 1.5 GB in the beginning and 985.0 MB in the end (delta: 465.5 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:29,936 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-10-04 12:52:29,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:29,937 INFO L168 Benchmark]: Boogie Preprocessor took 67.63 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-10-04 12:52:29,938 INFO L168 Benchmark]: RCFGBuilder took 831.49 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:29,938 INFO L168 Benchmark]: TraceAbstraction took 15408.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 203.4 MB). Free memory was 1.4 GB in the beginning and 985.0 MB in the end (delta: 412.6 MB). Peak memory consumption was 616.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:29,943 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.63 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 831.49 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15408.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 203.4 MB). Free memory was 1.4 GB in the beginning and 985.0 MB in the end (delta: 412.6 MB). Peak memory consumption was 616.0 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-10-04 12:52:29,955 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,955 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,956 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,956 WARN L390 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-10-04 12:52:29,957 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,957 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,958 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,958 WARN L390 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-10-04 12:52:29,959 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,959 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,960 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,960 WARN L390 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-10-04 12:52:29,961 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,961 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,962 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,962 WARN L390 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-10-04 12:52:29,965 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,966 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,966 WARN L390 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-10-04 12:52:29,971 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,971 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,972 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,972 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-10-04 12:52:29,973 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,973 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,977 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,977 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-10-04 12:52:29,978 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,979 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,979 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,979 WARN L390 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-10-04 12:52:29,984 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,984 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,985 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,985 WARN L390 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-10-04 12:52:29,986 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,991 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,992 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:52:29,993 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 15.2s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s 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.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-52-29-998.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-52-29-998.csv Received shutdown request...