java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:21:17,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:21:17,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:21:17,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:21:17,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:21:17,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:21:17,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:21:17,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:21:17,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:21:17,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:21:17,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:21:17,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:21:17,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:21:17,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:21:17,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:21:17,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:21:17,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:21:17,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:21:17,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:21:17,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:21:17,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:21:17,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:21:17,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:21:17,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:21:17,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:21:17,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:21:17,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:21:17,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:21:17,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:21:17,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:21:17,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:21:17,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:21:17,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:21:17,403 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:21:17,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:21:17,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:21:17,405 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:21:17,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:21:17,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:21:17,436 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:21:17,436 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:21:17,440 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:21:17,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:21:17,440 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:21:17,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:21:17,441 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:21:17,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:21:17,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:21:17,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:21:17,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:21:17,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:21:17,443 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:21:17,443 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:21:17,443 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:21:17,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:21:17,444 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:21:17,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:21:17,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:21:17,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:21:17,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:21:17,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:21:17,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:21:17,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:21:17,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:21:17,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:21:17,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:21:17,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:21:17,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:21:17,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:21:17,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:21:17,524 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:21:17,525 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:21:17,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:21:17,526 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-10-04 09:21:17,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:21:17,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:21:17,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:17,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:21:17,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:21:17,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:21:17,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:21:17,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:21:17,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:21:17,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/1) ... [2018-10-04 09:21:17,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:21:17,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:21:17,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:21:17,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:21:17,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (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 09:21:17,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:21:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:21:18,430 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:21:18,431 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:18 BoogieIcfgContainer [2018-10-04 09:21:18,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:21:18,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:21:18,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:21:18,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:21:18,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:21:17" (1/2) ... [2018-10-04 09:21:18,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc96bc3 and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:21:18, skipping insertion in model container [2018-10-04 09:21:18,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:21:18" (2/2) ... [2018-10-04 09:21:18,440 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-10-04 09:21:18,450 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:21:18,459 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:21:18,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:21:18,509 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:21:18,509 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:21:18,510 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:21:18,510 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:21:18,510 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:21:18,510 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:21:18,510 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:21:18,510 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:21:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-04 09:21:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:21:18,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:18,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:18,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:18,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-04 09:21:18,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:18,815 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 09:21:18,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:18,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:18,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:18,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:18,837 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-04 09:21:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:18,896 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-04 09:21:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:18,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:21:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:18,910 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:21:18,911 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:21:18,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:21:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-04 09:21:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:21:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-04 09:21:18,962 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-04 09:21:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:18,962 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-04 09:21:18,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 09:21:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:21:18,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:18,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:18,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:18,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-04 09:21:18,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:18,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:18,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:18,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:19,102 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 09:21:19,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:19,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,112 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-04 09:21:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:19,195 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-04 09:21:19,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:19,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:21:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:19,198 INFO L225 Difference]: With dead ends: 91 [2018-10-04 09:21:19,199 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 09:21:19,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 09:21:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-04 09:21:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:21:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-04 09:21:19,219 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-04 09:21:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:19,220 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-04 09:21:19,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-04 09:21:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:21:19,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:19,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:19,221 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:19,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-04 09:21:19,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:19,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:19,343 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 09:21:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:19,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,346 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-04 09:21:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:19,431 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-04 09:21:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:19,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:21:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:19,438 INFO L225 Difference]: With dead ends: 175 [2018-10-04 09:21:19,438 INFO L226 Difference]: Without dead ends: 117 [2018-10-04 09:21:19,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-04 09:21:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-04 09:21:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 09:21:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-04 09:21:19,482 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-04 09:21:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:19,482 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-04 09:21:19,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-04 09:21:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:21:19,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:19,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:19,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:19,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-10-04 09:21:19,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:19,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:19,580 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 09:21:19,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:19,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:19,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:19,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,582 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-10-04 09:21:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:19,651 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-10-04 09:21:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:19,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:21:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:19,655 INFO L225 Difference]: With dead ends: 343 [2018-10-04 09:21:19,655 INFO L226 Difference]: Without dead ends: 229 [2018-10-04 09:21:19,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-04 09:21:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-04 09:21:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 09:21:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-10-04 09:21:19,717 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-10-04 09:21:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:19,717 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-10-04 09:21:19,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-10-04 09:21:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:21:19,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:19,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:19,723 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:19,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-10-04 09:21:19,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:19,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:19,834 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 09:21:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:19,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,836 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-10-04 09:21:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:19,948 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-10-04 09:21:19,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:19,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:21:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:19,951 INFO L225 Difference]: With dead ends: 569 [2018-10-04 09:21:19,951 INFO L226 Difference]: Without dead ends: 343 [2018-10-04 09:21:19,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-04 09:21:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-04 09:21:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-04 09:21:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-10-04 09:21:20,029 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-10-04 09:21:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:20,029 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-10-04 09:21:20,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-10-04 09:21:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:21:20,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:20,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:20,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:20,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:20,032 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-10-04 09:21:20,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:20,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:20,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:20,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:20,206 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 09:21:20,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:20,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:21:20,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:21:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:21:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:21:20,208 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-10-04 09:21:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:20,432 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-10-04 09:21:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:21:20,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:21:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:20,437 INFO L225 Difference]: With dead ends: 610 [2018-10-04 09:21:20,437 INFO L226 Difference]: Without dead ends: 608 [2018-10-04 09:21:20,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:21:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-04 09:21:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-10-04 09:21:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-04 09:21:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-04 09:21:20,507 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-10-04 09:21:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:20,508 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-04 09:21:20,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:21:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-04 09:21:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:21:20,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:20,511 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:20,511 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:20,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-10-04 09:21:20,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:20,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:20,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:20,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:20,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:20,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:20,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:20,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:20,673 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-04 09:21:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:20,878 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-04 09:21:20,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:20,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:21:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:20,884 INFO L225 Difference]: With dead ends: 1113 [2018-10-04 09:21:20,884 INFO L226 Difference]: Without dead ends: 743 [2018-10-04 09:21:20,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-04 09:21:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-04 09:21:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-04 09:21:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-04 09:21:21,018 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-04 09:21:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:21,019 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-04 09:21:21,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-04 09:21:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:21:21,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:21,025 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:21:21,025 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:21,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-10-04 09:21:21,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:21,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:21,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:21:21,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:21:21,384 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 09:21:21,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:21,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:21:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:21:21,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:21:21,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:21:21,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:21:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:21:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:21:21,778 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-04 09:21:21,999 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 09:21:22,343 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:21:22,804 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:21:23,510 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 09:21:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:24,899 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-10-04 09:21:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:21:24,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-04 09:21:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:24,907 INFO L225 Difference]: With dead ends: 2109 [2018-10-04 09:21:24,907 INFO L226 Difference]: Without dead ends: 1371 [2018-10-04 09:21:24,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:21:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-04 09:21:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-10-04 09:21:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-04 09:21:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-10-04 09:21:25,212 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-10-04 09:21:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:25,213 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-10-04 09:21:25,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:21:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-10-04 09:21:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:21:25,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:25,219 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:21:25,220 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:25,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-10-04 09:21:25,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:25,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:21:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 09:21:25,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:25,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:21:25,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:25,411 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-10-04 09:21:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:25,760 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-10-04 09:21:25,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:25,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 09:21:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:25,767 INFO L225 Difference]: With dead ends: 2161 [2018-10-04 09:21:25,768 INFO L226 Difference]: Without dead ends: 975 [2018-10-04 09:21:25,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-04 09:21:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-10-04 09:21:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-04 09:21:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-10-04 09:21:25,968 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-10-04 09:21:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:25,969 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-10-04 09:21:25,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-10-04 09:21:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:21:25,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:21:25,971 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 09:21:25,971 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:21:25,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:21:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-10-04 09:21:25,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:21:25,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:21:25,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:25,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:21:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:21:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:21:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 09:21:26,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:21:26,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:21:26,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:21:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:21:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:26,053 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-10-04 09:21:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:21:26,075 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-10-04 09:21:26,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:21:26,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-04 09:21:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:21:26,076 INFO L225 Difference]: With dead ends: 799 [2018-10-04 09:21:26,076 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:21:26,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:21:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:21:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:21:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:21:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:21:26,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-04 09:21:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:21:26,079 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:21:26,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:21:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:21:26,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:21:26,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:21:26,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:26,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:21:28,731 WARN L178 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 09:21:29,303 WARN L178 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:29,803 WARN L178 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 09:21:30,120 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 09:21:30,425 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 09:21:30,543 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 09:21:30,752 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-04 09:21:30,900 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:21:31,185 WARN L178 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-04 09:21:31,435 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-04 09:21:31,540 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 09:21:31,704 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-04 09:21:31,707 INFO L421 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-10-04 09:21:31,708 INFO L421 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:21:31,708 INFO L421 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-10-04 09:21:31,708 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-10-04 09:21:31,708 INFO L421 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse7))) [2018-10-04 09:21:31,708 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-10-04 09:21:31,708 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-10-04 09:21:31,709 INFO L421 ceAbstractionStarter]: At program point L429(lines 429 436) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-10-04 09:21:31,709 INFO L421 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-04 09:21:31,709 INFO L421 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-10-04 09:21:31,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-10-04 09:21:31,709 INFO L421 ceAbstractionStarter]: At program point L413(lines 407 414) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-10-04 09:21:31,709 INFO L421 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:31,709 INFO L421 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-10-04 09:21:31,710 INFO L421 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-10-04 09:21:31,710 INFO L421 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:21:31,710 INFO L421 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:21:31,710 INFO L421 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:21:31,710 INFO L421 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-10-04 09:21:31,720 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,721 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,728 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,731 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,733 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,737 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,740 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,743 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,744 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,746 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,749 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,750 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,751 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,752 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,753 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,754 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,755 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,757 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,758 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,760 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,763 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,765 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,766 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,769 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:21:31 BoogieIcfgContainer [2018-10-04 09:21:31,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:21:31,770 INFO L168 Benchmark]: Toolchain (without parser) took 14165.90 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 194.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -219.1 MB). Peak memory consumption was 631.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:31,772 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:21:31,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:21:31,773 INFO L168 Benchmark]: Boogie Preprocessor took 66.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:21:31,773 INFO L168 Benchmark]: RCFGBuilder took 698.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:31,774 INFO L168 Benchmark]: TraceAbstraction took 13337.15 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 194.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -250.8 MB). Peak memory consumption was 600.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:21:31,778 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 698.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13337.15 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 194.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -250.8 MB). Peak memory consumption was 600.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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 398]: Loop Invariant [2018-10-04 09:21:31,789 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,789 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,791 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,791 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-10-04 09:21:31,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,793 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,794 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,794 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: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-10-04 09:21:31,796 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,797 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,798 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,798 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-10-04 09:21:31,800 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,801 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,802 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,802 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-10-04 09:21:31,804 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,804 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,805 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,805 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-10-04 09:21:31,806 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,806 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,807 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,807 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: 358]: Loop Invariant [2018-10-04 09:21:31,808 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,808 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,809 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,809 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-10-04 09:21:31,811 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,811 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,812 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 09:21:31,812 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256))) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 13.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-21-31-819.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-21-31-819.csv Received shutdown request...