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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:34:05,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:34:05,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:34:05,490 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:34:05,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:34:05,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:34:05,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:34:05,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:34:05,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:34:05,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:34:05,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:34:05,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:34:05,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:34:05,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:34:05,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:34:05,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:34:05,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:34:05,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:34:05,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:34:05,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:34:05,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:34:05,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:34:05,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:34:05,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:34:05,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:34:05,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:34:05,527 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:34:05,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:34:05,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:34:05,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:34:05,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:34:05,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:34:05,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:34:05,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:34:05,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:34:05,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:34:05,534 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-14 17:34:05,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:34:05,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:34:05,549 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:34:05,550 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:34:05,550 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:34:05,550 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:34:05,551 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:34:05,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:34:05,551 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:34:05,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:34:05,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:34:05,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:34:05,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:34:05,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:34:05,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:34:05,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:34:05,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:34:05,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:34:05,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:34:05,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:34:05,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:34:05,554 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:34:05,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:05,554 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:34:05,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:34:05,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:34:05,555 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:34:05,555 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:34:05,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:34:05,555 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:34:05,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:34:05,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:34:05,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:34:05,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:34:05,624 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:34:05,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-14 17:34:05,678 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8bb943d/e6cd9154b8a042ae930ddb1f63fff9ef/FLAG151610074 [2018-11-14 17:34:06,104 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:34:06,104 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-14 17:34:06,112 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8bb943d/e6cd9154b8a042ae930ddb1f63fff9ef/FLAG151610074 [2018-11-14 17:34:06,128 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8bb943d/e6cd9154b8a042ae930ddb1f63fff9ef [2018-11-14 17:34:06,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:34:06,139 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:34:06,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:06,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:34:06,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:34:06,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06, skipping insertion in model container [2018-11-14 17:34:06,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:34:06,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:34:06,412 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:06,417 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:34:06,440 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:06,457 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:34:06,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06 WrapperNode [2018-11-14 17:34:06,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:06,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:34:06,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:34:06,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:34:06,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (1/1) ... [2018-11-14 17:34:06,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:34:06,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:34:06,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:34:06,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:34:06,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (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-14 17:34:06,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:34:06,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:34:06,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:34:06,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:34:06,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:34:06,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:34:06,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:34:06,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:34:06,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:34:06,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:34:06,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:34:07,208 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:34:07,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:07 BoogieIcfgContainer [2018-11-14 17:34:07,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:34:07,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:34:07,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:34:07,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:34:07,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:06" (1/3) ... [2018-11-14 17:34:07,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37985866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:07, skipping insertion in model container [2018-11-14 17:34:07,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:06" (2/3) ... [2018-11-14 17:34:07,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37985866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:07, skipping insertion in model container [2018-11-14 17:34:07,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:07" (3/3) ... [2018-11-14 17:34:07,218 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const_true-unreach-call_true-termination.i [2018-11-14 17:34:07,228 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:34:07,237 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:34:07,255 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:34:07,288 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:34:07,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:34:07,289 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:34:07,289 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:34:07,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:34:07,289 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:34:07,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:34:07,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:34:07,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:34:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 17:34:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:34:07,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:07,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:07,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:07,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1169309281, now seen corresponding path program 1 times [2018-11-14 17:34:07,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:07,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:07,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 17:34:07,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 17:34:07,478 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2018-11-14 17:34:07,479 INFO L256 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {30#true} is VALID [2018-11-14 17:34:07,479 INFO L273 TraceCheckUtils]: 4: Hoare triple {30#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {30#true} is VALID [2018-11-14 17:34:07,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {30#true} is VALID [2018-11-14 17:34:07,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 17:34:07,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~j~0 := 0; {31#false} is VALID [2018-11-14 17:34:07,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 17:34:07,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume !!(~j~0 < ~n~0); {31#false} is VALID [2018-11-14 17:34:07,482 INFO L256 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31#false} is VALID [2018-11-14 17:34:07,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 17:34:07,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume ~cond == 0; {31#false} is VALID [2018-11-14 17:34:07,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 17:34:07,486 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-14 17:34:07,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:07,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:34:07,494 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:34:07,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:07,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:34:07,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:07,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:34:07,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:34:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:34:07,631 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 17:34:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:07,907 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-14 17:34:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:34:07,907 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:34:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:34:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-14 17:34:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:34:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-14 17:34:07,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-14 17:34:08,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:08,090 INFO L225 Difference]: With dead ends: 43 [2018-11-14 17:34:08,090 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:34:08,094 INFO L604 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-14 17:34:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:34:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:34:08,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:08,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:34:08,234 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:34:08,234 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:34:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:08,239 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 17:34:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 17:34:08,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:08,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:08,240 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:34:08,240 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:34:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:08,245 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 17:34:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 17:34:08,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:08,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:08,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:08,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:34:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-14 17:34:08,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-14 17:34:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:08,254 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-14 17:34:08,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:34:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 17:34:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:34:08,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:08,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:08,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:08,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash -659000362, now seen corresponding path program 1 times [2018-11-14 17:34:08,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:08,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:08,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:08,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:08,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:08,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {162#true} is VALID [2018-11-14 17:34:08,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2018-11-14 17:34:08,553 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #67#return; {162#true} is VALID [2018-11-14 17:34:08,554 INFO L256 TraceCheckUtils]: 3: Hoare triple {162#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {162#true} is VALID [2018-11-14 17:34:08,554 INFO L273 TraceCheckUtils]: 4: Hoare triple {162#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {162#true} is VALID [2018-11-14 17:34:08,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {162#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {164#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:08,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {164#(<= main_~i~0 0)} assume true; {164#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:08,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {164#(<= main_~i~0 0)} assume !(~i~0 < ~n~0); {165#(<= main_~n~0 0)} is VALID [2018-11-14 17:34:08,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {165#(<= main_~n~0 0)} ~j~0 := 0; {166#(<= main_~n~0 main_~j~0)} is VALID [2018-11-14 17:34:08,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {166#(<= main_~n~0 main_~j~0)} assume true; {166#(<= main_~n~0 main_~j~0)} is VALID [2018-11-14 17:34:08,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {166#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {163#false} is VALID [2018-11-14 17:34:08,588 INFO L256 TraceCheckUtils]: 11: Hoare triple {163#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {163#false} is VALID [2018-11-14 17:34:08,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {163#false} ~cond := #in~cond; {163#false} is VALID [2018-11-14 17:34:08,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {163#false} assume ~cond == 0; {163#false} is VALID [2018-11-14 17:34:08,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {163#false} assume !false; {163#false} is VALID [2018-11-14 17:34:08,592 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-14 17:34:08,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:08,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:08,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 17:34:08,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:08,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:08,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:08,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:08,645 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2018-11-14 17:34:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:09,511 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:34:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:09,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 17:34:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-14 17:34:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-14 17:34:09,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2018-11-14 17:34:09,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:09,614 INFO L225 Difference]: With dead ends: 37 [2018-11-14 17:34:09,614 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:34:09,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:34:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:34:09,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:09,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:34:09,628 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:34:09,628 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:34:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:09,630 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 17:34:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 17:34:09,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:09,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:09,631 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:34:09,631 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:34:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:09,634 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 17:34:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 17:34:09,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:09,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:09,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:09,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:34:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-14 17:34:09,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-14 17:34:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:09,638 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-14 17:34:09,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 17:34:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:34:09,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:09,639 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:09,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:09,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 701537581, now seen corresponding path program 1 times [2018-11-14 17:34:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:09,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2018-11-14 17:34:09,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2018-11-14 17:34:09,842 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #67#return; {304#true} is VALID [2018-11-14 17:34:09,843 INFO L256 TraceCheckUtils]: 3: Hoare triple {304#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2018-11-14 17:34:09,855 INFO L273 TraceCheckUtils]: 4: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {306#(<= 4000 main_~c1~0)} is VALID [2018-11-14 17:34:09,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {307#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-14 17:34:09,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#(<= 4000 (+ main_~c1~0 main_~k~0))} assume true; {307#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-14 17:34:09,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {307#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {307#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-14 17:34:09,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {307#(<= 4000 (+ main_~c1~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {307#(<= 4000 (+ main_~c1~0 main_~k~0))} is VALID [2018-11-14 17:34:09,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {307#(<= 4000 (+ main_~c1~0 main_~k~0))} assume ~v~0 == 0;~k~0 := ~k~0 + ~c1~0; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:09,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(<= 4000 main_~k~0)} assume true; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:09,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {308#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:09,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {308#(<= 4000 main_~k~0)} ~j~0 := 0; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:09,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#(<= 4000 main_~k~0)} assume true; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:09,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {308#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:09,870 INFO L256 TraceCheckUtils]: 15: Hoare triple {308#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {309#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:09,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {309#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {310#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:09,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {310#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {305#false} is VALID [2018-11-14 17:34:09,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {305#false} assume !false; {305#false} is VALID [2018-11-14 17:34:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:09,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:09,876 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-14 17:34:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:09,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:10,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {304#true} is VALID [2018-11-14 17:34:10,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {304#true} assume true; {304#true} is VALID [2018-11-14 17:34:10,231 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {304#true} {304#true} #67#return; {304#true} is VALID [2018-11-14 17:34:10,232 INFO L256 TraceCheckUtils]: 3: Hoare triple {304#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {304#true} is VALID [2018-11-14 17:34:10,245 INFO L273 TraceCheckUtils]: 4: Hoare triple {304#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {306#(<= 4000 main_~c1~0)} is VALID [2018-11-14 17:34:10,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:10,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume true; {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:10,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:10,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:10,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= 4000 main_~c1~0) (<= 0 main_~k~0))} assume ~v~0 == 0;~k~0 := ~k~0 + ~c1~0; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:10,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(<= 4000 main_~k~0)} assume true; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:10,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {308#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:10,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {308#(<= 4000 main_~k~0)} ~j~0 := 0; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:10,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {308#(<= 4000 main_~k~0)} assume true; {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:10,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {308#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {308#(<= 4000 main_~k~0)} is VALID [2018-11-14 17:34:10,287 INFO L256 TraceCheckUtils]: 15: Hoare triple {308#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {309#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:10,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {309#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {310#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:10,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {310#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {305#false} is VALID [2018-11-14 17:34:10,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {305#false} assume !false; {305#false} is VALID [2018-11-14 17:34:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:10,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:10,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:34:10,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:34:10,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:10,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:10,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:10,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:10,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:10,463 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 8 states. [2018-11-14 17:34:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:11,077 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-14 17:34:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:11,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:34:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:34:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:34:11,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 17:34:11,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:11,192 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:34:11,192 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:34:11,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:34:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-14 17:34:11,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:11,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2018-11-14 17:34:11,225 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2018-11-14 17:34:11,226 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2018-11-14 17:34:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:11,232 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-14 17:34:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-14 17:34:11,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:11,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:11,233 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2018-11-14 17:34:11,233 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2018-11-14 17:34:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:11,237 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-14 17:34:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-14 17:34:11,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:11,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:11,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:11,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:34:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-14 17:34:11,242 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 19 [2018-11-14 17:34:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:11,242 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-14 17:34:11,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-14 17:34:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:34:11,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:11,244 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:11,244 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:11,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1708424439, now seen corresponding path program 1 times [2018-11-14 17:34:11,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:11,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:11,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:11,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:11,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 17:34:11,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 17:34:11,432 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {573#true} {573#true} #67#return; {573#true} is VALID [2018-11-14 17:34:11,433 INFO L256 TraceCheckUtils]: 3: Hoare triple {573#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {573#true} is VALID [2018-11-14 17:34:11,433 INFO L273 TraceCheckUtils]: 4: Hoare triple {573#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {575#(<= 10000 main_~c3~0)} is VALID [2018-11-14 17:34:11,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {575#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {576#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-14 17:34:11,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {576#(<= 10000 (+ main_~c3~0 main_~k~0))} assume true; {576#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-14 17:34:11,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {576#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {576#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-14 17:34:11,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {576#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {576#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-14 17:34:11,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(~v~0 == 0); {576#(<= 10000 (+ main_~c3~0 main_~k~0))} is VALID [2018-11-14 17:34:11,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {576#(<= 10000 (+ main_~c3~0 main_~k~0))} assume !(~v~0 == 1);~k~0 := ~k~0 + ~c3~0; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {577#(<= 10000 main_~k~0)} assume true; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {577#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {577#(<= 10000 main_~k~0)} ~j~0 := 0; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {577#(<= 10000 main_~k~0)} assume true; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {577#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,442 INFO L256 TraceCheckUtils]: 16: Hoare triple {577#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {578#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:11,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {578#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {579#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:11,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {574#false} is VALID [2018-11-14 17:34:11,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 17:34:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:11,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:11,447 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-14 17:34:11,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:11,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:11,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 17:34:11,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 17:34:11,616 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {573#true} {573#true} #67#return; {573#true} is VALID [2018-11-14 17:34:11,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {573#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {573#true} is VALID [2018-11-14 17:34:11,617 INFO L273 TraceCheckUtils]: 4: Hoare triple {573#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {575#(<= 10000 main_~c3~0)} is VALID [2018-11-14 17:34:11,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {575#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:11,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume true; {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:11,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:11,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:11,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(~v~0 == 0); {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:11,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {598#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(~v~0 == 1);~k~0 := ~k~0 + ~c3~0; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {577#(<= 10000 main_~k~0)} assume true; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {577#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {577#(<= 10000 main_~k~0)} ~j~0 := 0; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {577#(<= 10000 main_~k~0)} assume true; {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {577#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {577#(<= 10000 main_~k~0)} is VALID [2018-11-14 17:34:11,626 INFO L256 TraceCheckUtils]: 16: Hoare triple {577#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {578#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:11,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {578#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {579#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:11,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {574#false} is VALID [2018-11-14 17:34:11,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 17:34:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:11,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:11,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:34:11,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 17:34:11,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:11,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:11,683 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-14 17:34:11,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:11,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:11,684 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2018-11-14 17:34:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:12,408 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-14 17:34:12,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:12,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 17:34:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:34:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:34:12,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 17:34:12,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:12,523 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:34:12,524 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:34:12,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:34:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-11-14 17:34:12,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:12,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 43 states. [2018-11-14 17:34:12,608 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 43 states. [2018-11-14 17:34:12,608 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 43 states. [2018-11-14 17:34:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:12,612 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-14 17:34:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-14 17:34:12,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:12,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:12,614 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 57 states. [2018-11-14 17:34:12,614 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 57 states. [2018-11-14 17:34:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:12,618 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-14 17:34:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-14 17:34:12,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:12,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:12,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:12,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:34:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-14 17:34:12,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 20 [2018-11-14 17:34:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:12,623 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-14 17:34:12,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-14 17:34:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:34:12,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:12,624 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:12,624 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:12,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1315397429, now seen corresponding path program 1 times [2018-11-14 17:34:12,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:12,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:12,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:12,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {893#true} call ULTIMATE.init(); {893#true} is VALID [2018-11-14 17:34:12,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {893#true} assume true; {893#true} is VALID [2018-11-14 17:34:12,743 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {893#true} {893#true} #67#return; {893#true} is VALID [2018-11-14 17:34:12,744 INFO L256 TraceCheckUtils]: 3: Hoare triple {893#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {893#true} is VALID [2018-11-14 17:34:12,744 INFO L273 TraceCheckUtils]: 4: Hoare triple {893#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {895#(<= 2000 main_~c2~0)} is VALID [2018-11-14 17:34:12,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {895#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {896#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-14 17:34:12,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {896#(<= 2000 (+ main_~c2~0 main_~k~0))} assume true; {896#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-14 17:34:12,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {896#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {896#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-14 17:34:12,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {896#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {896#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-14 17:34:12,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {896#(<= 2000 (+ main_~c2~0 main_~k~0))} assume !(~v~0 == 0); {896#(<= 2000 (+ main_~c2~0 main_~k~0))} is VALID [2018-11-14 17:34:12,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {896#(<= 2000 (+ main_~c2~0 main_~k~0))} assume ~v~0 == 1;~k~0 := ~k~0 + ~c2~0; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {897#(<= 2000 main_~k~0)} assume true; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,755 INFO L273 TraceCheckUtils]: 12: Hoare triple {897#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {897#(<= 2000 main_~k~0)} ~j~0 := 0; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {897#(<= 2000 main_~k~0)} assume true; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {897#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,777 INFO L256 TraceCheckUtils]: 16: Hoare triple {897#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {898#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:12,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {898#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {899#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:12,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {899#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {894#false} is VALID [2018-11-14 17:34:12,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {894#false} assume !false; {894#false} is VALID [2018-11-14 17:34:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:12,781 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-14 17:34:12,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:12,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:12,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {893#true} call ULTIMATE.init(); {893#true} is VALID [2018-11-14 17:34:12,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {893#true} assume true; {893#true} is VALID [2018-11-14 17:34:12,935 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {893#true} {893#true} #67#return; {893#true} is VALID [2018-11-14 17:34:12,936 INFO L256 TraceCheckUtils]: 3: Hoare triple {893#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {893#true} is VALID [2018-11-14 17:34:12,939 INFO L273 TraceCheckUtils]: 4: Hoare triple {893#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {895#(<= 2000 main_~c2~0)} is VALID [2018-11-14 17:34:12,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {895#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:12,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume true; {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:12,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:12,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:12,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume !(~v~0 == 0); {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} is VALID [2018-11-14 17:34:12,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(and (<= 2000 main_~c2~0) (<= 0 main_~k~0))} assume ~v~0 == 1;~k~0 := ~k~0 + ~c2~0; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {897#(<= 2000 main_~k~0)} assume true; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {897#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {897#(<= 2000 main_~k~0)} ~j~0 := 0; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {897#(<= 2000 main_~k~0)} assume true; {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {897#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {897#(<= 2000 main_~k~0)} is VALID [2018-11-14 17:34:12,947 INFO L256 TraceCheckUtils]: 16: Hoare triple {897#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {898#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:12,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {898#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {899#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:12,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {899#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {894#false} is VALID [2018-11-14 17:34:12,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {894#false} assume !false; {894#false} is VALID [2018-11-14 17:34:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:12,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:12,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:34:12,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 17:34:12,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:12,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:34:13,007 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-14 17:34:13,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:34:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:34:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:13,008 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 8 states. [2018-11-14 17:34:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:13,592 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-14 17:34:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:13,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-14 17:34:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:34:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:34:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:34:13,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 17:34:13,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:13,700 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:34:13,700 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 17:34:13,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 17:34:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-11-14 17:34:13,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:13,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 49 states. [2018-11-14 17:34:13,751 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 49 states. [2018-11-14 17:34:13,752 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 49 states. [2018-11-14 17:34:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:13,756 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-14 17:34:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-11-14 17:34:13,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:13,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:13,758 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 62 states. [2018-11-14 17:34:13,758 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 62 states. [2018-11-14 17:34:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:13,762 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-14 17:34:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-11-14 17:34:13,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:13,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:13,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:13,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 17:34:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2018-11-14 17:34:13,767 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 20 [2018-11-14 17:34:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:13,767 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2018-11-14 17:34:13,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:34:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-14 17:34:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:34:13,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:13,769 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:13,769 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:13,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1019570158, now seen corresponding path program 1 times [2018-11-14 17:34:13,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:13,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:13,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:13,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2018-11-14 17:34:13,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {1236#true} assume true; {1236#true} is VALID [2018-11-14 17:34:13,879 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1236#true} {1236#true} #67#return; {1236#true} is VALID [2018-11-14 17:34:13,880 INFO L256 TraceCheckUtils]: 3: Hoare triple {1236#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1236#true} is VALID [2018-11-14 17:34:13,880 INFO L273 TraceCheckUtils]: 4: Hoare triple {1236#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1236#true} is VALID [2018-11-14 17:34:13,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {1236#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1238#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {1238#(<= 0 main_~i~0)} assume true; {1238#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {1238#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1239#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:13,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {1239#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1240#(<= main_~n~0 main_~i~0)} is VALID [2018-11-14 17:34:13,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {1240#(<= main_~n~0 main_~i~0)} assume ~v~0 == 0;~k~0 := ~k~0 + ~c1~0; {1240#(<= main_~n~0 main_~i~0)} is VALID [2018-11-14 17:34:13,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {1240#(<= main_~n~0 main_~i~0)} assume true; {1240#(<= main_~n~0 main_~i~0)} is VALID [2018-11-14 17:34:13,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {1240#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1237#false} is VALID [2018-11-14 17:34:13,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {1237#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1237#false} is VALID [2018-11-14 17:34:13,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {1237#false} assume !(~v~0 == 0); {1237#false} is VALID [2018-11-14 17:34:13,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {1237#false} assume !(~v~0 == 1);~k~0 := ~k~0 + ~c3~0; {1237#false} is VALID [2018-11-14 17:34:13,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 17:34:13,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {1237#false} assume !(~i~0 < ~n~0); {1237#false} is VALID [2018-11-14 17:34:13,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {1237#false} ~j~0 := 0; {1237#false} is VALID [2018-11-14 17:34:13,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 17:34:13,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {1237#false} assume !!(~j~0 < ~n~0); {1237#false} is VALID [2018-11-14 17:34:13,889 INFO L256 TraceCheckUtils]: 20: Hoare triple {1237#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1237#false} is VALID [2018-11-14 17:34:13,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {1237#false} ~cond := #in~cond; {1237#false} is VALID [2018-11-14 17:34:13,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {1237#false} assume ~cond == 0; {1237#false} is VALID [2018-11-14 17:34:13,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2018-11-14 17:34:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:13,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:13,891 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-14 17:34:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:13,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:14,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2018-11-14 17:34:14,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {1236#true} assume true; {1236#true} is VALID [2018-11-14 17:34:14,078 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1236#true} {1236#true} #67#return; {1236#true} is VALID [2018-11-14 17:34:14,078 INFO L256 TraceCheckUtils]: 3: Hoare triple {1236#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1236#true} is VALID [2018-11-14 17:34:14,078 INFO L273 TraceCheckUtils]: 4: Hoare triple {1236#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1236#true} is VALID [2018-11-14 17:34:14,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {1236#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1238#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {1238#(<= 0 main_~i~0)} assume true; {1238#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {1238#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1239#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:14,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {1239#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1268#(and (<= 1 main_~i~0) (< main_~n~0 2))} is VALID [2018-11-14 17:34:14,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {1268#(and (<= 1 main_~i~0) (< main_~n~0 2))} assume ~v~0 == 0;~k~0 := ~k~0 + ~c1~0; {1268#(and (<= 1 main_~i~0) (< main_~n~0 2))} is VALID [2018-11-14 17:34:14,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {1268#(and (<= 1 main_~i~0) (< main_~n~0 2))} assume true; {1268#(and (<= 1 main_~i~0) (< main_~n~0 2))} is VALID [2018-11-14 17:34:14,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {1268#(and (<= 1 main_~i~0) (< main_~n~0 2))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1237#false} is VALID [2018-11-14 17:34:14,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {1237#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1237#false} is VALID [2018-11-14 17:34:14,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {1237#false} assume !(~v~0 == 0); {1237#false} is VALID [2018-11-14 17:34:14,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {1237#false} assume !(~v~0 == 1);~k~0 := ~k~0 + ~c3~0; {1237#false} is VALID [2018-11-14 17:34:14,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 17:34:14,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {1237#false} assume !(~i~0 < ~n~0); {1237#false} is VALID [2018-11-14 17:34:14,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {1237#false} ~j~0 := 0; {1237#false} is VALID [2018-11-14 17:34:14,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {1237#false} assume true; {1237#false} is VALID [2018-11-14 17:34:14,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {1237#false} assume !!(~j~0 < ~n~0); {1237#false} is VALID [2018-11-14 17:34:14,084 INFO L256 TraceCheckUtils]: 20: Hoare triple {1237#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1237#false} is VALID [2018-11-14 17:34:14,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {1237#false} ~cond := #in~cond; {1237#false} is VALID [2018-11-14 17:34:14,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {1237#false} assume ~cond == 0; {1237#false} is VALID [2018-11-14 17:34:14,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2018-11-14 17:34:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:14,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:14,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-14 17:34:14,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 17:34:14,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:14,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:14,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:14,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:14,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:14,151 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 6 states. [2018-11-14 17:34:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:14,325 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-14 17:34:14,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:14,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 17:34:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 17:34:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 17:34:14,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-14 17:34:14,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:14,497 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:34:14,497 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:34:14,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:34:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-14 17:34:14,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:14,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-14 17:34:14,563 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-14 17:34:14,563 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-14 17:34:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:14,566 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-14 17:34:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 17:34:14,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:14,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:14,567 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-14 17:34:14,567 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-14 17:34:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:14,569 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-14 17:34:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 17:34:14,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:14,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:14,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:14,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:34:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-14 17:34:14,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-11-14 17:34:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:14,572 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-14 17:34:14,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 17:34:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:34:14,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:14,574 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:14,574 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:14,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1155724272, now seen corresponding path program 1 times [2018-11-14 17:34:14,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:14,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:14,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:14,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:14,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:14,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1523#true} is VALID [2018-11-14 17:34:14,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-14 17:34:14,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} #67#return; {1523#true} is VALID [2018-11-14 17:34:14,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {1523#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1523#true} is VALID [2018-11-14 17:34:14,663 INFO L273 TraceCheckUtils]: 4: Hoare triple {1523#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1523#true} is VALID [2018-11-14 17:34:14,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {1523#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1523#true} is VALID [2018-11-14 17:34:14,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-14 17:34:14,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#true} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1523#true} is VALID [2018-11-14 17:34:14,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {1525#(<= main_~n~0 1)} is VALID [2018-11-14 17:34:14,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {1525#(<= main_~n~0 1)} assume ~v~0 == 0;~k~0 := ~k~0 + ~c1~0; {1525#(<= main_~n~0 1)} is VALID [2018-11-14 17:34:14,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {1525#(<= main_~n~0 1)} assume true; {1525#(<= main_~n~0 1)} is VALID [2018-11-14 17:34:14,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {1525#(<= main_~n~0 1)} assume !(~i~0 < ~n~0); {1525#(<= main_~n~0 1)} is VALID [2018-11-14 17:34:14,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {1525#(<= main_~n~0 1)} ~j~0 := 0; {1526#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-14 17:34:14,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {1526#(<= main_~n~0 (+ main_~j~0 1))} assume true; {1526#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-14 17:34:14,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {1526#(<= main_~n~0 (+ main_~j~0 1))} assume !!(~j~0 < ~n~0); {1526#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-14 17:34:14,670 INFO L256 TraceCheckUtils]: 15: Hoare triple {1526#(<= main_~n~0 (+ main_~j~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1523#true} is VALID [2018-11-14 17:34:14,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {1523#true} ~cond := #in~cond; {1523#true} is VALID [2018-11-14 17:34:14,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {1523#true} assume !(~cond == 0); {1523#true} is VALID [2018-11-14 17:34:14,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {1523#true} assume true; {1523#true} is VALID [2018-11-14 17:34:14,671 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1523#true} {1526#(<= main_~n~0 (+ main_~j~0 1))} #71#return; {1526#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2018-11-14 17:34:14,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {1526#(<= main_~n~0 (+ main_~j~0 1))} #t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1527#(<= main_~n~0 main_~j~0)} is VALID [2018-11-14 17:34:14,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {1527#(<= main_~n~0 main_~j~0)} assume true; {1527#(<= main_~n~0 main_~j~0)} is VALID [2018-11-14 17:34:14,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {1527#(<= main_~n~0 main_~j~0)} assume !!(~j~0 < ~n~0); {1524#false} is VALID [2018-11-14 17:34:14,678 INFO L256 TraceCheckUtils]: 23: Hoare triple {1524#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1524#false} is VALID [2018-11-14 17:34:14,678 INFO L273 TraceCheckUtils]: 24: Hoare triple {1524#false} ~cond := #in~cond; {1524#false} is VALID [2018-11-14 17:34:14,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {1524#false} assume ~cond == 0; {1524#false} is VALID [2018-11-14 17:34:14,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2018-11-14 17:34:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:14,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:14,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:14,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:34:14,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:14,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:14,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:14,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:14,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:14,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:14,713 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-11-14 17:34:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:14,885 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 17:34:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:14,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:34:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-14 17:34:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-14 17:34:14,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-14 17:34:14,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:14,932 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:34:14,932 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:34:14,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:34:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:34:14,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:14,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:14,934 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:14,934 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:14,935 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:34:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:14,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:14,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:14,935 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:14,935 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:14,936 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:34:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:14,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:14,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:14,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:14,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:34:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:34:14,937 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-14 17:34:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:14,937 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:34:14,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:14,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:14,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:34:15,451 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-11-14 17:34:15,569 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:34:15,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:34:15,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:34:15,570 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:34:15,570 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:34:15,570 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:34:15,570 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~k~0) (<= main_~n~0 (+ main_~j~0 1))) [2018-11-14 17:34:15,571 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-14 17:34:15,571 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2018-11-14 17:34:15,571 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-14 17:34:15,571 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-14 17:34:15,571 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2018-11-14 17:34:15,571 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2018-11-14 17:34:15,571 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2018-11-14 17:34:15,574 INFO L421 ceAbstractionStarter]: At program point L32-3(lines 32 36) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 main_~j~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~n~0 1)) (.cse1 (<= 10000 main_~c3~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= 4000 main_~c1~0))) (or (and (<= main_~n~0 0) (<= main_~i~0 0) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse0) (and .cse4 .cse5 (and .cse1 .cse2 .cse3 (<= 2000 main_~k~0)) (<= main_~n~0 (+ main_~j~0 1))))) [2018-11-14 17:34:15,574 INFO L425 ceAbstractionStarter]: For program point L32-4(lines 32 36) no Hoare annotation was computed. [2018-11-14 17:34:15,574 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-11-14 17:34:15,577 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-11-14 17:34:15,578 INFO L421 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 4000 main_~c1~0))) (or (and (and .cse0 .cse1 .cse2 (<= 1 main_~i~0) (<= 2000 main_~k~0)) (<= main_~n~0 1)) (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0)))) [2018-11-14 17:34:15,578 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-11-14 17:34:15,578 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 30) no Hoare annotation was computed. [2018-11-14 17:34:15,578 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 17:34:15,578 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:34:15,578 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 17:34:15,579 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 17:34:15,579 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 17:34:15,579 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:34:15,581 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:34:15,581 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:34:15,581 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:34:15,581 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:34:15,581 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:34:15,581 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:34:15,582 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 17:34:15,583 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 17:34:15,584 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 17:34:15,585 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:34:15,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:34:15 BoogieIcfgContainer [2018-11-14 17:34:15,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:34:15,600 INFO L168 Benchmark]: Toolchain (without parser) took 9462.35 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 862.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -925.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:34:15,601 INFO L168 Benchmark]: CDTParser took 0.16 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-14 17:34:15,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.40 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-14 17:34:15,603 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 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-14 17:34:15,603 INFO L168 Benchmark]: RCFGBuilder took 711.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:15,604 INFO L168 Benchmark]: TraceAbstraction took 8388.89 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -189.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:34:15,611 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.16 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. * CACSL2BoogieTranslator took 318.40 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 Preprocessor took 38.61 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 711.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -747.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8388.89 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -189.1 MB). 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: 32]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 0) && n <= j) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && n <= 1) && n <= j)) || (((1 <= i && n <= 1) && ((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 2000 <= k) && n <= j + 1) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 2000 <= k) && n <= 1) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 0 <= i) && 0 <= k) && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 8.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 190 SDtfs, 141 SDslu, 430 SDs, 0 SdLazy, 214 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=5, 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.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 19 NumberOfFragments, 125 HoareAnnotationTreeSize, 13 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 10523 SizeOfPredicates, 10 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 21/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...