java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:27:02,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:27:02,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:27:02,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:27:02,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:27:02,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:27:02,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:27:02,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:27:02,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:27:02,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:27:02,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:27:02,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:27:02,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:27:02,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:27:02,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:27:02,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:27:02,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:27:02,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:27:02,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:27:02,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:27:02,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:27:02,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:27:02,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:27:02,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:27:02,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:27:02,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:27:02,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:27:02,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:27:02,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:27:02,104 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:27:02,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:27:02,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:27:02,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:27:02,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:27:02,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:27:02,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:27:02,108 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-09-30 10:27:02,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:27:02,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:27:02,124 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:27:02,124 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:27:02,124 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:27:02,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:27:02,125 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:27:02,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:27:02,125 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:27:02,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:27:02,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:27:02,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:27:02,126 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:27:02,126 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:27:02,126 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:27:02,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:27:02,127 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:27:02,127 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:27:02,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:27:02,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:27:02,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:27:02,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:27:02,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:27:02,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:27:02,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:27:02,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:27:02,129 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:27:02,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:27:02,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:27:02,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:27:02,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:27:02,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:27:02,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:27:02,194 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:27:02,194 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:27:02,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl [2018-09-30 10:27:02,196 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl' [2018-09-30 10:27:02,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:27:02,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:27:02,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:02,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:27:02,280 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:27:02,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:27:02,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:27:02,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:27:02,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:27:02,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/1) ... [2018-09-30 10:27:02,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:27:02,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:27:02,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:27:02,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:27:02,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (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-09-30 10:27:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:27:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:27:02,624 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:27:02,625 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:02 BoogieIcfgContainer [2018-09-30 10:27:02,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:27:02,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:27:02,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:27:02,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:27:02,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:27:02" (1/2) ... [2018-09-30 10:27:02,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a82f8fe and model type num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:27:02, skipping insertion in model container [2018-09-30 10:27:02,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:27:02" (2/2) ... [2018-09-30 10:27:02,633 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bpl [2018-09-30 10:27:02,643 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:27:02,652 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:27:02,711 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:27:02,712 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:27:02,712 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:27:02,712 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:27:02,712 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:27:02,713 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:27:02,713 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:27:02,713 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:27:02,713 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:27:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-30 10:27:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:27:02,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:02,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:27:02,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:02,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-30 10:27:02,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:02,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:03,024 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:27:03,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:27:03,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:27:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:27:03,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:03,046 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-30 10:27:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:03,106 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-30 10:27:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:27:03,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 10:27:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:03,117 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:27:03,117 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:27:03,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:27:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:27:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 10:27:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:27:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 10:27:03,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-30 10:27:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:03,157 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 10:27:03,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:27:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 10:27:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:27:03,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:03,158 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-30 10:27:03,158 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:03,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:03,159 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-30 10:27:03,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:03,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:03,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:03,341 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-09-30 10:27:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:03,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:03,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:03,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-09-30 10:27:03,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:27:03,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:27:03,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:03,507 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-09-30 10:27:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:03,566 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 10:27:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:27:03,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-09-30 10:27:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:03,568 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:27:03,568 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:27:03,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:27:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:27:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:27:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:27:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 10:27:03,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-30 10:27:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 10:27:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:27:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 10:27:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:27:03,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:03,575 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-30 10:27:03,575 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:03,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:03,576 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-30 10:27:03,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:03,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:03,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:03,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:03,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:03,768 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-09-30 10:27:03,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:27:03,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:27:03,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:03,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:04,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:04,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 10:27:04,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:27:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:27:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:27:04,025 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2018-09-30 10:27:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:04,153 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 10:27:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:27:04,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:27:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:04,154 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:27:04,154 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:27:04,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:27:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:27:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:27:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:27:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 10:27:04,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-30 10:27:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:04,161 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 10:27:04,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:27:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 10:27:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:27:04,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:04,162 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-30 10:27:04,166 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:04,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-30 10:27:04,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:04,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:04,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:04,414 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-09-30 10:27:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:27:04,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:27:04,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:04,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:05,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:05,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-09-30 10:27:05,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:27:05,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:27:05,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:27:05,172 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-09-30 10:27:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:05,264 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 10:27:05,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:27:05,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-30 10:27:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:05,266 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:27:05,266 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:27:05,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:27:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:27:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 10:27:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:27:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 10:27:05,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-30 10:27:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:05,275 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 10:27:05,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:27:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 10:27:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:27:05,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:05,276 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-30 10:27:05,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:05,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:05,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-30 10:27:05,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:05,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:05,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:05,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:05,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:05,544 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-09-30 10:27:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:27:05,586 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:27:05,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:05,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:05,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:05,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-30 10:27:05,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:27:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:27:05,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:27:05,994 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-09-30 10:27:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:06,189 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-30 10:27:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:27:06,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-09-30 10:27:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:06,190 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:27:06,191 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:27:06,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:27:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:27:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 10:27:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:27:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-30 10:27:06,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-30 10:27:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:06,198 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-30 10:27:06,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:27:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-30 10:27:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:27:06,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:06,200 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-30 10:27:06,200 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:06,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-30 10:27:06,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:06,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:06,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:06,530 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:06,530 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-09-30 10:27:06,550 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:27:06,641 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:27:06,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:06,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:07,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:07,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 10:27:07,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:27:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:27:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:27:07,577 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-09-30 10:27:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:07,819 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 10:27:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:27:07,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-30 10:27:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:07,822 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:27:07,823 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:27:07,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:27:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:27:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 10:27:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:27:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:27:07,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-30 10:27:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:07,832 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:27:07,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:27:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:27:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:27:07,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:07,833 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-30 10:27:07,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:07,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-30 10:27:07,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:07,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:07,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:07,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:07,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:07,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:07,995 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-09-30 10:27:08,008 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:27:08,036 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:27:08,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:27:08,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:10,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:10,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-30 10:27:10,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:27:10,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:27:10,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:27:10,975 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-09-30 10:27:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:11,376 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-30 10:27:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:27:11,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-09-30 10:27:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:11,378 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:27:11,378 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:27:11,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:27:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:27:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 10:27:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 10:27:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-30 10:27:11,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-30 10:27:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:11,387 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-30 10:27:11,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:27:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-30 10:27:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:27:11,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:11,388 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-30 10:27:11,389 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:11,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-09-30 10:27:11,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:11,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:11,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:27:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:11,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:27:11,684 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-09-30 10:27:11,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:27:11,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:27:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:27:17,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:27:17,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-09-30 10:27:17,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:27:17,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:27:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:27:17,756 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-09-30 10:27:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:27:18,240 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 10:27:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:27:18,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-30 10:27:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:27:18,242 INFO L225 Difference]: With dead ends: 23 [2018-09-30 10:27:18,242 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 10:27:18,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:27:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 10:27:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-30 10:27:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 10:27:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 10:27:18,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-30 10:27:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:27:18,252 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 10:27:18,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:27:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 10:27:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:27:18,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:27:18,253 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-30 10:27:18,254 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:27:18,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:27:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-09-30 10:27:18,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:27:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:27:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:27:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:27:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 10:27:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 10:27:18,302 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-30 10:27:18,328 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:27:18 BoogieIcfgContainer [2018-09-30 10:27:18,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:27:18,329 INFO L168 Benchmark]: Toolchain (without parser) took 16052.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 351.6 MB). Peak memory consumption was 351.6 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:18,331 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-09-30 10:27:18,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.28 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-09-30 10:27:18,332 INFO L168 Benchmark]: Boogie Preprocessor took 20.12 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-09-30 10:27:18,333 INFO L168 Benchmark]: RCFGBuilder took 281.88 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-09-30 10:27:18,334 INFO L168 Benchmark]: TraceAbstraction took 15702.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 330.5 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:27:18,338 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.23 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.28 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 20.12 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 281.88 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 15702.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 330.5 MB). Peak memory consumption was 330.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 39, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~x~5, main_~y~5, main_~c~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] [L25] assume true; VAL [main_~c~5=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L30] assume !(main_~c~5 % 256 < 8); [L31] __VERIFIER_assert_#in~cond := (if main_~x~5 % 256 == main_~y~5 % 256 then 1 else 0); [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; [L35] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 15.6s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 254 SDs, 0 SdLazy, 334 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 157 ConstructedInterpolants, 56 QuantifiedInterpolants, 42529 SizeOfPredicates, 10 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 0/336 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-27-18-350.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-27-18-350.csv Received shutdown request...