java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:13:55,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:13:55,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:13:55,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:13:55,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:13:55,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:13:55,446 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:13:55,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:13:55,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:13:55,450 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:13:55,451 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:13:55,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:13:55,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:13:55,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:13:55,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:13:55,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:13:55,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:13:55,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:13:55,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:13:55,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:13:55,469 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:13:55,471 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:13:55,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:13:55,474 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:13:55,474 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:13:55,477 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:13:55,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:13:55,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:13:55,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:13:55,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:13:55,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:13:55,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:13:55,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:13:55,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:13:55,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:13:55,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:13:55,489 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:13:55,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:13:55,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:13:55,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:13:55,517 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:13:55,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:13:55,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:13:55,518 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:13:55,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:13:55,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:13:55,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:13:55,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:13:55,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:13:55,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:13:55,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:13:55,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:13:55,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:13:55,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:13:55,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:13:55,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:13:55,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:13:55,521 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:13:55,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:13:55,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:13:55,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:13:55,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:13:55,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:13:55,522 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:13:55,522 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:13:55,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:13:55,523 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:13:55,523 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:13:55,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:13:55,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:13:55,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:13:55,600 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:13:55,600 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:13:55,601 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.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-10-03 09:13:55,601 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl' [2018-10-03 09:13:55,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:13:55,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:13:55,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:13:55,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:13:55,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:13:55,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:13:55,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:13:55,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:13:55,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:13:55,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/1) ... [2018-10-03 09:13:55,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:13:55,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:13:55,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:13:55,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:13:55,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (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-03 09:13:55,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:13:55,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:13:56,422 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:13:56,423 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:13:56 BoogieIcfgContainer [2018-10-03 09:13:56,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:13:56,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:13:56,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:13:56,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:13:56,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:13:55" (1/2) ... [2018-10-03 09:13:56,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f5c1e8 and model type pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:13:56, skipping insertion in model container [2018-10-03 09:13:56,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:13:56" (2/2) ... [2018-10-03 09:13:56,431 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-10-03 09:13:56,441 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:13:56,451 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:13:56,502 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:13:56,503 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:13:56,503 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:13:56,503 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:13:56,503 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:13:56,504 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:13:56,504 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:13:56,504 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:13:56,504 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:13:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-03 09:13:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:13:56,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:56,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:56,545 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:56,555 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-03 09:13:56,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:56,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:56,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:56,821 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-03 09:13:56,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:13:56,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:13:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:13:56,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:56,844 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-03 09:13:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:56,901 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-03 09:13:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:13:56,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-03 09:13:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:56,918 INFO L225 Difference]: With dead ends: 45 [2018-10-03 09:13:56,919 INFO L226 Difference]: Without dead ends: 29 [2018-10-03 09:13:56,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:13:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-03 09:13:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-03 09:13:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-03 09:13:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-03 09:13:56,958 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-03 09:13:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:56,959 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-03 09:13:56,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:13:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-03 09:13:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:13:56,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:56,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:56,960 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:56,960 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-03 09:13:56,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:56,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:56,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:57,066 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-03 09:13:57,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:57,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:13:57,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:13:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:13:57,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:57,069 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-03 09:13:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:57,103 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-10-03 09:13:57,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:13:57,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-03 09:13:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:57,106 INFO L225 Difference]: With dead ends: 79 [2018-10-03 09:13:57,106 INFO L226 Difference]: Without dead ends: 53 [2018-10-03 09:13:57,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:13:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-03 09:13:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-03 09:13:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-03 09:13:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-10-03 09:13:57,122 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-10-03 09:13:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:57,122 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-10-03 09:13:57,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:13:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-10-03 09:13:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:13:57,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:57,123 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:57,124 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:57,124 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-10-03 09:13:57,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:57,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:57,334 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-03 09:13:57,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:57,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:13:57,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:13:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:13:57,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:57,336 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-10-03 09:13:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:57,506 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-03 09:13:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:13:57,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-03 09:13:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:57,511 INFO L225 Difference]: With dead ends: 109 [2018-10-03 09:13:57,511 INFO L226 Difference]: Without dead ends: 107 [2018-10-03 09:13:57,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-03 09:13:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-03 09:13:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-03 09:13:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-03 09:13:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-10-03 09:13:57,556 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-10-03 09:13:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:57,559 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-10-03 09:13:57,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:13:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-10-03 09:13:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:13:57,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:57,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:57,560 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:57,561 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-10-03 09:13:57,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:57,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:57,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:57,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:57,687 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-03 09:13:57,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:57,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:13:57,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:13:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:13:57,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:57,689 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-10-03 09:13:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:57,779 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-10-03 09:13:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:13:57,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-03 09:13:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:57,781 INFO L225 Difference]: With dead ends: 143 [2018-10-03 09:13:57,781 INFO L226 Difference]: Without dead ends: 85 [2018-10-03 09:13:57,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:13:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-03 09:13:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-03 09:13:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-03 09:13:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-03 09:13:57,816 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-10-03 09:13:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:57,818 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-03 09:13:57,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:13:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-03 09:13:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 09:13:57,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:57,820 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:57,820 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:57,820 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-10-03 09:13:57,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:57,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:57,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:13:57,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:13:57,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:13:57,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:13:57,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:57,930 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-03 09:13:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:58,006 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-10-03 09:13:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:13:58,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-03 09:13:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:58,011 INFO L225 Difference]: With dead ends: 249 [2018-10-03 09:13:58,011 INFO L226 Difference]: Without dead ends: 167 [2018-10-03 09:13:58,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:13:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-03 09:13:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-03 09:13:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-03 09:13:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-10-03 09:13:58,071 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-10-03 09:13:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:58,072 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-10-03 09:13:58,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:13:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-10-03 09:13:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 09:13:58,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:58,074 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:58,074 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:58,074 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-10-03 09:13:58,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:58,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:58,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:58,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:13:58,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:13:58,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:13:58,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:13:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:13:58,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:58,182 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-10-03 09:13:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:13:58,322 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-10-03 09:13:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:13:58,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-03 09:13:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:13:58,325 INFO L225 Difference]: With dead ends: 489 [2018-10-03 09:13:58,325 INFO L226 Difference]: Without dead ends: 327 [2018-10-03 09:13:58,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:13:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-03 09:13:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-03 09:13:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-03 09:13:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-10-03 09:13:58,409 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-10-03 09:13:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:13:58,409 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-10-03 09:13:58,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:13:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-10-03 09:13:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 09:13:58,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:13:58,412 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:13:58,412 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:13:58,412 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:13:58,413 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-10-03 09:13:58,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:13:58,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:13:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:58,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:13:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:13:58,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:13:58,687 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-03 09:13:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:13:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:13:58,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:13:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:13:59,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:13:59,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-03 09:13:59,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:13:59,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:13:59,571 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:13:59,571 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-10-03 09:14:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:00,681 INFO L93 Difference]: Finished difference Result 537 states and 678 transitions. [2018-10-03 09:14:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:14:00,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-03 09:14:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:00,684 INFO L225 Difference]: With dead ends: 537 [2018-10-03 09:14:00,684 INFO L226 Difference]: Without dead ends: 311 [2018-10-03 09:14:00,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 7 [2018-10-03 09:14:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-03 09:14:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 269. [2018-10-03 09:14:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-03 09:14:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2018-10-03 09:14:00,792 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 26 [2018-10-03 09:14:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:00,793 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2018-10-03 09:14:00,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:14:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2018-10-03 09:14:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 09:14:00,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:00,795 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:00,796 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:00,796 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1785005239, now seen corresponding path program 2 times [2018-10-03 09:14:00,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:00,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:00,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:00,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-03 09:14:00,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:00,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:14:00,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:00,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:00,892 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand 3 states. [2018-10-03 09:14:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:01,029 INFO L93 Difference]: Finished difference Result 505 states and 622 transitions. [2018-10-03 09:14:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:01,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-03 09:14:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:01,032 INFO L225 Difference]: With dead ends: 505 [2018-10-03 09:14:01,032 INFO L226 Difference]: Without dead ends: 239 [2018-10-03 09:14:01,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-03 09:14:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 213. [2018-10-03 09:14:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-03 09:14:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2018-10-03 09:14:01,119 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 26 [2018-10-03 09:14:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:01,119 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2018-10-03 09:14:01,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2018-10-03 09:14:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-03 09:14:01,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:01,123 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:01,123 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:01,123 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1148384469, now seen corresponding path program 3 times [2018-10-03 09:14:01,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:01,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:01,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:01,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:14:01,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-03 09:14:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:01,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:14:01,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:01,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:01,237 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 3 states. [2018-10-03 09:14:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:01,271 INFO L93 Difference]: Finished difference Result 235 states and 275 transitions. [2018-10-03 09:14:01,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:01,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-03 09:14:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:01,272 INFO L225 Difference]: With dead ends: 235 [2018-10-03 09:14:01,272 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:14:01,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:14:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:14:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:14:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:14:01,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-10-03 09:14:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:01,275 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:14:01,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:14:01,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:14:01,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:14:01,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:14:02,023 WARN L178 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-03 09:14:02,253 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-10-03 09:14:02,545 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-03 09:14:02,825 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-03 09:14:03,001 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-10-03 09:14:03,253 INFO L421 ceAbstractionStarter]: At program point L353(lines 353 360) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1))) [2018-10-03 09:14:03,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 389) no Hoare annotation was computed. [2018-10-03 09:14:03,253 INFO L421 ceAbstractionStarter]: At program point L316(lines 310 317) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-03 09:14:03,254 INFO L421 ceAbstractionStarter]: At program point L380(lines 380 387) the Hoare annotation is: false [2018-10-03 09:14:03,254 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 291) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-03 09:14:03,254 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 381) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ULTIMATE.start_check_~tmp~100 1) (<= 1 ~mode4) (<= 0 ~send4) (= 0 (+ ~nomsg 1)) (<= ~r1 0) (<= 1 ~mode1) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~100)) [2018-10-03 09:14:03,254 INFO L421 ceAbstractionStarter]: At program point L339(lines 330 340) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode4) (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p4_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (= 0 (+ ~nomsg 1))) [2018-10-03 09:14:03,255 INFO L421 ceAbstractionStarter]: At program point L364(lines 359 365) the Hoare annotation is: (and (<= ~r1 0) (<= ULTIMATE.start_check_~tmp~100 1) (<= 1 ~mode4) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (<= ~mode4 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~100)) [2018-10-03 09:14:03,255 INFO L421 ceAbstractionStarter]: At program point L296(lines 290 297) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-03 09:14:03,255 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 272) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (exists ((v_prenex_1 Int)) (let ((.cse1 (mod v_prenex_1 256))) (and (<= .cse1 127) (<= v_prenex_1 127) (= .cse1 ~p4_old) (<= 0 v_prenex_1)))) (<= 1 ~mode4) (<= 1 ~mode1) .cse2 (<= ~mode1 1) .cse3 (<= ~mode4 1) .cse4) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-03 09:14:03,256 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 388) no Hoare annotation was computed. [2018-10-03 09:14:03,256 INFO L421 ceAbstractionStarter]: At program point L321(lines 321 331) the Hoare annotation is: (and (<= ~r1 0) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-03 09:14:03,256 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 389) no Hoare annotation was computed. [2018-10-03 09:14:03,256 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 389) no Hoare annotation was computed. [2018-10-03 09:14:03,256 INFO L421 ceAbstractionStarter]: At program point L276(lines 271 277) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-03 09:14:03,257 INFO L421 ceAbstractionStarter]: At program point L301(lines 301 311) the Hoare annotation is: (and (<= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 1 ~mode1) (<= 0 ~send4) (<= ~mode1 1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-10-03 09:14:03,257 INFO L421 ceAbstractionStarter]: At program point L386(lines 254 386) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (exists ((v_prenex_1 Int)) (let ((.cse1 (mod v_prenex_1 256))) (and (<= .cse1 127) (<= v_prenex_1 127) (= .cse1 ~p4_old) (<= 0 v_prenex_1)))) (<= 1 ~mode4) (<= 1 ~mode1) .cse2 (<= ~mode1 1) .cse3 (<= ~mode4 1) .cse4) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 .cse4 (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-03 09:14:03,264 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,265 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,272 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,276 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,276 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,279 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,279 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,280 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,280 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,282 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,282 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,282 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,298 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,298 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,298 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,304 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,304 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,304 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,305 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,309 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,309 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,310 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,310 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,311 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,311 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,316 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,316 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,322 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:14:03 BoogieIcfgContainer [2018-10-03 09:14:03,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:14:03,324 INFO L168 Benchmark]: Toolchain (without parser) took 7628.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 446.6 MB). Peak memory consumption was 446.6 MB. Max. memory is 7.1 GB. [2018-10-03 09:14:03,328 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:14:03,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:14:03,330 INFO L168 Benchmark]: Boogie Preprocessor took 32.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:14:03,334 INFO L168 Benchmark]: RCFGBuilder took 645.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-03 09:14:03,335 INFO L168 Benchmark]: TraceAbstraction took 6898.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 404.4 MB). Peak memory consumption was 404.4 MB. Max. memory is 7.1 GB. [2018-10-03 09:14:03,344 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 645.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6898.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 404.4 MB). Peak memory consumption was 404.4 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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 388]: 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: 261]: Loop Invariant [2018-10-03 09:14:03,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) || ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 254]: Loop Invariant [2018-10-03 09:14:03,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,380 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((~r1 <= 0 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1) || ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 359]: Loop Invariant [2018-10-03 09:14:03,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,388 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,389 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((~r1 <= 0 && check_~tmp~100 <= 1) && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~100 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 353]: Loop Invariant [2018-10-03 09:14:03,393 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,393 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,393 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode4) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1 - InvariantResult [Line: 374]: Loop Invariant [2018-10-03 09:14:03,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,401 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,402 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,405 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,406 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((assert_~arg <= 1 && check_~tmp~100 <= 1) && 1 <= ~mode4) && 0 <= ~send4) && 0 == ~nomsg + 1) && ~r1 <= 0) && 1 <= ~mode1) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 1 <= assert_~arg) && 1 <= check_~tmp~100 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 330]: Loop Invariant [2018-10-03 09:14:03,407 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,408 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,411 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-03 09:14:03,412 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((~r1 <= 0 && 1 <= ~mode4) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && ~mode4 <= 1) && 0 == ~nomsg + 1 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((~r1 <= 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode1) && 0 <= ~send4) && ~mode1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 118 SDslu, 164 SDs, 0 SdLazy, 91 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 124 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 37 NumberOfFragments, 560 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1008 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 236 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 6 QuantifiedInterpolants, 26180 SizeOfPredicates, 4 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 92/96 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.4.2.ufo.BOUNDED-8.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-14-03-421.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-14-03-421.csv Received shutdown request...