java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:48:36,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:48:36,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:48:36,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:48:36,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:48:36,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:48:36,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:48:36,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:48:36,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:48:36,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:48:36,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:48:36,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:48:36,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:48:36,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:48:36,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:48:36,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:48:36,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:48:36,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:48:36,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:48:36,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:48:36,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:48:36,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:48:36,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:48:36,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:48:36,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:48:36,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:48:36,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:48:36,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:48:36,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:48:36,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:48:36,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:48:36,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:48:36,636 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:48:36,636 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:48:36,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:48:36,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:48:36,638 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:48:36,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:48:36,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:48:36,667 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:48:36,667 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:48:36,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:48:36,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:48:36,668 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:48:36,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:48:36,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:48:36,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:48:36,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:48:36,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:48:36,669 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:48:36,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:48:36,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:48:36,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:48:36,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:48:36,670 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:48:36,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:48:36,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:48:36,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:48:36,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:48:36,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:48:36,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:48:36,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:48:36,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:48:36,672 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:48:36,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:48:36,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:48:36,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:48:36,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:48:36,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:48:36,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:48:36,732 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:48:36,733 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:48:36,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-03 08:48:36,734 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl' [2018-10-03 08:48:36,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:48:36,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:48:36,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:48:36,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:48:36,816 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:48:36,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:48:36,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:48:36,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:48:36,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:48:36,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/1) ... [2018-10-03 08:48:36,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:48:36,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:48:36,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:48:36,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:48:36,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (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 08:48:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:48:37,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:48:37,677 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:48:37,677 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:48:37 BoogieIcfgContainer [2018-10-03 08:48:37,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:48:37,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:48:37,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:48:37,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:48:37,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:48:36" (1/2) ... [2018-10-03 08:48:37,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e8b42e and model type pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:48:37, skipping insertion in model container [2018-10-03 08:48:37,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:48:37" (2/2) ... [2018-10-03 08:48:37,685 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-03 08:48:37,695 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:48:37,703 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:48:37,753 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:48:37,754 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:48:37,754 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:48:37,754 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:48:37,754 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:48:37,754 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:48:37,755 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:48:37,755 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:48:37,755 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:48:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-03 08:48:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:48:37,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:37,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:37,779 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:37,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-03 08:48:37,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:37,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:37,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:37,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:48:38,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,101 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-03 08:48:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,170 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-03 08:48:38,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-03 08:48:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,183 INFO L225 Difference]: With dead ends: 54 [2018-10-03 08:48:38,184 INFO L226 Difference]: Without dead ends: 35 [2018-10-03 08:48:38,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-03 08:48:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-03 08:48:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-03 08:48:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-03 08:48:38,229 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-03 08:48:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,229 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-03 08:48:38,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-03 08:48:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:48:38,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,231 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-03 08:48:38,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,325 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 08:48:38,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,329 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-03 08:48:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,392 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-03 08:48:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-03 08:48:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,396 INFO L225 Difference]: With dead ends: 97 [2018-10-03 08:48:38,396 INFO L226 Difference]: Without dead ends: 65 [2018-10-03 08:48:38,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-03 08:48:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-03 08:48:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-03 08:48:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-03 08:48:38,423 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-03 08:48:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,424 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-03 08:48:38,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-03 08:48:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:48:38,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,426 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,426 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-03 08:48:38,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,525 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 08:48:38,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,528 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-03 08:48:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,611 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-03 08:48:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-03 08:48:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,619 INFO L225 Difference]: With dead ends: 187 [2018-10-03 08:48:38,619 INFO L226 Difference]: Without dead ends: 125 [2018-10-03 08:48:38,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-03 08:48:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-03 08:48:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-03 08:48:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-03 08:48:38,679 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-03 08:48:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,682 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-03 08:48:38,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-03 08:48:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:48:38,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,685 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,685 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-03 08:48:38,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:38,799 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 08:48:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:38,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:38,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,801 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-03 08:48:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:38,887 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-03 08:48:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:38,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-03 08:48:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:38,891 INFO L225 Difference]: With dead ends: 367 [2018-10-03 08:48:38,891 INFO L226 Difference]: Without dead ends: 245 [2018-10-03 08:48:38,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-03 08:48:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-03 08:48:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-03 08:48:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-03 08:48:38,952 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-03 08:48:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:38,954 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-03 08:48:38,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-03 08:48:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:48:38,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:38,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:38,956 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:38,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-03 08:48:38,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:39,114 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 08:48:39,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:39,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:48:39,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:48:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:48:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:48:39,116 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-03 08:48:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:39,348 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-03 08:48:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:48:39,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-03 08:48:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:39,354 INFO L225 Difference]: With dead ends: 517 [2018-10-03 08:48:39,354 INFO L226 Difference]: Without dead ends: 515 [2018-10-03 08:48:39,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:48:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-03 08:48:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-03 08:48:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-03 08:48:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-03 08:48:39,436 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-03 08:48:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:39,442 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-03 08:48:39,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:48:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-03 08:48:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:48:39,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:39,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:39,443 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:39,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-03 08:48:39,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:39,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:39,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:39,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-03 08:48:39,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:39,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:39,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:48:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:48:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:48:39,709 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-03 08:48:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:40,047 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-10-03 08:48:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 08:48:40,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-03 08:48:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:40,051 INFO L225 Difference]: With dead ends: 799 [2018-10-03 08:48:40,051 INFO L226 Difference]: Without dead ends: 525 [2018-10-03 08:48:40,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:48:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-03 08:48:40,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-10-03 08:48:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-03 08:48:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-10-03 08:48:40,127 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-10-03 08:48:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:40,127 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-10-03 08:48:40,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:48:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-10-03 08:48:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-03 08:48:40,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:40,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:40,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:40,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-10-03 08:48:40,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:40,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:40,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:40,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:40,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:48:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:40,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:48:40,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:40,290 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-10-03 08:48:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:40,494 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-10-03 08:48:40,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:40,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-03 08:48:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:40,501 INFO L225 Difference]: With dead ends: 1207 [2018-10-03 08:48:40,501 INFO L226 Difference]: Without dead ends: 805 [2018-10-03 08:48:40,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-10-03 08:48:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-10-03 08:48:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-10-03 08:48:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-10-03 08:48:40,659 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-10-03 08:48:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:40,660 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-10-03 08:48:40,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-10-03 08:48:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-03 08:48:40,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:40,667 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:48:40,671 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:40,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-10-03 08:48:40,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:40,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:48:40,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:48:40,849 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 08:48:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:40,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:48:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-03 08:48:41,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:48:41,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-03 08:48:41,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:48:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:48:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:48:41,225 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 7 states. [2018-10-03 08:48:41,441 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-03 08:48:41,837 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-03 08:48:42,312 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-03 08:48:43,656 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-03 08:48:43,957 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-03 08:48:44,557 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-03 08:48:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:44,650 INFO L93 Difference]: Finished difference Result 2054 states and 2576 transitions. [2018-10-03 08:48:44,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 08:48:44,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-10-03 08:48:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:44,656 INFO L225 Difference]: With dead ends: 2054 [2018-10-03 08:48:44,656 INFO L226 Difference]: Without dead ends: 845 [2018-10-03 08:48:44,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:48:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-10-03 08:48:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 618. [2018-10-03 08:48:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-03 08:48:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 738 transitions. [2018-10-03 08:48:44,814 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 738 transitions. Word has length 32 [2018-10-03 08:48:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:44,814 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 738 transitions. [2018-10-03 08:48:44,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:48:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 738 transitions. [2018-10-03 08:48:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-03 08:48:44,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:48:44,818 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-03 08:48:44,818 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:48:44,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:48:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash 126939387, now seen corresponding path program 2 times [2018-10-03 08:48:44,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:48:44,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:48:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:44,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:48:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:48:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:48:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-03 08:48:44,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:48:44,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:48:44,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:48:44,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:48:44,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:44,904 INFO L87 Difference]: Start difference. First operand 618 states and 738 transitions. Second operand 3 states. [2018-10-03 08:48:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:48:44,918 INFO L93 Difference]: Finished difference Result 624 states and 744 transitions. [2018-10-03 08:48:44,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:48:44,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-03 08:48:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:48:44,919 INFO L225 Difference]: With dead ends: 624 [2018-10-03 08:48:44,919 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 08:48:44,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:48:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 08:48:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 08:48:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 08:48:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 08:48:44,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-10-03 08:48:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:48:44,921 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 08:48:44,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:48:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 08:48:44,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 08:48:44,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 08:48:46,607 WARN L178 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2018-10-03 08:48:48,004 WARN L178 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-03 08:48:48,642 WARN L178 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-10-03 08:48:48,778 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-10-03 08:48:48,908 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2018-10-03 08:48:49,059 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-10-03 08:48:49,182 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-10-03 08:48:49,309 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-03 08:48:49,447 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 22 [2018-10-03 08:48:49,966 WARN L178 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-10-03 08:48:50,223 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2018-10-03 08:48:50,360 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-10-03 08:48:50,497 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-10-03 08:48:50,595 INFO L421 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:50,595 INFO L421 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 4) .cse5 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:50,596 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:50,596 INFO L421 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 4) .cse5 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:50,596 INFO L421 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-03 08:48:50,596 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-10-03 08:48:50,596 INFO L421 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (= ~r1 0) .cse0 .cse1 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256)))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2))) [2018-10-03 08:48:50,597 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-10-03 08:48:50,597 INFO L421 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:50,597 INFO L421 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~107) (<= ~mode4 1) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:50,597 INFO L421 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-03 08:48:50,597 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-10-03 08:48:50,597 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))) (and (= ~r1 0) .cse0 .cse1 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256)))) (= ~mode4 (* 256 (div ~mode4 256))) .cse2))) [2018-10-03 08:48:50,598 INFO L421 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (let ((.cse5 (<= 1 ~mode4)) (.cse6 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (<= ~r1 4) .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 (= ~mode3 (* 256 (div ~mode3 256))) .cse6 .cse2 .cse3 .cse4) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-03 08:48:50,598 INFO L421 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (let ((.cse5 (<= 1 ~mode4)) (.cse6 (<= ~mode4 1)) (.cse4 (not (= ~p3_old ~nomsg))) (.cse0 (<= ~send3 127)) (.cse1 (not (= ~p3_new ~nomsg))) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (<= ~r1 4) .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 (= ~mode3 (* 256 (div ~mode3 256))) .cse6 .cse2 .cse3 .cse4) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3) (= ~mode4 (* 256 (div ~mode4 256)))))) [2018-10-03 08:48:50,598 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-10-03 08:48:50,598 INFO L421 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (<= 1 ~mode4)) (.cse2 (<= ~mode4 1)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~r1 4) .cse5 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:50,598 INFO L421 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~send3))) (or (and (and (= ~r1 0) .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256)))) .cse1 .cse2) (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse0 (<= 1 ~mode4) (<= ~mode4 1) .cse1 .cse2 (not (= ~p3_old ~nomsg))))) [2018-10-03 08:48:50,598 INFO L421 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= ~mode4 1) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-10-03 08:48:50,598 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-10-03 08:48:50,620 INFO L202 PluginConnector]: Adding new model pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:48:50 BoogieIcfgContainer [2018-10-03 08:48:50,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:48:50,621 INFO L168 Benchmark]: Toolchain (without parser) took 13811.48 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 369.3 MB). Peak memory consumption was 410.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:50,622 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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 08:48:50,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.27 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 08:48:50,623 INFO L168 Benchmark]: Boogie Preprocessor took 59.99 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 08:48:50,624 INFO L168 Benchmark]: RCFGBuilder took 741.35 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:50,625 INFO L168 Benchmark]: TraceAbstraction took 12941.86 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 337.6 MB). Peak memory consumption was 379.0 MB. Max. memory is 7.1 GB. [2018-10-03 08:48:50,629 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.19 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 60.27 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 59.99 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 741.35 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12941.86 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 337.6 MB). Peak memory consumption was 379.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: 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: 379]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && ~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && 0 == ~nomsg + 1) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((~send3 <= 127 && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~send3 <= 127 && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((((assert_~arg <= 1 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~107) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && ~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~send3 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((~send3 <= 127 && 1 <= ~mode4) && ~mode4 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((~r1 == 0 && ~send3 <= 127) && 0 == ~nomsg + 1) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 12.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 285 SDtfs, 262 SDslu, 240 SDs, 0 SdLazy, 213 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=7, 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.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 599 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 431 NumberOfFragments, 926 HoareAnnotationTreeSize, 16 FomulaSimplifications, 28218 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2190 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 21815 SizeOfPredicates, 1 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 117/135 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.5.1.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-48-50-651.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.1.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-48-50-651.csv Received shutdown request...