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-c372c2b [2018-10-02 11:39:49,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:39:49,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:39:49,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:39:49,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:39:49,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:39:49,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:39:49,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:39:49,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:39:49,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:39:49,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:39:49,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:39:49,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:39:49,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:39:49,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:39:49,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:39:49,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:39:49,218 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:39:49,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:39:49,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:39:49,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:39:49,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:39:49,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:39:49,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:39:49,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:39:49,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:39:49,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:39:49,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:39:49,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:39:49,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:39:49,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:39:49,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:39:49,242 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:39:49,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:39:49,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:39:49,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:39:49,246 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:39:49,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:39:49,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:39:49,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:39:49,267 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:39:49,268 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:39:49,268 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:39:49,268 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:39:49,268 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:39:49,269 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:39:49,269 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:39:49,269 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:39:49,269 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:39:49,269 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:39:49,270 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:39:49,270 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:39:49,270 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:39:49,270 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:39:49,270 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:39:49,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:39:49,271 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:39:49,271 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:39:49,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:39:49,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:39:49,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:39:49,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:39:49,272 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:39:49,272 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:39:49,272 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:39:49,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:39:49,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:39:49,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:39:49,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:39:49,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:39:49,352 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:39:49,353 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:39:49,354 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-02 11:39:49,354 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-02 11:39:49,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:39:49,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:39:49,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:39:49,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:39:49,425 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:39:49,445 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,458 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:39:49,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:39:49,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:39:49,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:39:49,477 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,477 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,478 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,478 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,482 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,484 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,486 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 02.10 11:39:49" (1/1) ... [2018-10-02 11:39:49,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:39:49,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:39:49,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:39:49,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:39:49,494 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 02.10 11:39:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:39:49,558 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-02 11:39:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:39:49,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:39:49,790 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:39:49,791 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:39:49 BoogieIcfgContainer [2018-10-02 11:39:49,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:39:49,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:39:49,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:39:49,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:39:49,796 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 02.10 11:39:49" (1/2) ... [2018-10-02 11:39:49,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396a36ff and model type num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:39:49, skipping insertion in model container [2018-10-02 11:39:49,797 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 02.10 11:39:49" (2/2) ... [2018-10-02 11:39:49,800 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl [2018-10-02 11:39:49,811 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:39:49,822 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:39:49,878 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:39:49,879 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:39:49,879 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:39:49,879 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:39:49,879 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:39:49,880 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:39:49,880 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:39:49,880 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:39:49,880 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:39:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-02 11:39:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 11:39:49,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:49,908 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 11:39:49,914 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:49,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-02 11:39:49,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:49,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:50,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:39:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:39:50,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:39:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:39:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:39:50,097 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-02 11:39:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:50,163 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-10-02 11:39:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:39:50,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-02 11:39:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:50,175 INFO L225 Difference]: With dead ends: 9 [2018-10-02 11:39:50,176 INFO L226 Difference]: Without dead ends: 5 [2018-10-02 11:39:50,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:39:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-02 11:39:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-02 11:39:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-02 11:39:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-02 11:39:50,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-02 11:39:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:50,214 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-02 11:39:50,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:39:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-02 11:39:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:39:50,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:50,215 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-02 11:39:50,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:50,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-10-02 11:39:50,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:50,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:50,354 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-02 11:39:50,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:50,355 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:50,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:50,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:50,434 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-02 11:39:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 11:39:50,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:39:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:39:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:39:50,468 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-02 11:39:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:50,581 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-02 11:39:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:39:50,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-02 11:39:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:50,585 INFO L225 Difference]: With dead ends: 8 [2018-10-02 11:39:50,585 INFO L226 Difference]: Without dead ends: 6 [2018-10-02 11:39:50,586 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-02 11:39:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-02 11:39:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-02 11:39:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 11:39:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 11:39:50,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-02 11:39:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:50,589 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-02 11:39:50,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:39:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 11:39:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:39:50,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:50,590 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-02 11:39:50,590 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:50,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-10-02 11:39:50,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:50,827 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-02 11:39:50,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:50,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:50,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:39:50,862 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:39:50,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:50,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:50,877 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-02 11:39:50,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:50,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:39:50,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:39:50,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:39:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:39:50,908 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-02 11:39:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:50,960 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 11:39:50,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:39:50,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 11:39:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:50,961 INFO L225 Difference]: With dead ends: 9 [2018-10-02 11:39:50,961 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 11:39:50,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:39:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 11:39:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 11:39:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 11:39:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 11:39:50,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-02 11:39:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:50,965 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 11:39:50,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:39:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 11:39:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 11:39:50,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:50,966 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-02 11:39:50,967 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:50,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-10-02 11:39:50,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:50,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:51,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:51,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:51,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:39:51,138 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:39:51,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:51,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:51,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 11:39:51,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:39:51,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:39:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:39:51,179 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-02 11:39:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:51,225 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-02 11:39:51,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:39:51,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-02 11:39:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:51,227 INFO L225 Difference]: With dead ends: 10 [2018-10-02 11:39:51,227 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 11:39:51,228 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-02 11:39:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 11:39:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 11:39:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 11:39:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-02 11:39:51,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-02 11:39:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:51,233 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-02 11:39:51,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:39:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-02 11:39:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:39:51,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:51,235 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-02 11:39:51,236 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:51,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:51,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-10-02 11:39:51,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:51,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:51,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:51,556 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-02 11:39:51,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:51,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:51,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:39:51,607 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:39:51,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:51,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:51,623 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-02 11:39:51,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:51,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:39:51,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:39:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:39:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:39:51,651 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-02 11:39:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:51,702 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 11:39:51,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:39:51,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-02 11:39:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:51,703 INFO L225 Difference]: With dead ends: 11 [2018-10-02 11:39:51,704 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 11:39:51,704 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-02 11:39:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 11:39:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 11:39:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 11:39:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 11:39:51,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-02 11:39:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:51,708 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 11:39:51,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:39:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 11:39:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:39:51,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:51,709 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-02 11:39:51,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:51,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-10-02 11:39:51,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:51,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:51,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:51,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:51,850 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-02 11:39:51,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:51,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:39:51,940 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 11:39:51,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:51,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:51,953 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-02 11:39:51,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:39:51,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:39:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:39:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:39:51,982 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-02 11:39:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:52,023 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-02 11:39:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:39:52,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:39:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:52,025 INFO L225 Difference]: With dead ends: 12 [2018-10-02 11:39:52,025 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 11:39:52,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:39:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 11:39:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-02 11:39:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-02 11:39:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-02 11:39:52,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-02 11:39:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:52,030 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-02 11:39:52,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:39:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-02 11:39:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:39:52,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:52,031 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-02 11:39:52,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:52,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-10-02 11:39:52,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:52,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:52,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:52,263 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-02 11:39:52,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:52,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:39:52,293 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-02 11:39:52,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:52,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:52,304 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-02 11:39:52,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:52,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 11:39:52,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:39:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:39:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:39:52,328 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-02 11:39:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:52,400 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 11:39:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:39:52,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-02 11:39:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:52,402 INFO L225 Difference]: With dead ends: 13 [2018-10-02 11:39:52,402 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 11:39:52,403 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-02 11:39:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 11:39:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 11:39:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 11:39:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 11:39:52,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-02 11:39:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:52,407 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 11:39:52,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:39:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 11:39:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:39:52,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:52,408 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-02 11:39:52,408 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:52,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:52,409 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-10-02 11:39:52,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:52,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:52,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:52,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:52,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:52,846 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-02 11:39:52,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:52,847 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:52,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:52,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:52,882 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-02 11:39:52,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:52,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 11:39:52,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:39:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:39:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:39:52,905 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-02 11:39:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:52,977 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-02 11:39:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:39:52,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-02 11:39:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:52,978 INFO L225 Difference]: With dead ends: 14 [2018-10-02 11:39:52,978 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 11:39:52,979 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-02 11:39:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 11:39:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 11:39:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 11:39:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 11:39:52,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-02 11:39:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:52,983 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 11:39:52,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:39:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 11:39:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:39:52,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:52,984 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-02 11:39:52,984 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:52,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:52,984 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-10-02 11:39:52,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:52,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:52,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:52,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:52,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 11:39:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 11:39:53,045 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-02 11:39:53,067 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:53 BoogieIcfgContainer [2018-10-02 11:39:53,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:53,068 INFO L168 Benchmark]: Toolchain (without parser) took 3647.38 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-02 11:39:53,070 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:53,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.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-02 11:39:53,071 INFO L168 Benchmark]: Boogie Preprocessor took 21.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:53,072 INFO L168 Benchmark]: RCFGBuilder took 303.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:53,073 INFO L168 Benchmark]: TraceAbstraction took 3276.02 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: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:53,077 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.21 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 40.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 21.98 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 303.20 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 3276.02 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: 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.4s 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-02_11-39-53-092.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-02_11-39-53-092.csv Received shutdown request...