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/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:44:38,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:44:38,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:44:38,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:44:38,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:44:38,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:44:38,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:44:38,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:44:38,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:44:38,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:44:38,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:44:38,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:44:38,677 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:44:38,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:44:38,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:44:38,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:44:38,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:44:38,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:44:38,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:44:38,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:44:38,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:44:38,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:44:38,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:44:38,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:44:38,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:44:38,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:44:38,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:44:38,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:44:38,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:44:38,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:44:38,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:44:38,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:44:38,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:44:38,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:44:38,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:44:38,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:44:38,716 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-02 11:44:38,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:44:38,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:44:38,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:44:38,742 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:44:38,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:44:38,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:44:38,743 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:44:38,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:44:38,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:44:38,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:44:38,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:44:38,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:44:38,745 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:44:38,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:44:38,746 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:44:38,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:44:38,746 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:44:38,746 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:44:38,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:44:38,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:44:38,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:44:38,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:44:38,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:44:38,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:44:38,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:44:38,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:44:38,749 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:44:38,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:44:38,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:44:38,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:44:38,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:44:38,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:44:38,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:44:38,822 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:44:38,823 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:44:38,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-10-02 11:44:38,824 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-10-02 11:44:38,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:44:38,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:44:38,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:44:38,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:44:38,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:44:38,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:44:38,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:44:38,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:44:38,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:44:38,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/1) ... [2018-10-02 11:44:38,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:44:38,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:44:38,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:44:38,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:44:38,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (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-02 11:44:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:44:39,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:44:39,240 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:44:39,241 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:39 BoogieIcfgContainer [2018-10-02 11:44:39,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:44:39,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:44:39,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:44:39,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:44:39,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:44:38" (1/2) ... [2018-10-02 11:44:39,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdc9f89 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:39, skipping insertion in model container [2018-10-02 11:44:39,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:39" (2/2) ... [2018-10-02 11:44:39,249 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-10-02 11:44:39,257 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:44:39,265 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:44:39,315 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:44:39,316 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:44:39,316 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:44:39,317 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:44:39,317 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:44:39,317 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:44:39,317 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:44:39,317 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:44:39,318 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:44:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-02 11:44:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:44:39,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:39,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 11:44:39,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:39,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-02 11:44:39,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:39,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:39,523 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-02 11:44:39,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:44:39,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:44:39,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:44:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:44:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:44:39,546 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-02 11:44:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:39,608 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-02 11:44:39,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:44:39,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-02 11:44:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:39,622 INFO L225 Difference]: With dead ends: 11 [2018-10-02 11:44:39,622 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 11:44:39,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:44:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 11:44:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 11:44:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 11:44:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 11:44:39,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-02 11:44:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:39,685 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 11:44:39,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:44:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 11:44:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 11:44:39,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:39,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-02 11:44:39,687 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:39,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-02 11:44:39,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:39,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:39,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:39,830 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-02 11:44:39,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:39,830 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-02 11:44:39,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:39,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:39,967 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-02 11:44:40,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:40,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 11:44:40,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:44:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:44:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:44:40,003 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-02 11:44:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:40,100 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 11:44:40,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:44:40,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-02 11:44:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:40,102 INFO L225 Difference]: With dead ends: 11 [2018-10-02 11:44:40,102 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 11:44:40,103 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-02 11:44:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 11:44:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 11:44:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 11:44:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 11:44:40,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-02 11:44:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:40,107 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 11:44:40,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:44:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 11:44:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:44:40,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:40,108 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-02 11:44:40,108 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:40,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-02 11:44:40,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:40,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:40,308 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-02 11:44:40,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:40,311 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-02 11:44:40,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:44:40,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:44:40,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:40,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:40,383 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-02 11:44:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:44:40,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:44:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:44:40,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:44:40,405 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-02 11:44:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:40,491 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 11:44:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:44:40,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-02 11:44:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:40,492 INFO L225 Difference]: With dead ends: 13 [2018-10-02 11:44:40,493 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 11:44:40,493 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-02 11:44:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 11:44:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 11:44:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 11:44:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 11:44:40,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-02 11:44:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:40,498 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 11:44:40,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:44:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 11:44:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:44:40,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:40,499 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-02 11:44:40,499 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:40,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-02 11:44:40,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:40,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:40,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:40,878 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-02 11:44:40,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:40,878 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-02 11:44:40,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:44:40,900 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-02 11:44:40,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:40,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:40,926 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-02 11:44:40,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 11:44:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:44:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:44:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:44:40,955 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-02 11:44:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:41,015 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 11:44:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:44:41,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-02 11:44:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:41,017 INFO L225 Difference]: With dead ends: 15 [2018-10-02 11:44:41,018 INFO L226 Difference]: Without dead ends: 13 [2018-10-02 11:44:41,018 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-02 11:44:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-02 11:44:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-02 11:44:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 11:44:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 11:44:41,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-02 11:44:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:41,024 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 11:44:41,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:44:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 11:44:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:44:41,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:41,025 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-02 11:44:41,025 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:41,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-02 11:44:41,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:41,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:41,167 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-02 11:44:41,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:41,168 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-02 11:44:41,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:44:41,217 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:44:41,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:41,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:41,297 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-02 11:44:41,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:41,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:44:41,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:44:41,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:44:41,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:44:41,323 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-02 11:44:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:41,392 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-02 11:44:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:44:41,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-02 11:44:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:41,395 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:44:41,396 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 11:44:41,396 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-02 11:44:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 11:44:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 11:44:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 11:44:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-02 11:44:41,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-02 11:44:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:41,401 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-02 11:44:41,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:44:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-02 11:44:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:44:41,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:41,403 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-02 11:44:41,403 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:41,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-02 11:44:41,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:41,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:41,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:41,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:41,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:41,583 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-02 11:44:41,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:41,584 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-02 11:44:41,594 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:44:41,620 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-02 11:44:41,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:41,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:41,641 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-02 11:44:41,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:41,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:44:41,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:44:41,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:44:41,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:44:41,671 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-02 11:44:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:41,825 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-02 11:44:41,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:44:41,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-02 11:44:41,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:41,828 INFO L225 Difference]: With dead ends: 19 [2018-10-02 11:44:41,829 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 11:44:41,829 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-02 11:44:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 11:44:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 11:44:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:44:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 11:44:41,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-02 11:44:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:41,844 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 11:44:41,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:44:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 11:44:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:44:41,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:41,845 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-02 11:44:41,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:41,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-02 11:44:41,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:41,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:41,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:42,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:42,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:42,283 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:44:42,305 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 11:44:42,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:42,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:42,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:42,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 11:44:42,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:44:42,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:44:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:44:42,354 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-02 11:44:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:42,494 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-02 11:44:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:44:42,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-02 11:44:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:42,499 INFO L225 Difference]: With dead ends: 21 [2018-10-02 11:44:42,499 INFO L226 Difference]: Without dead ends: 19 [2018-10-02 11:44:42,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:44:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-02 11:44:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-02 11:44:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-02 11:44:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-02 11:44:42,505 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-02 11:44:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:42,505 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-02 11:44:42,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:44:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-02 11:44:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:44:42,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:42,506 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-02 11:44:42,506 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:42,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-02 11:44:42,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:42,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:42,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:42,692 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:42,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:42,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:42,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 11:44:42,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:44:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:44:42,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:44:42,755 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-02 11:44:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:42,864 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-02 11:44:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:44:42,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-02 11:44:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:42,866 INFO L225 Difference]: With dead ends: 23 [2018-10-02 11:44:42,866 INFO L226 Difference]: Without dead ends: 21 [2018-10-02 11:44:42,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:44:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-02 11:44:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-02 11:44:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-02 11:44:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 11:44:42,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-02 11:44:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-02 11:44:42,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:44:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 11:44:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:44:42,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:42,873 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-02 11:44:42,873 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:42,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-02 11:44:42,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:42,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:43,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:43,277 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:43,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:44:43,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:44:43,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:43,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:43,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:43,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-02 11:44:43,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:44:43,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:44:43,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:44:43,339 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-02 11:44:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:43,474 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-02 11:44:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:44:43,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-02 11:44:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:43,476 INFO L225 Difference]: With dead ends: 25 [2018-10-02 11:44:43,477 INFO L226 Difference]: Without dead ends: 23 [2018-10-02 11:44:43,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:44:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-02 11:44:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-02 11:44:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-02 11:44:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-02 11:44:43,484 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-02 11:44:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:43,484 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-02 11:44:43,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:44:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-02 11:44:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:44:43,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:43,485 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-02 11:44:43,486 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:43,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-02 11:44:43,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:43,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:43,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:43,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:43,672 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:43,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:44:43,720 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-02 11:44:43,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:43,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:43,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:43,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-02 11:44:43,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:44:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:44:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:44:43,767 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-02 11:44:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:43,923 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-02 11:44:43,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:44:43,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-02 11:44:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:43,930 INFO L225 Difference]: With dead ends: 27 [2018-10-02 11:44:43,930 INFO L226 Difference]: Without dead ends: 25 [2018-10-02 11:44:43,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:44:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-02 11:44:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-02 11:44:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 11:44:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 11:44:43,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-02 11:44:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:43,937 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-02 11:44:43,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:44:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 11:44:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:44:43,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:43,938 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-02 11:44:43,938 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:43,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-02 11:44:43,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:43,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:43,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:44,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:44,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:44,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:44:44,231 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:44:44,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:44,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:44,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-02 11:44:44,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:44:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:44:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:44:44,273 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-02 11:44:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:44,534 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-02 11:44:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:44:44,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-02 11:44:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:44,536 INFO L225 Difference]: With dead ends: 29 [2018-10-02 11:44:44,536 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 11:44:44,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:44:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 11:44:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 11:44:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 11:44:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 11:44:44,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-02 11:44:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:44,543 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-02 11:44:44,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:44:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 11:44:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:44:44,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:44,544 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-02 11:44:44,544 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:44,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-02 11:44:44,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:44,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:44,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:44,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:44,773 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:44,785 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:44:47,652 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-02 11:44:47,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:47,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-02 11:44:47,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:44:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:44:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:44:47,816 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-02 11:44:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:48,160 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 11:44:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:44:48,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-02 11:44:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:48,165 INFO L225 Difference]: With dead ends: 31 [2018-10-02 11:44:48,165 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 11:44:48,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:44:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 11:44:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-02 11:44:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 11:44:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 11:44:48,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-02 11:44:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:48,171 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-02 11:44:48,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:44:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 11:44:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 11:44:48,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:48,172 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-02 11:44:48,172 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:48,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-02 11:44:48,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:48,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:48,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:48,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:48,433 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:44:48,565 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 11:44:48,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:48,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:48,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:48,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-02 11:44:48,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:44:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:44:48,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:44:48,638 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-02 11:44:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:48,873 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-02 11:44:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:44:48,873 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-02 11:44:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:48,874 INFO L225 Difference]: With dead ends: 33 [2018-10-02 11:44:48,874 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 11:44:48,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:44:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 11:44:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 11:44:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 11:44:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-02 11:44:48,881 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-02 11:44:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:48,881 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-02 11:44:48,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:44:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-02 11:44:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:44:48,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:48,882 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-02 11:44:48,882 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:48,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:48,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-02 11:44:48,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:48,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:48,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:49,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:49,244 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:49,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:49,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:49,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:49,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-02 11:44:49,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:44:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:44:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:44:49,303 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-02 11:44:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:49,538 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-02 11:44:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:44:49,539 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-02 11:44:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:49,540 INFO L225 Difference]: With dead ends: 35 [2018-10-02 11:44:49,540 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 11:44:49,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:44:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 11:44:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 11:44:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:44:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 11:44:49,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-02 11:44:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:49,550 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-02 11:44:49,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:44:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 11:44:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 11:44:49,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:49,551 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-02 11:44:49,551 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:49,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-02 11:44:49,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:49,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:44:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:50,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:50,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:50,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:44:50,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:44:50,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:50,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:50,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:50,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-02 11:44:50,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:44:50,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:44:50,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:44:50,280 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-02 11:44:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:50,775 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-02 11:44:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:44:50,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-02 11:44:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:50,777 INFO L225 Difference]: With dead ends: 37 [2018-10-02 11:44:50,777 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 11:44:50,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:44:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 11:44:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-02 11:44:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 11:44:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-02 11:44:50,784 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-02 11:44:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:50,785 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-02 11:44:50,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:44:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-02 11:44:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:44:50,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:50,786 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-02 11:44:50,786 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:50,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-02 11:44:50,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:50,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:50,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:50,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:50,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:44:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:51,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:44:51,082 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:44:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:44:51,285 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-02 11:44:51,285 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:44:51,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:44:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:44:51,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:44:51,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-02 11:44:51,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:44:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:44:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:44:51,378 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-02 11:44:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:44:51,640 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-02 11:44:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:44:51,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-02 11:44:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:44:51,643 INFO L225 Difference]: With dead ends: 39 [2018-10-02 11:44:51,643 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 11:44:51,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:44:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 11:44:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-02 11:44:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:44:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 11:44:51,649 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-02 11:44:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:44:51,649 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 11:44:51,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:44:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 11:44:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:44:51,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:44:51,650 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-02 11:44:51,650 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:44:51,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:44:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-02 11:44:51,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:44:51,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:44:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:51,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:44:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:44:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 11:44:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 11:44:51,685 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-02 11:44:51,709 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:44:51 BoogieIcfgContainer [2018-10-02 11:44:51,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:44:51,710 INFO L168 Benchmark]: Toolchain (without parser) took 12806.98 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 18.9 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 237.9 MB). Peak memory consumption was 256.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:44:51,712 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:44:51,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.08 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-02 11:44:51,713 INFO L168 Benchmark]: Boogie Preprocessor took 21.87 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-02 11:44:51,713 INFO L168 Benchmark]: RCFGBuilder took 266.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:44:51,714 INFO L168 Benchmark]: TraceAbstraction took 12467.25 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 18.9 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 216.7 MB). Peak memory consumption was 235.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:44:51,717 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.08 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.87 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 266.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12467.25 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 18.9 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 216.7 MB). Peak memory consumption was 235.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L32] assume true; VAL [main_~i~5=0, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L32] assume true; VAL [main_~i~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L32] assume true; VAL [main_~i~5=2] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L32] assume true; VAL [main_~i~5=3] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L32] assume true; VAL [main_~i~5=4] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L32] assume true; VAL [main_~i~5=5] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L32] assume true; VAL [main_~i~5=6] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L32] assume true; VAL [main_~i~5=7] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L32] assume true; VAL [main_~i~5=8] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L32] assume true; VAL [main_~i~5=9] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L32] assume true; VAL [main_~i~5=10] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L32] assume true; VAL [main_~i~5=11] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L32] assume true; VAL [main_~i~5=12] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L32] assume true; VAL [main_~i~5=13] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L32] assume true; VAL [main_~i~5=14] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L32] assume true; VAL [main_~i~5=15] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L32] assume true; VAL [main_~i~5=16] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=0, main_~z~5=1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 12.4s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 0 SDslu, 1497 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 285 SyntacticMatches, 16 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=16, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 88115 SizeOfPredicates, 15 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-44-51-729.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-44-51-729.csv Received shutdown request...