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.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:55:32,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:55:32,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:55:32,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:55:32,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:55:32,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:55:32,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:55:32,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:55:32,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:55:32,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:55:32,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:55:32,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:55:32,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:55:32,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:55:32,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:55:32,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:55:32,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:55:32,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:55:32,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:55:32,766 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:55:32,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:55:32,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:55:32,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:55:32,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:55:32,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:55:32,773 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:55:32,774 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:55:32,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:55:32,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:55:32,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:55:32,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:55:32,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:55:32,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:55:32,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:55:32,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:55:32,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:55:32,779 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-01 00:55:32,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:55:32,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:55:32,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:55:32,795 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:55:32,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:55:32,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:55:32,796 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:55:32,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:55:32,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:55:32,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:55:32,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:55:32,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:55:32,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:55:32,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:55:32,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:55:32,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:55:32,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:55:32,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:55:32,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:55:32,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:55:32,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:55:32,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:55:32,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:55:32,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:55:32,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:55:32,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:55:32,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:55:32,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:55:32,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:55:32,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:55:32,801 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:55:32,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:55:32,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:55:32,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:55:32,880 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:55:32,881 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:55:32,881 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-01 00:55:32,882 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-10-01 00:55:32,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:55:32,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:55:32,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:32,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:55:32,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:55:32,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:55:33,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:55:33,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:55:33,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:55:33,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/1) ... [2018-10-01 00:55:33,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:55:33,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:55:33,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:55:33,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:55:33,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (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-01 00:55:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:55:33,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:55:33,676 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:55:33,677 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:33 BoogieIcfgContainer [2018-10-01 00:55:33,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:55:33,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:55:33,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:55:33,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:55:33,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:55:32" (1/2) ... [2018-10-01 00:55:33,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625676a2 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:55:33, skipping insertion in model container [2018-10-01 00:55:33,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:55:33" (2/2) ... [2018-10-01 00:55:33,685 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-10-01 00:55:33,694 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:55:33,701 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:55:33,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:55:33,747 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:55:33,747 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:55:33,748 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:55:33,748 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:55:33,748 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:55:33,748 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:55:33,748 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:55:33,748 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:55:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-01 00:55:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:55:33,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:33,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:33,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:33,779 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-10-01 00:55:33,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:33,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:33,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:34,013 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-01 00:55:34,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:34,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:34,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:34,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:34,035 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-01 00:55:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:34,126 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-10-01 00:55:34,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:34,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:55:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:34,140 INFO L225 Difference]: With dead ends: 48 [2018-10-01 00:55:34,140 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:55:34,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:55:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-10-01 00:55:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:55:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-10-01 00:55:34,187 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-10-01 00:55:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:34,187 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-10-01 00:55:34,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-10-01 00:55:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:55:34,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:34,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:34,189 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:34,189 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-10-01 00:55:34,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:34,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:34,310 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-01 00:55:34,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:34,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:34,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:34,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:34,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:34,313 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-10-01 00:55:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:34,486 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-10-01 00:55:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:34,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:55:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:34,489 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:55:34,489 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:55:34,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:55:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-01 00:55:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:55:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-10-01 00:55:34,525 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-10-01 00:55:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:34,526 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-10-01 00:55:34,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-01 00:55:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:55:34,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:34,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:34,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:34,529 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-10-01 00:55:34,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:34,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:34,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:34,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:34,685 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-01 00:55:34,685 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:34,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:34,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:34,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:34,687 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-10-01 00:55:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:34,757 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-10-01 00:55:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:34,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:55:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:34,761 INFO L225 Difference]: With dead ends: 163 [2018-10-01 00:55:34,761 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:55:34,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:55:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-01 00:55:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:55:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-10-01 00:55:34,788 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-10-01 00:55:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:34,789 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-10-01 00:55:34,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-10-01 00:55:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:55:34,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:34,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:34,790 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:34,791 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:34,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-10-01 00:55:34,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:34,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:34,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:34,897 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-01 00:55:34,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:34,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:55:34,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:34,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:34,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:34,899 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-10-01 00:55:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:35,182 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-10-01 00:55:35,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:35,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-01 00:55:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:35,188 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:55:35,188 INFO L226 Difference]: Without dead ends: 163 [2018-10-01 00:55:35,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-01 00:55:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-01 00:55:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-01 00:55:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-10-01 00:55:35,234 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-10-01 00:55:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:35,234 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-10-01 00:55:35,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-10-01 00:55:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:55:35,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:35,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:55:35,236 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:35,236 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-10-01 00:55:35,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:35,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:35,362 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-01 00:55:35,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:35,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:55:35,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:55:35,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:55:35,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:35,364 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-10-01 00:55:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:35,528 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-10-01 00:55:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:55:35,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-01 00:55:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:35,535 INFO L225 Difference]: With dead ends: 293 [2018-10-01 00:55:35,535 INFO L226 Difference]: Without dead ends: 291 [2018-10-01 00:55:35,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-01 00:55:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-10-01 00:55:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-01 00:55:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-10-01 00:55:35,601 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-10-01 00:55:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-10-01 00:55:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:55:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-10-01 00:55:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:55:35,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:35,607 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-01 00:55:35,608 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:35,608 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-10-01 00:55:35,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:35,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:35,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:35,766 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-01 00:55:35,767 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:35,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:35,768 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:35,768 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-10-01 00:55:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:35,977 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-10-01 00:55:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-01 00:55:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:35,980 INFO L225 Difference]: With dead ends: 525 [2018-10-01 00:55:35,980 INFO L226 Difference]: Without dead ends: 351 [2018-10-01 00:55:35,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-01 00:55:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-01 00:55:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-01 00:55:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-10-01 00:55:36,058 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-10-01 00:55:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:36,058 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-10-01 00:55:36,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-10-01 00:55:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:55:36,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:36,061 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-01 00:55:36,061 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:36,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-10-01 00:55:36,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:36,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:36,319 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-01 00:55:36,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:55:36,320 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-01 00:55:36,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:36,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:55:37,210 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-01 00:55:37,242 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:55:37,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-01 00:55:37,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:55:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:55:37,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:37,244 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 5 states. [2018-10-01 00:55:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:37,928 INFO L93 Difference]: Finished difference Result 591 states and 769 transitions. [2018-10-01 00:55:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:37,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-01 00:55:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:37,931 INFO L225 Difference]: With dead ends: 591 [2018-10-01 00:55:37,931 INFO L226 Difference]: Without dead ends: 349 [2018-10-01 00:55:37,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:55:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-01 00:55:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-10-01 00:55:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-01 00:55:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 432 transitions. [2018-10-01 00:55:37,993 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 432 transitions. Word has length 28 [2018-10-01 00:55:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:37,993 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 432 transitions. [2018-10-01 00:55:37,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:55:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 432 transitions. [2018-10-01 00:55:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:55:37,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:55:37,999 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-01 00:55:37,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:55:37,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:55:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash 381607797, now seen corresponding path program 1 times [2018-10-01 00:55:38,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:55:38,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:55:38,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:38,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:55:38,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:55:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:55:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-01 00:55:38,119 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:55:38,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:55:38,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:55:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:55:38,120 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:55:38,120 INFO L87 Difference]: Start difference. First operand 349 states and 432 transitions. Second operand 3 states. [2018-10-01 00:55:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:55:38,489 INFO L93 Difference]: Finished difference Result 557 states and 688 transitions. [2018-10-01 00:55:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:55:38,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-01 00:55:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:55:38,491 INFO L225 Difference]: With dead ends: 557 [2018-10-01 00:55:38,491 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:55:38,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:55:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:55:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:55:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:55:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:55:38,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-10-01 00:55:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:55:38,494 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:55:38,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:55:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:55:38,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:55:38,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:55:39,310 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-01 00:55:39,628 INFO L422 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,628 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-10-01 00:55:39,628 INFO L422 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,628 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-10-01 00:55:39,628 INFO L422 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,629 INFO L422 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-10-01 00:55:39,629 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-10-01 00:55:39,629 INFO L422 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,629 INFO L422 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~83) (<= ~r1 3)) [2018-10-01 00:55:39,629 INFO L422 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,629 INFO L422 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,630 INFO L422 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,630 INFO L422 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (<= ~r1 3) [2018-10-01 00:55:39,630 INFO L422 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (<= ~r1 3) [2018-10-01 00:55:39,630 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-10-01 00:55:39,630 INFO L422 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (<= ~r1 3) [2018-10-01 00:55:39,631 INFO L422 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~83) (<= ~r1 3)) [2018-10-01 00:55:39,631 INFO L422 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-10-01 00:55:39,646 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:39 BoogieIcfgContainer [2018-10-01 00:55:39,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:39,647 INFO L168 Benchmark]: Toolchain (without parser) took 6683.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 330.3 MB). Peak memory consumption was 330.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:39,649 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-01 00:55:39,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.56 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-01 00:55:39,650 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 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-01 00:55:39,651 INFO L168 Benchmark]: RCFGBuilder took 632.07 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-01 00:55:39,652 INFO L168 Benchmark]: TraceAbstraction took 5968.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 298.6 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:39,656 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.56 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 31.00 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 632.07 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 5968.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 298.6 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: 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: 243]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ~r1 <= 3 - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: ~r1 <= 3 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: 1 <= check_~tmp~83 && ~r1 <= 3 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ~r1 <= 3 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((assert_~arg <= 1 && 1 <= assert_~arg) && 1 <= check_~tmp~83) && ~r1 <= 3 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 119 SDslu, 165 SDs, 0 SdLazy, 43 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 328 NumberOfFragments, 118 HoareAnnotationTreeSize, 14 FomulaSimplifications, 10715 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 178 ConstructedInterpolants, 8 QuantifiedInterpolants, 24316 SizeOfPredicates, 1 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 36/52 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.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-39-672.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-39-672.csv Received shutdown request...