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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:06:34,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:06:34,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:06:34,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:06:34,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:06:34,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:06:34,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:06:34,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:06:34,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:06:34,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:06:34,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:06:34,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:06:34,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:06:34,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:06:34,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:06:34,523 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:06:34,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:06:34,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:06:34,528 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:06:34,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:06:34,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:06:34,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:06:34,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:06:34,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:06:34,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:06:34,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:06:34,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:06:34,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:06:34,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:06:34,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:06:34,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:06:34,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:06:34,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:06:34,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:06:34,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:06:34,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:06:34,543 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:06:34,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:06:34,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:06:34,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:06:34,555 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:06:34,555 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:06:34,555 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:06:34,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:06:34,556 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:06:34,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:06:34,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:06:34,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:06:34,557 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:06:34,557 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:06:34,558 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:06:34,558 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:06:34,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:06:34,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:06:34,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:06:34,648 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:06:34,648 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:06:34,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl [2018-10-15 15:06:34,650 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl' [2018-10-15 15:06:34,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:06:34,712 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:06:34,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:06:34,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:06:34,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:06:34,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/1) ... [2018-10-15 15:06:34,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:06:34,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:06:34,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:06:34,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:06:34,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:06:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:06:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:06:35,073 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:06:35,074 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:06:35 BoogieIcfgContainer [2018-10-15 15:06:35,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:06:35,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:06:35,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:06:35,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:06:35,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:06:34" (1/2) ... [2018-10-15 15:06:35,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f22fbd0 and model type num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:06:35, skipping insertion in model container [2018-10-15 15:06:35,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:06:35" (2/2) ... [2018-10-15 15:06:35,083 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bpl [2018-10-15 15:06:35,093 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:06:35,102 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:06:35,120 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:06:35,151 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:06:35,152 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:06:35,152 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:06:35,152 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:06:35,152 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:06:35,153 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:06:35,153 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:06:35,153 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:06:35,153 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:06:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-15 15:06:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 15:06:35,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:35,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:35,182 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:35,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2012875124, now seen corresponding path program 1 times [2018-10-15 15:06:35,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:35,497 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-15 15:06:35,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:06:35,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:06:35,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:06:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:06:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:06:35,530 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-10-15 15:06:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:35,648 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 15:06:35,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:06:35,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-15 15:06:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:35,660 INFO L225 Difference]: With dead ends: 29 [2018-10-15 15:06:35,661 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 15:06:35,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:06:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 15:06:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-15 15:06:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-15 15:06:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-15 15:06:35,702 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2018-10-15 15:06:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:35,703 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-15 15:06:35,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:06:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-15 15:06:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-15 15:06:35,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:35,705 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:35,705 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:35,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1465908586, now seen corresponding path program 1 times [2018-10-15 15:06:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:35,820 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-15 15:06:35,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:35,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:06:35,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:06:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:06:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:06:35,823 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2018-10-15 15:06:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:35,927 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 15:06:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:06:35,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-15 15:06:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:35,934 INFO L225 Difference]: With dead ends: 36 [2018-10-15 15:06:35,934 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 15:06:35,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:06:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 15:06:35,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-10-15 15:06:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 15:06:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 15:06:35,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 23 [2018-10-15 15:06:35,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:35,941 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 15:06:35,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:06:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 15:06:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 15:06:35,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:35,943 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:35,943 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:35,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash 887611188, now seen corresponding path program 2 times [2018-10-15 15:06:35,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:36,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:06:36,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:06:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:06:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:06:36,129 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 5 states. [2018-10-15 15:06:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:36,228 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 15:06:36,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:06:36,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-10-15 15:06:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:36,230 INFO L225 Difference]: With dead ends: 43 [2018-10-15 15:06:36,230 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 15:06:36,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:06:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 15:06:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-10-15 15:06:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 15:06:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 15:06:36,243 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 30 [2018-10-15 15:06:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:36,244 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 15:06:36,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:06:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 15:06:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 15:06:36,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:36,246 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:36,247 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:36,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash 977941718, now seen corresponding path program 3 times [2018-10-15 15:06:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:36,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:36,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:06:36,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:06:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:06:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:06:36,586 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 6 states. [2018-10-15 15:06:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:36,690 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 15:06:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:06:36,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-10-15 15:06:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:36,693 INFO L225 Difference]: With dead ends: 50 [2018-10-15 15:06:36,694 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 15:06:36,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:06:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 15:06:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2018-10-15 15:06:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 15:06:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 15:06:36,700 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 37 [2018-10-15 15:06:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:36,701 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 15:06:36,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:06:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 15:06:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 15:06:36,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:36,703 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:36,704 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:36,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:36,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902132, now seen corresponding path program 4 times [2018-10-15 15:06:36,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:36,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:36,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:06:36,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:06:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:06:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:06:36,911 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 7 states. [2018-10-15 15:06:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:37,146 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 15:06:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:06:37,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-15 15:06:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:37,148 INFO L225 Difference]: With dead ends: 57 [2018-10-15 15:06:37,148 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 15:06:37,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:06:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 15:06:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-10-15 15:06:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 15:06:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-15 15:06:37,155 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2018-10-15 15:06:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:37,155 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-15 15:06:37,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:06:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-15 15:06:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 15:06:37,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:37,157 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:37,158 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:37,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -334530794, now seen corresponding path program 5 times [2018-10-15 15:06:37,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:37,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:37,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:06:37,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:06:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:06:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:06:37,385 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-10-15 15:06:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:37,722 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 15:06:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:06:37,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-10-15 15:06:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:37,724 INFO L225 Difference]: With dead ends: 64 [2018-10-15 15:06:37,724 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 15:06:37,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:06:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 15:06:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-10-15 15:06:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 15:06:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 15:06:37,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 51 [2018-10-15 15:06:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:37,732 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 15:06:37,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:06:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 15:06:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 15:06:37,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:37,741 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:37,742 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:37,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash -8103244, now seen corresponding path program 6 times [2018-10-15 15:06:37,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:38,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:38,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:06:38,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:06:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:06:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:06:38,126 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 9 states. [2018-10-15 15:06:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:38,352 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 15:06:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:06:38,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-10-15 15:06:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:38,354 INFO L225 Difference]: With dead ends: 71 [2018-10-15 15:06:38,354 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 15:06:38,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:06:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 15:06:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-10-15 15:06:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 15:06:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 15:06:38,361 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 58 [2018-10-15 15:06:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:38,361 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 15:06:38,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:06:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 15:06:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 15:06:38,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:38,363 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:38,364 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1454126762, now seen corresponding path program 7 times [2018-10-15 15:06:38,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:06:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:06:38,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:06:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:06:38,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:06:38,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:06:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:06:38,630 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 10 states. [2018-10-15 15:06:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:06:39,021 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 15:06:39,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:06:39,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-10-15 15:06:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:06:39,025 INFO L225 Difference]: With dead ends: 78 [2018-10-15 15:06:39,025 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 15:06:39,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:06:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 15:06:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-10-15 15:06:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 15:06:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 15:06:39,033 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 65 [2018-10-15 15:06:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:06:39,033 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 15:06:39,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:06:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 15:06:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 15:06:39,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:06:39,035 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:06:39,035 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:06:39,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:06:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1502936972, now seen corresponding path program 8 times [2018-10-15 15:06:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:06:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 15:06:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 15:06:39,096 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 15:06:39,126 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:06:39 BoogieIcfgContainer [2018-10-15 15:06:39,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:06:39,128 INFO L168 Benchmark]: Toolchain (without parser) took 4416.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 211.4 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:39,130 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:06:39,130 INFO L168 Benchmark]: Boogie Preprocessor took 50.96 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-15 15:06:39,131 INFO L168 Benchmark]: RCFGBuilder took 309.79 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-15 15:06:39,132 INFO L168 Benchmark]: TraceAbstraction took 4051.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:06:39,136 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.96 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 309.79 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 4051.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 45]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 38, overapproximation of bitwiseAnd at line 39. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_~i~5, main_~bit~5, main_~x~4, main_~y~4, main_~c~4; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; VAL [main_~x~4=37] [L20] main_~y~4 := 0; VAL [main_~x~4=37, main_~y~4=0] [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=0, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=0, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=1, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=1, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=1, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=2, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=2, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=2, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=3, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=3, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=3, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=4, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=4, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=4, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=5, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=5, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=5, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=6, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=6, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=6, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); VAL [main_~bit~5=1, main_~c~4=7, main_~x~4=37, main_~y~4=0] [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); VAL [main_~c~4=7, main_~x~4=37, main_~y~4=0] [L40] assume main_~bit~5 % 256 != 0; VAL [main_~bit~5=1, main_~c~4=7, main_~x~4=37, main_~y~4=0] [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L29] assume !(main_~c~4 % 256 < 8); VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L30] __VERIFIER_assert_#in~cond := (if main_~x~4 % 256 == main_~y~4 % 256 then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L31] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L33] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L34] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L45] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. UNSAFE Result, 3.9s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 40 SDslu, 1241 SDs, 0 SdLazy, 553 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 118607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/448 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/num_conversion_1.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-06-39-157.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-06-39-157.csv Received shutdown request...