java -ea -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 -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/half_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:13:06,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:13:06,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:13:06,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:13:06,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:13:06,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:13:06,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:13:06,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:13:06,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:13:06,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:13:06,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:13:06,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:13:06,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:13:06,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:13:06,078 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:13:06,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:13:06,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:13:06,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:13:06,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:13:06,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:13:06,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:13:06,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:13:06,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:13:06,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:13:06,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:13:06,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:13:06,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:13:06,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:13:06,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:13:06,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:13:06,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:13:06,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:13:06,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:13:06,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:13:06,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:13:06,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:13:06,110 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:13:06,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:13:06,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:13:06,143 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:13:06,143 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:13:06,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:13:06,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:13:06,144 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:13:06,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:13:06,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:13:06,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:13:06,148 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:13:06,148 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:13:06,148 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:13:06,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:13:06,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:13:06,149 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:13:06,149 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:13:06,149 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:13:06,151 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:13:06,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:13:06,151 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:13:06,151 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:13:06,151 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:13:06,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:13:06,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:13:06,152 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:13:06,152 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:13:06,152 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:13:06,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:13:06,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:13:06,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:13:06,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:13:06,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:13:06,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:13:06,233 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:13:06,233 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:13:06,234 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half_true-unreach-call_true-termination.i [2018-11-23 13:13:06,294 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e8a1af1/26867f455afa41e79d3b9043bae244b2/FLAGf179d2dbd [2018-11-23 13:13:06,774 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:13:06,774 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half_true-unreach-call_true-termination.i [2018-11-23 13:13:06,785 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e8a1af1/26867f455afa41e79d3b9043bae244b2/FLAGf179d2dbd [2018-11-23 13:13:07,141 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e8a1af1/26867f455afa41e79d3b9043bae244b2 [2018-11-23 13:13:07,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:13:07,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:13:07,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:13:07,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:13:07,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:13:07,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7785a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07, skipping insertion in model container [2018-11-23 13:13:07,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:13:07,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:13:07,429 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:13:07,435 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:13:07,460 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:13:07,480 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:13:07,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07 WrapperNode [2018-11-23 13:13:07,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:13:07,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:13:07,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:13:07,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:13:07,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:13:07,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:13:07,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:13:07,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:13:07,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (1/1) ... [2018-11-23 13:13:07,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:13:07,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:13:07,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:13:07,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:13:07,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (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-11-23 13:13:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:13:07,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:13:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:13:07,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:13:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:13:07,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:13:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:13:07,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:13:08,229 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:13:08,230 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:13:08,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:08 BoogieIcfgContainer [2018-11-23 13:13:08,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:13:08,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:13:08,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:13:08,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:13:08,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:13:07" (1/3) ... [2018-11-23 13:13:08,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f537a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:13:08, skipping insertion in model container [2018-11-23 13:13:08,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:13:07" (2/3) ... [2018-11-23 13:13:08,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f537a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:13:08, skipping insertion in model container [2018-11-23 13:13:08,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:08" (3/3) ... [2018-11-23 13:13:08,241 INFO L112 eAbstractionObserver]: Analyzing ICFG half_true-unreach-call_true-termination.i [2018-11-23 13:13:08,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:13:08,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:13:08,277 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:13:08,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:13:08,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:13:08,311 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:13:08,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:13:08,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:13:08,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:13:08,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:13:08,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:13:08,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:13:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:13:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:13:08,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:08,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:08,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:08,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1995182865, now seen corresponding path program 1 times [2018-11-23 13:13:08,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:08,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:08,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:08,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:08,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:13:08,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:13:08,515 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2018-11-23 13:13:08,516 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2018-11-23 13:13:08,516 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 13:13:08,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {24#true} is VALID [2018-11-23 13:13:08,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:13:08,530 INFO L256 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {25#false} is VALID [2018-11-23 13:13:08,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:13:08,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:13:08,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:13:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:08,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:13:08,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:13:08,544 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:13:08,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:08,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:13:08,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:08,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:13:08,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:13:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:13:08,609 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:13:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:08,707 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 13:13:08,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:13:08,707 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:13:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:13:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 13:13:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:13:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-23 13:13:08,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-23 13:13:09,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:09,068 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:13:09,068 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:13:09,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:13:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:13:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:13:09,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:09,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:09,129 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:09,129 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,133 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:13:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:13:09,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:09,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:09,133 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:09,134 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:13:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,136 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:13:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:13:09,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:09,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:09,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:09,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:13:09,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-11-23 13:13:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:09,142 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:13:09,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:13:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:13:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:13:09,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:09,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:09,143 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:09,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2005341596, now seen corresponding path program 1 times [2018-11-23 13:13:09,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:09,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:09,559 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-23 13:13:09,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {119#true} is VALID [2018-11-23 13:13:09,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2018-11-23 13:13:09,782 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #42#return; {119#true} is VALID [2018-11-23 13:13:09,782 INFO L256 TraceCheckUtils]: 3: Hoare triple {119#true} call #t~ret4 := main(); {119#true} is VALID [2018-11-23 13:13:09,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {119#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {121#(and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (or (<= 0 main_~n~0) (<= main_~k~0 main_~n~0)))} is VALID [2018-11-23 13:13:09,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {121#(and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (or (<= 0 main_~n~0) (<= main_~k~0 main_~n~0)))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {122#(and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)))} is VALID [2018-11-23 13:13:09,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {122#(and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {123#(and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (<= main_~k~0 main_~n~0))} is VALID [2018-11-23 13:13:09,793 INFO L256 TraceCheckUtils]: 7: Hoare triple {123#(and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (<= main_~k~0 main_~n~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {124#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:09,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {124#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {125#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:13:09,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {125#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {120#false} is VALID [2018-11-23 13:13:09,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {120#false} assume !false; {120#false} is VALID [2018-11-23 13:13:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:13:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:13:09,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 13:13:09,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:09,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:13:09,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:09,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:13:09,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:13:09,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:13:09,827 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-11-23 13:13:10,191 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 13:13:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:10,694 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 13:13:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:13:10,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 13:13:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:13:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:13:10,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2018-11-23 13:13:10,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:10,775 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:13:10,775 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:13:10,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:13:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:13:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-11-23 13:13:10,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:10,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 15 states. [2018-11-23 13:13:10,813 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 15 states. [2018-11-23 13:13:10,814 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 15 states. [2018-11-23 13:13:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:10,817 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:13:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:13:10,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:10,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:10,818 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 21 states. [2018-11-23 13:13:10,818 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 21 states. [2018-11-23 13:13:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:10,821 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:13:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:13:10,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:10,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:10,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:10,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:13:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:13:10,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 13:13:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:10,824 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:13:10,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:13:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:13:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:13:10,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:10,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:10,826 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:10,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -763628086, now seen corresponding path program 1 times [2018-11-23 13:13:10,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {235#true} is VALID [2018-11-23 13:13:11,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#true} assume true; {235#true} is VALID [2018-11-23 13:13:11,084 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {235#true} {235#true} #42#return; {235#true} is VALID [2018-11-23 13:13:11,084 INFO L256 TraceCheckUtils]: 3: Hoare triple {235#true} call #t~ret4 := main(); {235#true} is VALID [2018-11-23 13:13:11,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {235#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {237#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:11,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {238#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:11,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {238#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {239#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} is VALID [2018-11-23 13:13:11,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {240#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:11,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {241#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:11,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {241#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {236#false} is VALID [2018-11-23 13:13:11,091 INFO L256 TraceCheckUtils]: 10: Hoare triple {236#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {236#false} is VALID [2018-11-23 13:13:11,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2018-11-23 13:13:11,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2018-11-23 13:13:11,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {236#false} assume !false; {236#false} is VALID [2018-11-23 13:13:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:11,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:11,094 INFO L223 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-11-23 13:13:11,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:11,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {235#true} is VALID [2018-11-23 13:13:11,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#true} assume true; {235#true} is VALID [2018-11-23 13:13:11,474 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {235#true} {235#true} #42#return; {235#true} is VALID [2018-11-23 13:13:11,474 INFO L256 TraceCheckUtils]: 3: Hoare triple {235#true} call #t~ret4 := main(); {235#true} is VALID [2018-11-23 13:13:11,475 INFO L273 TraceCheckUtils]: 4: Hoare triple {235#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {237#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:11,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {260#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:11,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {264#(and (<= 0 main_~n~0) (<= main_~n~0 0) (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 0))} is VALID [2018-11-23 13:13:11,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {264#(and (<= 0 main_~n~0) (<= main_~n~0 0) (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {268#(and (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 0))} is VALID [2018-11-23 13:13:11,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {268#(and (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {272#(and (< 0 (* 2 main_~k~0)) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:11,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {272#(and (< 0 (* 2 main_~k~0)) (<= main_~i~0 1))} assume !(~i~0 < 2 * ~k~0); {236#false} is VALID [2018-11-23 13:13:11,483 INFO L256 TraceCheckUtils]: 10: Hoare triple {236#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {236#false} is VALID [2018-11-23 13:13:11,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2018-11-23 13:13:11,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2018-11-23 13:13:11,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {236#false} assume !false; {236#false} is VALID [2018-11-23 13:13:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 13:13:11,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-11-23 13:13:11,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:11,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:13:11,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:11,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:13:11,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:13:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:13:11,585 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2018-11-23 13:13:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:12,111 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:13:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:13:12,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-11-23 13:13:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:13:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-23 13:13:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:13:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-23 13:13:12,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2018-11-23 13:13:12,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:12,238 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:13:12,238 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:13:12,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:13:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:13:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-23 13:13:12,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:12,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2018-11-23 13:13:12,283 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2018-11-23 13:13:12,283 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2018-11-23 13:13:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:12,285 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:13:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 13:13:12,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:12,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:12,287 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2018-11-23 13:13:12,288 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2018-11-23 13:13:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:12,290 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:13:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 13:13:12,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:12,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:12,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:12,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:13:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:13:12,293 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 13:13:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:12,293 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:13:12,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:13:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:13:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:13:12,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:12,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:12,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:12,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1429772124, now seen corresponding path program 2 times [2018-11-23 13:13:12,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:12,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:12,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:12,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-23 13:13:12,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-23 13:13:12,438 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {401#true} {401#true} #42#return; {401#true} is VALID [2018-11-23 13:13:12,438 INFO L256 TraceCheckUtils]: 3: Hoare triple {401#true} call #t~ret4 := main(); {401#true} is VALID [2018-11-23 13:13:12,439 INFO L273 TraceCheckUtils]: 4: Hoare triple {401#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {401#true} is VALID [2018-11-23 13:13:12,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:12,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:12,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:12,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:12,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < 2 * ~k~0); {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:12,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {402#false} is VALID [2018-11-23 13:13:12,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {402#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {402#false} is VALID [2018-11-23 13:13:12,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {402#false} assume !(~i~0 < 2 * ~k~0); {402#false} is VALID [2018-11-23 13:13:12,449 INFO L256 TraceCheckUtils]: 13: Hoare triple {402#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {402#false} is VALID [2018-11-23 13:13:12,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} ~cond := #in~cond; {402#false} is VALID [2018-11-23 13:13:12,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume 0 == ~cond; {402#false} is VALID [2018-11-23 13:13:12,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-23 13:13:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:12,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:12,452 INFO L223 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-11-23 13:13:12,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:12,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:12,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:12,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:12,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-23 13:13:12,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-23 13:13:12,560 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {401#true} {401#true} #42#return; {401#true} is VALID [2018-11-23 13:13:12,560 INFO L256 TraceCheckUtils]: 3: Hoare triple {401#true} call #t~ret4 := main(); {401#true} is VALID [2018-11-23 13:13:12,561 INFO L273 TraceCheckUtils]: 4: Hoare triple {401#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {401#true} is VALID [2018-11-23 13:13:12,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:12,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:12,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:12,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {403#(and (<= 0 main_~i~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:12,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < 2 * ~k~0); {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:12,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {402#false} is VALID [2018-11-23 13:13:12,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {402#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {402#false} is VALID [2018-11-23 13:13:12,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {402#false} assume !(~i~0 < 2 * ~k~0); {402#false} is VALID [2018-11-23 13:13:12,572 INFO L256 TraceCheckUtils]: 13: Hoare triple {402#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {402#false} is VALID [2018-11-23 13:13:12,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} ~cond := #in~cond; {402#false} is VALID [2018-11-23 13:13:12,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume 0 == ~cond; {402#false} is VALID [2018-11-23 13:13:12,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-23 13:13:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:12,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:12,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:13:12,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 13:13:12,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:12,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:13:12,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:12,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:13:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:13:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:13:12,678 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2018-11-23 13:13:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:12,777 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:13:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:13:12,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 13:13:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:13:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 13:13:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:13:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 13:13:12,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2018-11-23 13:13:12,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:12,831 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:13:12,831 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:13:12,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:13:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:13:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:13:12,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:12,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 13:13:12,853 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 13:13:12,853 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 13:13:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:12,856 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:13:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:13:12,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:12,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:12,857 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 13:13:12,857 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 13:13:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:12,860 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:13:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:13:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:12,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:12,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:12,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:13:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 13:13:12,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-11-23 13:13:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:12,864 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 13:13:12,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:13:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:13:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:13:12,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:12,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:12,865 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:12,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash 345235238, now seen corresponding path program 1 times [2018-11-23 13:13:12,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:12,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:12,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:13,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2018-11-23 13:13:13,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-23 13:13:13,490 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #42#return; {563#true} is VALID [2018-11-23 13:13:13,490 INFO L256 TraceCheckUtils]: 3: Hoare triple {563#true} call #t~ret4 := main(); {563#true} is VALID [2018-11-23 13:13:13,492 INFO L273 TraceCheckUtils]: 4: Hoare triple {563#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {565#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:13,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {565#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {566#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:13,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {567#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} is VALID [2018-11-23 13:13:13,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {567#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {568#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:13,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {568#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {569#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:13,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {569#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !!(~i~0 < 2 * ~k~0); {569#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:13,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {569#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {569#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:13,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {569#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {570#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:13,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {570#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {571#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:13,504 INFO L256 TraceCheckUtils]: 13: Hoare triple {571#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {572#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:13,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {572#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {573#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:13:13,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {573#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {564#false} is VALID [2018-11-23 13:13:13,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#false} assume !false; {564#false} is VALID [2018-11-23 13:13:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:13,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:13,508 INFO L223 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-11-23 13:13:13,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:13,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:13,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2018-11-23 13:13:13,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-23 13:13:13,938 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #42#return; {563#true} is VALID [2018-11-23 13:13:13,938 INFO L256 TraceCheckUtils]: 3: Hoare triple {563#true} call #t~ret4 := main(); {563#true} is VALID [2018-11-23 13:13:13,946 INFO L273 TraceCheckUtils]: 4: Hoare triple {563#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {565#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:13,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {565#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {592#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:13,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {592#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {592#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:13,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {592#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {599#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:13:13,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {599#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {603#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:13,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {603#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {607#(and (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:13,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {607#(and (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {607#(and (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:13,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {607#(and (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {614#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~n~0 1) (< 1 (* 2 main_~k~0)))} is VALID [2018-11-23 13:13:13,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~n~0 1) (< 1 (* 2 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {618#(and (<= (* 2 main_~k~0) 2) (<= 1 main_~n~0) (<= main_~n~0 1) (< 1 (* 2 main_~k~0)))} is VALID [2018-11-23 13:13:13,962 INFO L256 TraceCheckUtils]: 13: Hoare triple {618#(and (<= (* 2 main_~k~0) 2) (<= 1 main_~n~0) (<= main_~n~0 1) (< 1 (* 2 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {572#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:13,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {572#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {573#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:13:13,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {573#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {564#false} is VALID [2018-11-23 13:13:13,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#false} assume !false; {564#false} is VALID [2018-11-23 13:13:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:13,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:13,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-23 13:13:13,990 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-11-23 13:13:13,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:13,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:13:14,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:14,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:13:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:13:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:13:14,041 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 17 states. [2018-11-23 13:13:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:14,968 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 13:13:14,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:13:14,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-11-23 13:13:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:13:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2018-11-23 13:13:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:13:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2018-11-23 13:13:14,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 48 transitions. [2018-11-23 13:13:15,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:15,103 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:13:15,103 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:13:15,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:13:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:13:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-23 13:13:15,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:15,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 25 states. [2018-11-23 13:13:15,305 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 25 states. [2018-11-23 13:13:15,305 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 25 states. [2018-11-23 13:13:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:15,307 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:13:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:13:15,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:15,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:15,308 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 28 states. [2018-11-23 13:13:15,309 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 28 states. [2018-11-23 13:13:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:15,311 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:13:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:13:15,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:15,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:15,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:15,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:13:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 13:13:15,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2018-11-23 13:13:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:15,314 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 13:13:15,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:13:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:13:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:13:15,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:15,316 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:15,316 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:15,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1034664986, now seen corresponding path program 2 times [2018-11-23 13:13:15,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:15,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {792#true} call ULTIMATE.init(); {792#true} is VALID [2018-11-23 13:13:15,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {792#true} assume true; {792#true} is VALID [2018-11-23 13:13:15,524 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {792#true} {792#true} #42#return; {792#true} is VALID [2018-11-23 13:13:15,525 INFO L256 TraceCheckUtils]: 3: Hoare triple {792#true} call #t~ret4 := main(); {792#true} is VALID [2018-11-23 13:13:15,525 INFO L273 TraceCheckUtils]: 4: Hoare triple {792#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {792#true} is VALID [2018-11-23 13:13:15,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {792#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:15,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:15,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:15,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:15,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < 2 * ~k~0); {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:15,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:15,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:15,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < 2 * ~k~0); {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:15,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:15,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:15,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:15,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {793#false} is VALID [2018-11-23 13:13:15,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {793#false} is VALID [2018-11-23 13:13:15,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {793#false} assume !(~i~0 < 2 * ~k~0); {793#false} is VALID [2018-11-23 13:13:15,555 INFO L256 TraceCheckUtils]: 19: Hoare triple {793#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {793#false} is VALID [2018-11-23 13:13:15,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {793#false} ~cond := #in~cond; {793#false} is VALID [2018-11-23 13:13:15,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {793#false} assume 0 == ~cond; {793#false} is VALID [2018-11-23 13:13:15,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {793#false} assume !false; {793#false} is VALID [2018-11-23 13:13:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:15,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:15,558 INFO L223 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-11-23 13:13:15,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:15,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:15,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:15,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:15,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {792#true} call ULTIMATE.init(); {792#true} is VALID [2018-11-23 13:13:15,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {792#true} assume true; {792#true} is VALID [2018-11-23 13:13:15,767 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {792#true} {792#true} #42#return; {792#true} is VALID [2018-11-23 13:13:15,767 INFO L256 TraceCheckUtils]: 3: Hoare triple {792#true} call #t~ret4 := main(); {792#true} is VALID [2018-11-23 13:13:15,768 INFO L273 TraceCheckUtils]: 4: Hoare triple {792#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {792#true} is VALID [2018-11-23 13:13:15,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {792#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:15,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:15,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:13:15,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {794#(and (<= 0 main_~i~0) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:15,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < 2 * ~k~0); {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:15,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:15,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {795#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:15,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < 2 * ~k~0); {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:15,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:15,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {796#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:15,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:15,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {797#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {793#false} is VALID [2018-11-23 13:13:15,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {793#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {793#false} is VALID [2018-11-23 13:13:15,780 INFO L273 TraceCheckUtils]: 18: Hoare triple {793#false} assume !(~i~0 < 2 * ~k~0); {793#false} is VALID [2018-11-23 13:13:15,780 INFO L256 TraceCheckUtils]: 19: Hoare triple {793#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {793#false} is VALID [2018-11-23 13:13:15,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {793#false} ~cond := #in~cond; {793#false} is VALID [2018-11-23 13:13:15,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {793#false} assume 0 == ~cond; {793#false} is VALID [2018-11-23 13:13:15,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {793#false} assume !false; {793#false} is VALID [2018-11-23 13:13:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:13:15,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 13:13:15,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:15,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:13:15,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:15,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:13:15,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:13:15,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:13:15,833 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-23 13:13:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:16,086 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:13:16,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:13:16,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 13:13:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:13:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 13:13:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:13:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 13:13:16,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 13:13:16,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:16,135 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:13:16,136 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:13:16,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:13:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:13:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 13:13:16,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:16,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 13:13:16,225 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 13:13:16,225 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 13:13:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:16,227 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:13:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:13:16,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:16,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:16,228 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 13:13:16,228 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 13:13:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:16,230 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:13:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:13:16,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:16,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:16,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:16,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 13:13:16,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-11-23 13:13:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:16,233 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:13:16,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:13:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:13:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:13:16,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:16,235 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:16,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:16,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1744570554, now seen corresponding path program 3 times [2018-11-23 13:13:16,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:16,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:16,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:16,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2018-11-23 13:13:16,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2018-11-23 13:13:16,717 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #42#return; {1016#true} is VALID [2018-11-23 13:13:16,717 INFO L256 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret4 := main(); {1016#true} is VALID [2018-11-23 13:13:16,717 INFO L273 TraceCheckUtils]: 4: Hoare triple {1016#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1018#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:16,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1018#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:16,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:16,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1020#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} is VALID [2018-11-23 13:13:16,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {1020#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:16,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !!(~i~0 < 2 * ~k~0); {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:16,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:16,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:16,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:16,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1020#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} is VALID [2018-11-23 13:13:16,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {1020#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:16,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !!(~i~0 < 2 * ~k~0); {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:16,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:16,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {1021#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:16,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {1019#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1022#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} is VALID [2018-11-23 13:13:16,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {1022#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1023#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:16,733 INFO L273 TraceCheckUtils]: 20: Hoare triple {1023#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1024#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:16,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {1024#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1017#false} is VALID [2018-11-23 13:13:16,734 INFO L256 TraceCheckUtils]: 22: Hoare triple {1017#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1017#false} is VALID [2018-11-23 13:13:16,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {1017#false} ~cond := #in~cond; {1017#false} is VALID [2018-11-23 13:13:16,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {1017#false} assume 0 == ~cond; {1017#false} is VALID [2018-11-23 13:13:16,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2018-11-23 13:13:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:13:16,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:16,738 INFO L223 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-11-23 13:13:16,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:16,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:13:16,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:16,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:17,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2018-11-23 13:13:17,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {1016#true} assume true; {1016#true} is VALID [2018-11-23 13:13:17,293 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1016#true} {1016#true} #42#return; {1016#true} is VALID [2018-11-23 13:13:17,293 INFO L256 TraceCheckUtils]: 3: Hoare triple {1016#true} call #t~ret4 := main(); {1016#true} is VALID [2018-11-23 13:13:17,293 INFO L273 TraceCheckUtils]: 4: Hoare triple {1016#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1016#true} is VALID [2018-11-23 13:13:17,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {1016#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1043#(<= 0 main_~i~0)} is VALID [2018-11-23 13:13:17,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {1043#(<= 0 main_~i~0)} assume !!(~i~0 < 2 * ~k~0); {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume !!(~i~0 < 2 * ~k~0); {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume !!(~i~0 < 2 * ~k~0); {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume !!(~i~0 < 2 * ~k~0); {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1047#(<= 1 (* 2 main_~k~0))} is VALID [2018-11-23 13:13:17,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {1047#(<= 1 (* 2 main_~k~0))} assume !!(~i~0 < 2 * ~k~0); {1084#(and (< main_~i~0 (* 2 main_~k~0)) (<= 1 (* 2 main_~k~0)))} is VALID [2018-11-23 13:13:17,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#(and (< main_~i~0 (* 2 main_~k~0)) (<= 1 (* 2 main_~k~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1088#(and (< main_~i~0 (* 2 main_~k~0)) (<= 1 (* 2 main_~k~0)) (or (< main_~i~0 0) (<= (mod main_~i~0 2) 0)))} is VALID [2018-11-23 13:13:17,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {1088#(and (< main_~i~0 (* 2 main_~k~0)) (<= 1 (* 2 main_~k~0)) (or (< main_~i~0 0) (<= (mod main_~i~0 2) 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1092#(and (or (< main_~i~0 1) (<= (mod (+ main_~i~0 1) 2) 0)) (< main_~i~0 (+ (* 2 main_~k~0) 1)) (<= 1 (* 2 main_~k~0)))} is VALID [2018-11-23 13:13:17,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {1092#(and (or (< main_~i~0 1) (<= (mod (+ main_~i~0 1) 2) 0)) (< main_~i~0 (+ (* 2 main_~k~0) 1)) (<= 1 (* 2 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {1017#false} is VALID [2018-11-23 13:13:17,334 INFO L256 TraceCheckUtils]: 22: Hoare triple {1017#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1017#false} is VALID [2018-11-23 13:13:17,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {1017#false} ~cond := #in~cond; {1017#false} is VALID [2018-11-23 13:13:17,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {1017#false} assume 0 == ~cond; {1017#false} is VALID [2018-11-23 13:13:17,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2018-11-23 13:13:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:13:17,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:17,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 13:13:17,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 13:13:17,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:17,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:13:17,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:17,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:13:17,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:13:17,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:13:17,397 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-11-23 13:13:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:18,247 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 13:13:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:13:18,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 13:13:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-23 13:13:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:13:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-23 13:13:18,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2018-11-23 13:13:18,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:18,500 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:13:18,501 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:13:18,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:13:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:13:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:13:18,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:18,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:13:18,541 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:13:18,541 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:13:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:18,544 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:13:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:13:18,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:18,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:18,545 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:13:18,545 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:13:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:18,546 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:13:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:13:18,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:18,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:18,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:18,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:13:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:13:18,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-11-23 13:13:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:18,549 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:13:18,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:13:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:13:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:13:18,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:18,550 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:18,550 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:18,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash 45653034, now seen corresponding path program 4 times [2018-11-23 13:13:18,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:18,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:18,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:19,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-23 13:13:19,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 13:13:19,212 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #42#return; {1286#true} is VALID [2018-11-23 13:13:19,212 INFO L256 TraceCheckUtils]: 3: Hoare triple {1286#true} call #t~ret4 := main(); {1286#true} is VALID [2018-11-23 13:13:19,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {1286#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1288#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:19,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {1288#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:19,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:19,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1290#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} is VALID [2018-11-23 13:13:19,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {1290#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:19,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !!(~i~0 < 2 * ~k~0); {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:19,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:19,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:19,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:19,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1290#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} is VALID [2018-11-23 13:13:19,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {1290#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:19,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !!(~i~0 < 2 * ~k~0); {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:19,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} is VALID [2018-11-23 13:13:19,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {1291#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ main_~i~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2018-11-23 13:13:19,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {1289#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1292#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} is VALID [2018-11-23 13:13:19,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {1292#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (+ main_~n~0 1) main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1293#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:19,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {1293#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1294#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:19,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {1294#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !!(~i~0 < 2 * ~k~0); {1294#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:19,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {1294#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1294#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:19,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {1294#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1295#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:19,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {1295#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1296#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2018-11-23 13:13:19,234 INFO L256 TraceCheckUtils]: 25: Hoare triple {1296#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1297#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:19,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {1297#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1298#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:13:19,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {1298#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1287#false} is VALID [2018-11-23 13:13:19,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-23 13:13:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:13:19,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:19,240 INFO L223 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-11-23 13:13:19,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:19,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:19,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:19,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:19,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-23 13:13:19,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 13:13:19,737 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1286#true} {1286#true} #42#return; {1286#true} is VALID [2018-11-23 13:13:19,737 INFO L256 TraceCheckUtils]: 3: Hoare triple {1286#true} call #t~ret4 := main(); {1286#true} is VALID [2018-11-23 13:13:19,738 INFO L273 TraceCheckUtils]: 4: Hoare triple {1286#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1288#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2018-11-23 13:13:19,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {1288#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1317#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:19,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {1317#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} assume !!(~i~0 < 2 * ~k~0); {1317#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:19,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {1317#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= main_~i~0 0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1324#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:13:19,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {1324#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1328#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:19,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1328#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:19,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {1328#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1328#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:19,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {1328#(and (= main_~i~0 1) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1338#(and (= main_~i~0 2) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:19,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {1338#(and (= main_~i~0 2) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1338#(and (= main_~i~0 2) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2018-11-23 13:13:19,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {1338#(and (= main_~i~0 2) (<= 1 main_~n~0) (<= main_~n~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1345#(and (= main_~i~0 2) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2018-11-23 13:13:19,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {1345#(and (= main_~i~0 2) (<= 2 main_~n~0) (<= main_~n~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1349#(and (= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2018-11-23 13:13:19,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(and (= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} assume !!(~i~0 < 2 * ~k~0); {1349#(and (= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2018-11-23 13:13:19,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {1349#(and (= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1349#(and (= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2018-11-23 13:13:19,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {1349#(and (= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1359#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~i~0 4))} is VALID [2018-11-23 13:13:19,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {1359#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~i~0 4))} assume !!(~i~0 < 2 * ~k~0); {1359#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~i~0 4))} is VALID [2018-11-23 13:13:19,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {1359#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= main_~i~0 4))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post3 := ~n~0;~n~0 := 1 + #t~post3;havoc #t~post3; {1366#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= main_~i~0 4))} is VALID [2018-11-23 13:13:19,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1370#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= main_~i~0 5))} is VALID [2018-11-23 13:13:19,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {1370#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= main_~i~0 5))} assume !!(~i~0 < 2 * ~k~0); {1374#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:19,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {1374#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 5))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1374#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 5))} is VALID [2018-11-23 13:13:19,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {1374#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (= main_~i~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1381#(and (<= 3 main_~n~0) (< 5 (* 2 main_~k~0)) (<= main_~n~0 3) (<= main_~i~0 6))} is VALID [2018-11-23 13:13:19,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {1381#(and (<= 3 main_~n~0) (< 5 (* 2 main_~k~0)) (<= main_~n~0 3) (<= main_~i~0 6))} assume !(~i~0 < 2 * ~k~0); {1385#(and (<= 3 main_~n~0) (< 5 (* 2 main_~k~0)) (<= (* 2 main_~k~0) 6) (<= main_~n~0 3))} is VALID [2018-11-23 13:13:19,771 INFO L256 TraceCheckUtils]: 25: Hoare triple {1385#(and (<= 3 main_~n~0) (< 5 (* 2 main_~k~0)) (<= (* 2 main_~k~0) 6) (<= main_~n~0 3))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1297#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:19,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {1297#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1298#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:13:19,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {1298#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1287#false} is VALID [2018-11-23 13:13:19,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-23 13:13:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:19,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:19,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 25 [2018-11-23 13:13:19,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2018-11-23 13:13:19,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:19,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:13:19,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:19,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:13:19,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:13:19,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:13:19,846 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 25 states. [2018-11-23 13:13:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:21,711 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 13:13:21,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:13:21,711 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2018-11-23 13:13:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:13:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2018-11-23 13:13:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:13:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2018-11-23 13:13:21,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 39 transitions. [2018-11-23 13:13:21,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:21,771 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:13:21,771 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:13:21,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=213, Invalid=1679, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:13:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:13:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:13:21,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:21,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:13:21,773 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:13:21,773 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:13:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:21,774 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:13:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:13:21,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:21,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:21,774 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:13:21,774 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:13:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:21,775 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:13:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:13:21,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:21,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:21,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:21,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:13:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:13:21,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-23 13:13:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:21,776 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:13:21,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:13:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:13:21,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:21,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:13:22,010 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:13:22,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:13:22,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:13:22,010 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:13:22,011 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 22) the Hoare annotation is: true [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 19) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2018-11-23 13:13:22,011 INFO L444 ceAbstractionStarter]: At program point L15-3(lines 15 19) the Hoare annotation is: (let ((.cse1 (* 2 main_~n~0))) (let ((.cse2 (<= 0 main_~i~0)) (.cse4 (<= main_~i~0 .cse1)) (.cse3 (<= main_~n~0 main_~k~0))) (or (let ((.cse0 (+ main_~i~0 1))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (and (<= main_~n~0 0) .cse4 (= main_~i~0 0)) (and .cse2 .cse4 (<= .cse1 main_~i~0) .cse3)))) [2018-11-23 13:13:22,012 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 19) the Hoare annotation is: (and (or (<= main_~n~0 0) (< main_~n~0 (+ main_~k~0 1))) (<= main_~k~0 main_~n~0)) [2018-11-23 13:13:22,012 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:13:22,012 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:13:22,012 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:13:22,012 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:13:22,012 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:13:22,012 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:13:22,014 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:13:22,014 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:13:22,014 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:13:22,015 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:13:22,017 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:13:22,018 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:13:22,018 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 13:13:22,018 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:13:22,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:13:22 BoogieIcfgContainer [2018-11-23 13:13:22,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:13:22,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:13:22,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:13:22,030 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:13:22,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:13:08" (3/4) ... [2018-11-23 13:13:22,034 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:13:22,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:13:22,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:13:22,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:13:22,045 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 13:13:22,045 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:13:22,045 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:13:22,089 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-new/half_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:13:22,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:13:22,091 INFO L168 Benchmark]: Toolchain (without parser) took 14938.32 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -334.7 MB). Peak memory consumption was 531.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:13:22,092 INFO L168 Benchmark]: CDTParser 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-11-23 13:13:22,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:13:22,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:13:22,094 INFO L168 Benchmark]: Boogie Preprocessor took 30.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:13:22,094 INFO L168 Benchmark]: RCFGBuilder took 688.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:13:22,095 INFO L168 Benchmark]: TraceAbstraction took 13798.19 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 151.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 407.8 MB). Peak memory consumption was 559.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:13:22,096 INFO L168 Benchmark]: Witness Printer took 59.38 ms. Allocated memory is still 2.4 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:13:22,100 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser 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. * CACSL2BoogieTranslator took 326.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 688.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13798.19 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 151.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 407.8 MB). Peak memory consumption was 559.4 MB. Max. memory is 7.1 GB. * Witness Printer took 59.38 ms. Allocated memory is still 2.4 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((i + 1 <= 2 * n && 0 <= i) && 2 * n <= i + 1) && n <= k) || ((n <= 0 && i <= 2 * n) && i == 0)) || (((0 <= i && i <= 2 * n) && 2 * n <= i) && n <= k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 67 SDslu, 388 SDs, 0 SdLazy, 739 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 109 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=7, 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.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 31 NumberOfFragments, 69 HoareAnnotationTreeSize, 17 FomulaSimplifications, 298 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 114 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 34827 SizeOfPredicates, 14 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 66/238 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...