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.4.1.ufo.UNBOUNDED.pals.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:46:58,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:46:58,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:46:58,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:46:58,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:46:58,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:46:58,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:46:58,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:46:58,756 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:46:58,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:46:58,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:46:58,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:46:58,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:46:58,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:46:58,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:46:58,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:46:58,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:46:58,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:46:58,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:46:58,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:46:58,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:46:58,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:46:58,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:46:58,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:46:58,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:46:58,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:46:58,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:46:58,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:46:58,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:46:58,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:46:58,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:46:58,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:46:58,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:46:58,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:46:58,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:46:58,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:46:58,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:46:58,824 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:46:58,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:46:58,825 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:46:58,825 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:46:58,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:46:58,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:46:58,826 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:46:58,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:46:58,826 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:46:58,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:46:58,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:46:58,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:46:58,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:46:58,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:46:58,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:46:58,828 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:46:58,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:46:58,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:46:58,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:46:58,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:46:58,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:46:58,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:46:58,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:58,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:46:58,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:46:58,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:46:58,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:46:58,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:46:58,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:46:58,830 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:46:58,830 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:46:58,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:46:58,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:46:58,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:46:58,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:46:58,891 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:46:58,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl [2018-10-04 09:46:58,893 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl' [2018-10-04 09:46:58,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:46:58,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:46:58,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:58,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:46:58,973 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:46:58,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:46:59,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:46:59,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:46:59,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:46:59,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... [2018-10-04 09:46:59,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:46:59,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:46:59,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:46:59,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:46:59,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:46:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:46:59,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:46:59,810 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:46:59,811 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:59 BoogieIcfgContainer [2018-10-04 09:46:59,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:46:59,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:46:59,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:46:59,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:46:59,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:46:58" (1/2) ... [2018-10-04 09:46:59,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec8a0e and model type pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:46:59, skipping insertion in model container [2018-10-04 09:46:59,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:46:59" (2/2) ... [2018-10-04 09:46:59,819 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl [2018-10-04 09:46:59,828 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:46:59,835 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:46:59,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:46:59,886 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:46:59,886 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:46:59,886 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:46:59,886 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:46:59,887 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:46:59,887 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:46:59,887 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:46:59,887 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:46:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 09:46:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:46:59,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:46:59,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:46:59,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:46:59,922 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:46:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-04 09:46:59,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:46:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:46:59,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:46:59,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:46:59,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:00,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:00,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:00,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:00,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:00,175 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 09:47:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:00,239 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-04 09:47:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:00,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:47:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:00,254 INFO L225 Difference]: With dead ends: 48 [2018-10-04 09:47:00,254 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:47:00,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:47:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-04 09:47:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:47:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-04 09:47:00,298 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-04 09:47:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:00,298 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-04 09:47:00,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-04 09:47:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:47:00,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:00,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:00,300 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:00,300 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-04 09:47:00,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:00,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:00,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:00,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:00,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:00,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:00,427 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:00,427 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-04 09:47:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:00,489 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-04 09:47:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:00,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:47:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:00,496 INFO L225 Difference]: With dead ends: 85 [2018-10-04 09:47:00,496 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:47:00,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:47:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-04 09:47:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 09:47:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-04 09:47:00,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-04 09:47:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:00,517 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-04 09:47:00,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 09:47:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:47:00,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:00,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:00,518 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:00,519 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-04 09:47:00,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:00,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:00,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:00,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:00,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:00,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:00,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:00,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:00,709 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-04 09:47:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:00,798 INFO L93 Difference]: Finished difference Result 139 states and 197 transitions. [2018-10-04 09:47:00,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:00,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:47:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:00,802 INFO L225 Difference]: With dead ends: 139 [2018-10-04 09:47:00,802 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:47:00,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:47:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-04 09:47:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 09:47:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2018-10-04 09:47:00,823 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 15 [2018-10-04 09:47:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:00,824 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2018-10-04 09:47:00,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2018-10-04 09:47:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:47:00,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:00,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:00,826 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:00,826 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:00,827 INFO L82 PathProgramCache]: Analyzing trace with hash 774424133, now seen corresponding path program 1 times [2018-10-04 09:47:00,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:00,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:00,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:00,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:47:00,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:47:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:47:00,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:00,994 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 4 states. [2018-10-04 09:47:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:01,138 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2018-10-04 09:47:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:47:01,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-04 09:47:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:01,141 INFO L225 Difference]: With dead ends: 155 [2018-10-04 09:47:01,141 INFO L226 Difference]: Without dead ends: 153 [2018-10-04 09:47:01,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:47:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-04 09:47:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 91. [2018-10-04 09:47:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 09:47:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2018-10-04 09:47:01,180 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 15 [2018-10-04 09:47:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:01,181 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2018-10-04 09:47:01,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:47:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2018-10-04 09:47:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:47:01,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:01,186 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:01,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:01,186 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 263176883, now seen corresponding path program 1 times [2018-10-04 09:47:01,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:01,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:01,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:01,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:01,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:01,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:01,328 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:01,328 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand 3 states. [2018-10-04 09:47:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:01,400 INFO L93 Difference]: Finished difference Result 267 states and 357 transitions. [2018-10-04 09:47:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:01,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 09:47:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:01,403 INFO L225 Difference]: With dead ends: 267 [2018-10-04 09:47:01,404 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 09:47:01,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 09:47:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-04 09:47:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 09:47:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-04 09:47:01,445 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 28 [2018-10-04 09:47:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:01,446 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-04 09:47:01,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-04 09:47:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:47:01,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:01,448 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:01,449 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:01,449 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash -437887695, now seen corresponding path program 1 times [2018-10-04 09:47:01,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:01,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:01,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:01,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:01,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:01,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:01,596 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-04 09:47:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:01,716 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-04 09:47:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:01,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-04 09:47:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:01,720 INFO L225 Difference]: With dead ends: 525 [2018-10-04 09:47:01,720 INFO L226 Difference]: Without dead ends: 351 [2018-10-04 09:47:01,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-04 09:47:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-04 09:47:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-04 09:47:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-04 09:47:01,820 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-04 09:47:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:01,821 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-04 09:47:01,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-04 09:47:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:47:01,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:01,824 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, 1, 1] [2018-10-04 09:47:01,824 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:01,824 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2082072239, now seen corresponding path program 1 times [2018-10-04 09:47:01,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:01,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:01,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:02,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:02,072 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:02,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 09:47:02,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:02,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 09:47:02,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:47:02,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:47:02,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:02,685 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 7 states. [2018-10-04 09:47:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:05,252 INFO L93 Difference]: Finished difference Result 791 states and 1017 transitions. [2018-10-04 09:47:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:47:05,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-04 09:47:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:05,254 INFO L225 Difference]: With dead ends: 791 [2018-10-04 09:47:05,255 INFO L226 Difference]: Without dead ends: 287 [2018-10-04 09:47:05,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.6s impTime 16 [2018-10-04 09:47:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-04 09:47:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2018-10-04 09:47:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-04 09:47:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2018-10-04 09:47:05,311 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 28 [2018-10-04 09:47:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:05,311 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2018-10-04 09:47:05,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:47:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2018-10-04 09:47:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 09:47:05,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:05,314 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:47:05,315 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:05,315 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1799101551, now seen corresponding path program 2 times [2018-10-04 09:47:05,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:05,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:05,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:05,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:05,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-04 09:47:05,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:05,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:05,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:05,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:05,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:05,391 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 3 states. [2018-10-04 09:47:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:05,401 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2018-10-04 09:47:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:05,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-04 09:47:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:05,402 INFO L225 Difference]: With dead ends: 266 [2018-10-04 09:47:05,402 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:47:05,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:47:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:47:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:47:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:47:05,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-10-04 09:47:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:05,405 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:47:05,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:47:05,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:47:05,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:47:06,975 WARN L178 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-10-04 09:47:07,213 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-04 09:47:07,365 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:47:07,572 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 09:47:07,835 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-10-04 09:47:08,109 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-04 09:47:08,248 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 09:47:08,520 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:47:08,865 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:47:09,145 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-04 09:47:09,149 INFO L421 ceAbstractionStarter]: At program point L316(lines 308 317) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 09:47:09,149 INFO L421 ceAbstractionStarter]: At program point L250(lines 242 251) the Hoare annotation is: (let ((.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse7 (<= 1 ~mode2)) (.cse8 (<= ~mode2 1)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse7 .cse8 .cse3 .cse4) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse4))) [2018-10-04 09:47:09,149 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 370) the Hoare annotation is: false [2018-10-04 09:47:09,150 INFO L421 ceAbstractionStarter]: At program point L255(lines 255 265) the Hoare annotation is: (let ((.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse7 (<= 1 ~mode2)) (.cse8 (<= ~mode2 1)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~85) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ~mode1 (* 256 (div ~mode1 256))) .cse7 .cse8 .cse3 .cse4) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 (= ~mode2 (* 256 (div ~mode2 256))) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse3 .cse4))) [2018-10-04 09:47:09,150 INFO L421 ceAbstractionStarter]: At program point L350(lines 345 351) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 09:47:09,150 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 372) no Hoare annotation was computed. [2018-10-04 09:47:09,150 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 372) no Hoare annotation was computed. [2018-10-04 09:47:09,150 INFO L421 ceAbstractionStarter]: At program point L272(lines 264 273) the Hoare annotation is: (let ((.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse0 (= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= 1 ULTIMATE.start_check_~tmp~85) .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:47:09,151 INFO L421 ceAbstractionStarter]: At program point L330(lines 330 336) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 09:47:09,151 INFO L421 ceAbstractionStarter]: At program point L231(lines 231 243) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-04 09:47:09,151 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 372) no Hoare annotation was computed. [2018-10-04 09:47:09,151 INFO L421 ceAbstractionStarter]: At program point L277(lines 277 287) the Hoare annotation is: (let ((.cse7 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse0 (= ULTIMATE.start_assert_~arg 1) .cse1 .cse2 (<= 1 ULTIMATE.start_check_~tmp~85) .cse3 .cse4 .cse5 .cse6))) [2018-10-04 09:47:09,151 INFO L421 ceAbstractionStarter]: At program point L339(lines 335 346) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 (exists ((v_~r1_9 Int)) (let ((.cse6 (mod v_~r1_9 256))) (and (= (+ .cse6 1) ~r1) (<= .cse6 0)))) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 09:47:09,152 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 367) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~85) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-04 09:47:09,152 INFO L421 ceAbstractionStarter]: At program point L294(lines 286 295) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 09:47:09,152 INFO L421 ceAbstractionStarter]: At program point L369(lines 224 369) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-04 09:47:09,152 INFO L421 ceAbstractionStarter]: At program point L299(lines 299 309) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 09:47:09,153 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 371) no Hoare annotation was computed. [2018-10-04 09:47:09,169 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,171 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,183 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,183 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,193 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,194 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,200 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,201 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,202 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,203 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,206 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,207 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,212 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,216 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,217 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,218 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,225 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,225 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,230 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,230 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,232 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,232 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,234 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,234 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,240 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,241 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,242 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,242 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,243 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,243 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,247 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,248 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,252 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,252 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,253 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,253 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,261 INFO L202 PluginConnector]: Adding new model pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:09 BoogieIcfgContainer [2018-10-04 09:47:09,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:09,263 INFO L168 Benchmark]: Toolchain (without parser) took 10292.21 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 40.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -18.2 MB). Peak memory consumption was 489.6 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:09,264 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:09,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:09,266 INFO L168 Benchmark]: Boogie Preprocessor took 34.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:09,266 INFO L168 Benchmark]: RCFGBuilder took 754.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:09,267 INFO L168 Benchmark]: TraceAbstraction took 9449.90 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 40.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -49.9 MB). Peak memory consumption was 457.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:09,272 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 754.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9449.90 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 40.9 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -49.9 MB). Peak memory consumption was 457.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 371]: 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: 242]: Loop Invariant [2018-10-04 09:47:09,282 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,282 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 264]: Loop Invariant [2018-10-04 09:47:09,285 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,285 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,286 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,286 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 286]: Loop Invariant [2018-10-04 09:47:09,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,287 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 330]: Loop Invariant [2018-10-04 09:47:09,290 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,290 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,291 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,291 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 255]: Loop Invariant [2018-10-04 09:47:09,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 277]: Loop Invariant [2018-10-04 09:47:09,295 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,295 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,296 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~85) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~85) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 335]: Loop Invariant [2018-10-04 09:47:09,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,298 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,298 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 299]: Loop Invariant [2018-10-04 09:47:09,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,300 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,300 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~85) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 308]: Loop Invariant [2018-10-04 09:47:09,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,302 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] [2018-10-04 09:47:09,302 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_9,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 9.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 209 SDtfs, 199 SDslu, 164 SDs, 0 SdLazy, 212 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 93 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 176 NumberOfFragments, 1074 HoareAnnotationTreeSize, 14 FomulaSimplifications, 7061 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 217 ConstructedInterpolants, 8 QuantifiedInterpolants, 19798 SizeOfPredicates, 1 NumberOfNonLiveVariables, 251 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 118/130 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.4.1.ufo.UNBOUNDED.pals.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-09-308.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.1.ufo.UNBOUNDED.pals.c_16.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-09-308.csv Received shutdown request...