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/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:18:41,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:18:41,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:18:41,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:18:41,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:18:41,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:18:41,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:18:41,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:18:41,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:18:41,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:18:41,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:18:41,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:18:41,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:18:41,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:18:41,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:18:41,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:18:41,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:18:41,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:18:41,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:18:41,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:18:41,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:18:41,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:18:41,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:18:41,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:18:41,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:18:41,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:18:41,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:18:41,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:18:41,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:18:41,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:18:41,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:18:41,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:18:41,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:18:41,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:18:41,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:18:41,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:18:41,162 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:18:41,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:18:41,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:18:41,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:18:41,179 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:18:41,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:18:41,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:18:41,180 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:18:41,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:18:41,184 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:18:41,184 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:18:41,184 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:18:41,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:18:41,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:18:41,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:18:41,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:18:41,185 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:18:41,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:18:41,185 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:18:41,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:18:41,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:18:41,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:18:41,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:18:41,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:18:41,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:18:41,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:18:41,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:18:41,188 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:18:41,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:18:41,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:18:41,189 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:18:41,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:18:41,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:18:41,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:18:41,281 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:18:41,281 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:18:41,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl [2018-10-04 12:18:41,282 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl' [2018-10-04 12:18:41,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:18:41,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:18:41,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:18:41,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:18:41,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:18:41,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:18:41,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:18:41,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:18:41,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:18:41,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... [2018-10-04 12:18:41,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:18:41,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:18:41,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:18:41,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:18:41,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:18:41,496 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 12:18:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:18:41,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:18:41,685 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:18:41,686 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:18:41 BoogieIcfgContainer [2018-10-04 12:18:41,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:18:41,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:18:41,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:18:41,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:18:41,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:18:41" (1/2) ... [2018-10-04 12:18:41,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4803caf and model type num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:18:41, skipping insertion in model container [2018-10-04 12:18:41,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:18:41" (2/2) ... [2018-10-04 12:18:41,694 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl [2018-10-04 12:18:41,703 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:18:41,711 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:18:41,763 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:18:41,764 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:18:41,764 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:18:41,764 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:18:41,764 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:18:41,764 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:18:41,765 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:18:41,765 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:18:41,765 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:18:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 12:18:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:18:41,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:41,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:18:41,786 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:41,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-04 12:18:41,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:41,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:41,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:41,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:41,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:41,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:18:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:18:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:18:41,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:41,980 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 12:18:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:42,016 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-10-04 12:18:42,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:18:42,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:18:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:42,031 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:18:42,032 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:18:42,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:18:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:18:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:18:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:18:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:18:42,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:18:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:42,072 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:18:42,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:18:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:18:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:18:42,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:42,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:18:42,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:42,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-10-04 12:18:42,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:42,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:42,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:42,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:42,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:42,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:42,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:18:42,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:18:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:18:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:18:42,327 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 12:18:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:42,424 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:18:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:18:42,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 12:18:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:42,425 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:18:42,425 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:18:42,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:18:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:18:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:18:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:18:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:18:42,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:18:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:42,429 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:18:42,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:18:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:18:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:18:42,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:42,433 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 12:18:42,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:42,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-10-04 12:18:42,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:42,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:42,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:42,577 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) [2018-10-04 12:18:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:42,637 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:18:42,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:42,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:42,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:42,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:18:42,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:18:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:18:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:18:42,670 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 12:18:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:42,750 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:18:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:18:42,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:18:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:42,751 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:18:42,751 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:18:42,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:18:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:18:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:18:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:18:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:18:42,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:18:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:42,756 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:18:42,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:18:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:18:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:18:42,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:42,757 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 12:18:42,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:42,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-10-04 12:18:42,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:42,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:42,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:42,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:42,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:42,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:42,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:42,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:18:42,973 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:18:42,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:42,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:43,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:43,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:18:43,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:18:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:18:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:18:43,011 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 12:18:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:43,042 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:18:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:18:43,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 12:18:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:43,045 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:18:43,045 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:18:43,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:18:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:18:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:18:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:18:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:18:43,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:18:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:43,049 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:18:43,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:18:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:18:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:18:43,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:43,050 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 12:18:43,051 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:43,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:43,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-10-04 12:18:43,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:43,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:43,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:43,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:43,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:43,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:43,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:18:43,401 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:18:43,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:43,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:43,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:43,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:18:43,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:18:43,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:18:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:18:43,432 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 12:18:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:43,461 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:18:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:18:43,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 12:18:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:43,463 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:18:43,464 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:18:43,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:18:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:18:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:18:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:18:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:18:43,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:18:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:43,468 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:18:43,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:18:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:18:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:18:43,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:43,469 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 12:18:43,470 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:43,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:43,470 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-10-04 12:18:43,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:43,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:43,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:43,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:43,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:43,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:43,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:43,636 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:18:43,710 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:18:43,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:43,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:43,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:43,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:18:43,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:18:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:18:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:18:43,752 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 12:18:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:43,808 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:18:43,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:18:43,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:18:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:43,812 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:18:43,812 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:18:43,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:18:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:18:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:18:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:18:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:18:43,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:18:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:43,820 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:18:43,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:18:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:18:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:18:43,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:43,822 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 12:18:43,822 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:43,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-10-04 12:18:43,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:43,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:43,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:44,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:44,080 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-04 12:18:44,093 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:18:44,114 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:18:44,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:44,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:44,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:44,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:18:44,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:18:44,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:18:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:18:44,150 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 12:18:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:44,181 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:18:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:18:44,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:18:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:44,185 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:18:44,185 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:18:44,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:18:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:18:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:18:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:18:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:18:44,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:18:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:44,189 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:18:44,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:18:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:18:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:18:44,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:44,191 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 12:18:44,191 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:44,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-10-04 12:18:44,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:44,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:44,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:44,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:44,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:44,693 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-04 12:18:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:44,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:44,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:18:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:18:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:18:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:18:44,753 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 12:18:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:44,832 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:18:44,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:18:44,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 12:18:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:44,833 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:18:44,834 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:18:44,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:18:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:18:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:18:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:18:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:18:44,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:18:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:44,838 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:18:44,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:18:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:18:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:18:44,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:44,839 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 12:18:44,839 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:44,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-10-04 12:18:44,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:44,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:18:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 12:18:44,882 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-04 12:18:44,912 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:44 BoogieIcfgContainer [2018-10-04 12:18:44,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:44,913 INFO L168 Benchmark]: Toolchain (without parser) took 3559.96 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: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:44,915 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:44,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:44,916 INFO L168 Benchmark]: Boogie Preprocessor took 24.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:44,917 INFO L168 Benchmark]: RCFGBuilder took 263.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:44,918 INFO L168 Benchmark]: TraceAbstraction took 3225.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:44,922 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.20 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 42.74 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 24.02 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 263.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3225.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 47]: assertion can be violated assertion can be violated We found a FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~c~5, main_~x~5, main_~y~5; [L17] main_~x~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] havoc main_~y~5; [L20] havoc main_~c~5; [L21] main_~y~5 := 0; [L22] main_~c~5 := 0; VAL [main_~c~5=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=1, main_~y~5=1] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~y~5=256] [L29] assume main_~c~5 < 256 && !(main_~c~5 < 8); [L30] assume (((!(main_~x~5 + 256 == main_~y~5 - 256) && -256 <= main_~x~5) && main_~y~5 < 256 + 256) && 256 <= main_~y~5) && main_~x~5 < 0; [L31] __VERIFIER_assert_#in~cond := 0; [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-1, main_~y~5=256] [L47] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-1, main_~y~5=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 3.1s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 36 SDs, 0 SdLazy, 80 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 1520 SizeOfPredicates, 8 NumberOfNonLiveVariables, 532 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 0/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-44-938.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-44-938.csv Received shutdown request...