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/underapprox2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:28:28,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:28:28,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:28:28,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:28:28,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:28:28,058 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:28:28,059 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:28:28,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:28:28,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:28:28,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:28:28,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:28:28,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:28:28,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:28:28,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:28:28,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:28:28,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:28:28,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:28:28,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:28:28,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:28:28,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:28:28,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:28:28,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:28:28,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:28:28,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:28:28,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:28:28,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:28:28,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:28:28,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:28:28,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:28:28,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:28:28,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:28:28,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:28:28,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:28:28,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:28:28,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:28:28,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:28:28,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:28:28,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:28:28,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:28:28,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:28:28,104 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:28:28,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:28:28,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:28:28,105 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:28:28,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:28:28,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:28:28,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:28:28,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:28:28,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:28:28,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:28:28,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:28:28,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:28:28,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:28:28,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:28:28,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:28:28,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:28:28,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:28:28,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:28:28,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:28:28,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:28,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:28:28,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:28:28,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:28:28,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:28:28,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:28:28,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:28:28,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:28:28,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:28:28,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:28:28,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:28:28,193 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:28:28,194 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:28:28,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl [2018-10-04 12:28:28,194 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl' [2018-10-04 12:28:28,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:28:28,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:28:28,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:28,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:28:28,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:28:28,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:28,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:28:28,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:28:28,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:28:28,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... [2018-10-04 12:28:28,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:28:28,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:28:28,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:28:28,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:28:28,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:28:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:28:28,624 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:28:28,624 INFO L202 PluginConnector]: Adding new model underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:28 BoogieIcfgContainer [2018-10-04 12:28:28,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:28:28,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:28:28,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:28:28,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:28:28,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:28" (1/2) ... [2018-10-04 12:28:28,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef6444a and model type underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:28:28, skipping insertion in model container [2018-10-04 12:28:28,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:28" (2/2) ... [2018-10-04 12:28:28,638 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox2.i_3.bpl [2018-10-04 12:28:28,646 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:28:28,654 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:28:28,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:28:28,707 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:28:28,707 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:28:28,707 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:28:28,707 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:28:28,708 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:28:28,708 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:28:28,708 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:28:28,708 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:28:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:28:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:28:28,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:28,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:28:28,745 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:28,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:28:28,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:28,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:28,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:28,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:28,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:28,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:28,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:28,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:28,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:28,964 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:28:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:29,024 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 12:28:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:29,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:28:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:29,037 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:29,037 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:28:29,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:28:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:28:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:28:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:28:29,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 12:28:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:29,108 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:28:29,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:28:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:28:29,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:29,109 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 12:28:29,110 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:29,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 12:28:29,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:29,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:29,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:29,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:29,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:29,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:29,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:29,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:28:29,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:28:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:28:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:29,449 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 12:28:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:29,559 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:28:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:28:29,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 12:28:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:29,561 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:29,561 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:28:29,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:28:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:28:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:28:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:28:29,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 12:28:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:29,569 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:28:29,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:28:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:28:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:28:29,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:29,570 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 12:28:29,571 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:29,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 12:28:29,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:29,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:29,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:29,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:29,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:28:29,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:29,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:29,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:29,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:29,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:28:29,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:28:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:28:29,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:29,887 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 12:28:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:29,958 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:28:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:28:29,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 12:28:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:29,960 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:28:29,960 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:28:29,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:28:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:28:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:28:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:28:29,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 12:28:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:29,965 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:28:29,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:28:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:28:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:28:29,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:29,966 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 12:28:29,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:29,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 12:28:29,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:29,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:29,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:30,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:30,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:30,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:28:30,434 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:28:30,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:30,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:30,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:30,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:28:30,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:28:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:28:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:28:30,471 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 12:28:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:30,530 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:28:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:28:30,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 12:28:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:30,533 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:28:30,533 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:28:30,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:28:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:28:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:28:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:28:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:28:30,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 12:28:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:30,539 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:28:30,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:28:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:28:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:28:30,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:30,540 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 12:28:30,541 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:30,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 12:28:30,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:30,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:30,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:30,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:30,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:30,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:30,703 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:28:30,733 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:28:30,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:30,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:28:30,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:28:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:28:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:30,810 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 12:28:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:30,943 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:28:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:28:30,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 12:28:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:30,945 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:28:30,945 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:28:30,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:28:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:28:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:28:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:28:30,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 12:28:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:30,951 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:28:30,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:28:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:28:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:28:30,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:30,952 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 12:28:30,952 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:30,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 12:28:30,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:30,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:30,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:30,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:31,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:31,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:31,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:28:31,176 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:28:31,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:31,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:31,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:31,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:28:31,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:28:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:28:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:31,230 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 12:28:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:31,314 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:28:31,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:28:31,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 12:28:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:31,316 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:28:31,316 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:28:31,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:28:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:28:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:28:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:28:31,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 12:28:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:31,322 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:28:31,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:28:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:28:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:28:31,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:31,323 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 12:28:31,323 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:31,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 12:28:31,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:31,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:31,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:28:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:28:31,365 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 12:28:31,397 INFO L202 PluginConnector]: Adding new model underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:28:31 BoogieIcfgContainer [2018-10-04 12:28:31,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:28:31,398 INFO L168 Benchmark]: Toolchain (without parser) took 3160.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:31,401 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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-04 12:28:31,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.47 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-04 12:28:31,402 INFO L168 Benchmark]: Boogie Preprocessor took 21.89 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-04 12:28:31,402 INFO L168 Benchmark]: RCFGBuilder took 323.95 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:31,404 INFO L168 Benchmark]: TraceAbstraction took 2771.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:31,410 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.15 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 38.47 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 21.89 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 323.95 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2771.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 150.7 MB). Peak memory consumption was 150.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~x~4, main_~y~4; [L12] main_~x~4 := 0; [L13] main_~y~4 := 1; VAL [main_~x~4=0, main_~y~4=1] [L16] assume true; VAL [main_~x~4=0, main_~y~4=1] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=1, main_~y~4=2] [L16] assume true; VAL [main_~x~4=1, main_~y~4=2] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=2, main_~y~4=4] [L16] assume true; VAL [main_~x~4=2, main_~y~4=4] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=3, main_~y~4=8] [L16] assume true; VAL [main_~x~4=3, main_~y~4=8] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=4, main_~y~4=16] [L16] assume true; VAL [main_~x~4=4, main_~y~4=16] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=5, main_~y~4=32] [L16] assume true; VAL [main_~x~4=5, main_~y~4=32] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=6, main_~y~4=64] [L16] assume true; VAL [main_~x~4=6, main_~y~4=64] [L21] assume !(main_~x~4 % 4294967296 < 6); [L22] __VERIFIER_assert_#in~cond := (if main_~x~4 % 4294967296 != 6 then 1 else 0); [L23] havoc __VERIFIER_assert_~cond; [L24] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L25] assume __VERIFIER_assert_~cond == 0; [L26] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 2.6s OverallTime, 7 OverallIterations, 7 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 0 SDslu, 92 SDs, 0 SdLazy, 133 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 5735 SizeOfPredicates, 15 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox2.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-28-31-427.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox2.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-28-31-427.csv Received shutdown request...