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/loops/trex01_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:30:56,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:30:56,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:30:56,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:30:56,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:30:56,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:30:56,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:30:56,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:30:56,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:30:56,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:30:56,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:30:56,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:30:56,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:30:56,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:30:56,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:30:56,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:30:56,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:30:56,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:30:56,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:30:56,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:30:56,537 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:30:56,541 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:30:56,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:30:56,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:30:56,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:30:56,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:30:56,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:30:56,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:30:56,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:30:56,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:30:56,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:30:56,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:30:56,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:30:56,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:30:56,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:30:56,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:30:56,563 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:30:56,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:30:56,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:30:56,582 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:30:56,583 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:30:56,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:30:56,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:30:56,584 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:30:56,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:30:56,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:30:56,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:30:56,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:30:56,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:30:56,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:30:56,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:30:56,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:30:56,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:30:56,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:30:56,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:30:56,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:30:56,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:30:56,586 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:30:56,587 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:30:56,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:30:56,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:30:56,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:30:56,587 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:30:56,588 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:30:56,588 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:30:56,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:30:56,588 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:30:56,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:30:56,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:30:56,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:30:56,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:30:56,666 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:30:56,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex01_true-unreach-call_true-termination.i [2018-11-14 17:30:56,729 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09396cd52/e3a82c1b2405488ea56c16dc9d4d18be/FLAG693186f52 [2018-11-14 17:30:57,138 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:30:57,139 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex01_true-unreach-call_true-termination.i [2018-11-14 17:30:57,145 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09396cd52/e3a82c1b2405488ea56c16dc9d4d18be/FLAG693186f52 [2018-11-14 17:30:57,159 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09396cd52/e3a82c1b2405488ea56c16dc9d4d18be [2018-11-14 17:30:57,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:30:57,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:30:57,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:30:57,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:30:57,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:30:57,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ceb4cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57, skipping insertion in model container [2018-11-14 17:30:57,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:30:57,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:30:57,469 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:30:57,474 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:30:57,510 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:30:57,529 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:30:57,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57 WrapperNode [2018-11-14 17:30:57,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:30:57,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:30:57,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:30:57,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:30:57,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (1/1) ... [2018-11-14 17:30:57,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:30:57,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:30:57,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:30:57,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:30:57,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (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:30:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:30:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:30:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:30:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-14 17:30:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:30:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:30:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:30:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:30:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-14 17:30:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:30:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-14 17:30:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:30:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:30:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:30:58,280 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:30:58,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:58 BoogieIcfgContainer [2018-11-14 17:30:58,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:30:58,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:30:58,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:30:58,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:30:58,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:30:57" (1/3) ... [2018-11-14 17:30:58,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1a3b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:58, skipping insertion in model container [2018-11-14 17:30:58,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:57" (2/3) ... [2018-11-14 17:30:58,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1a3b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:58, skipping insertion in model container [2018-11-14 17:30:58,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:58" (3/3) ... [2018-11-14 17:30:58,290 INFO L112 eAbstractionObserver]: Analyzing ICFG trex01_true-unreach-call_true-termination.i [2018-11-14 17:30:58,301 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:30:58,311 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:30:58,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:30:58,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:30:58,366 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:30:58,366 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:30:58,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:30:58,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:30:58,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:30:58,367 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:30:58,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:30:58,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:30:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 17:30:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:30:58,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:58,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:58,397 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:58,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:58,404 INFO L82 PathProgramCache]: Analyzing trace with hash -623240960, now seen corresponding path program 1 times [2018-11-14 17:30:58,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:58,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:58,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:58,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 17:30:58,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 17:30:58,579 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #84#return; {36#true} is VALID [2018-11-14 17:30:58,579 INFO L256 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2018-11-14 17:30:58,580 INFO L273 TraceCheckUtils]: 4: Hoare triple {36#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {36#true} is VALID [2018-11-14 17:30:58,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} assume !(~c~1 % 256 != 0); {36#true} is VALID [2018-11-14 17:30:58,580 INFO L256 TraceCheckUtils]: 6: Hoare triple {36#true} call f(2); {36#true} is VALID [2018-11-14 17:30:58,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#true} ~d := #in~d;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1; {36#true} is VALID [2018-11-14 17:30:58,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} assume !!(~k~0 <= 1073741823); {36#true} is VALID [2018-11-14 17:30:58,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 17:30:58,582 INFO L256 TraceCheckUtils]: 10: Hoare triple {37#false} call __VERIFIER_assert((if ~z~0 >= 1 then 1 else 0)); {37#false} is VALID [2018-11-14 17:30:58,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 17:30:58,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume ~cond == 0; {37#false} is VALID [2018-11-14 17:30:58,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 17:30:58,587 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:30:58,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:30:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:30:58,595 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:30:58,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:58,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:30:58,734 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:30:58,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:30:58,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:30:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:30:58,746 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 17:30:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:59,107 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2018-11-14 17:30:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:30:59,107 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:30:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:30:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 17:30:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:30:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 17:30:59,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 17:30:59,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:59,393 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:30:59,393 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 17:30:59,397 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:30:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 17:30:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 17:30:59,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:59,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 17:30:59,559 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 17:30:59,559 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 17:30:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:59,563 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-14 17:30:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 17:30:59,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:59,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:59,564 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 17:30:59,565 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 17:30:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:59,568 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-14 17:30:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 17:30:59,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:59,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:59,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:59,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:30:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 17:30:59,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-14 17:30:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:59,575 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 17:30:59,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:30:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 17:30:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:30:59,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:59,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:59,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:59,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:59,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1863782436, now seen corresponding path program 1 times [2018-11-14 17:30:59,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:59,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:59,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:59,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:59,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2018-11-14 17:30:59,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2018-11-14 17:30:59,814 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #84#return; {169#true} is VALID [2018-11-14 17:30:59,814 INFO L256 TraceCheckUtils]: 3: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2018-11-14 17:30:59,814 INFO L273 TraceCheckUtils]: 4: Hoare triple {169#true} ~c~1 := #t~nondet5;havoc #t~nondet5; {169#true} is VALID [2018-11-14 17:30:59,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {169#true} assume !(~c~1 % 256 != 0); {169#true} is VALID [2018-11-14 17:30:59,815 INFO L256 TraceCheckUtils]: 6: Hoare triple {169#true} call f(2); {169#true} is VALID [2018-11-14 17:30:59,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {169#true} ~d := #in~d;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;~z~0 := 1; {171#(<= 1 f_~z~0)} is VALID [2018-11-14 17:30:59,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {171#(<= 1 f_~z~0)} assume !!(~k~0 <= 1073741823); {171#(<= 1 f_~z~0)} is VALID [2018-11-14 17:30:59,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {171#(<= 1 f_~z~0)} assume true; {171#(<= 1 f_~z~0)} is VALID [2018-11-14 17:30:59,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {171#(<= 1 f_~z~0)} assume !(~z~0 < ~k~0); {171#(<= 1 f_~z~0)} is VALID [2018-11-14 17:30:59,838 INFO L256 TraceCheckUtils]: 11: Hoare triple {171#(<= 1 f_~z~0)} call __VERIFIER_assert((if ~z~0 >= 1 then 1 else 0)); {172#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:30:59,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {172#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {173#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:30:59,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {173#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {170#false} is VALID [2018-11-14 17:30:59,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {170#false} assume !false; {170#false} is VALID [2018-11-14 17:30:59,860 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:30:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:30:59,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:30:59,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 17:30:59,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:59,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:30:59,936 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:30:59,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:30:59,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:30:59,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:30:59,938 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2018-11-14 17:31:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:00,440 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-14 17:31:00,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:31:00,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 17:31:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:31:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:31:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-14 17:31:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:31:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-14 17:31:00,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2018-11-14 17:31:00,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:31:00,470 INFO L225 Difference]: With dead ends: 17 [2018-11-14 17:31:00,470 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:31:00,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:31:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:31:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:31:00,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:31:00,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:31:00,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:31:00,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:31:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:00,473 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:31:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:31:00,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:00,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:00,474 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:31:00,474 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:31:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:00,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:31:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:31:00,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:00,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:00,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:31:00,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:31:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:31:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:31:00,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-14 17:31:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:31:00,476 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:31:00,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:31:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:31:00,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:00,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:31:00,568 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:31:00,569 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:31:00,569 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-14 17:31:00,569 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-14 17:31:00,569 INFO L425 ceAbstractionStarter]: For program point L17(lines 11 33) no Hoare annotation was computed. [2018-11-14 17:31:00,569 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2018-11-14 17:31:00,569 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 33) no Hoare annotation was computed. [2018-11-14 17:31:00,570 INFO L428 ceAbstractionStarter]: At program point fENTRY(lines 11 33) the Hoare annotation is: true [2018-11-14 17:31:00,570 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 31) no Hoare annotation was computed. [2018-11-14 17:31:00,570 INFO L428 ceAbstractionStarter]: At program point L24-2(lines 22 32) the Hoare annotation is: true [2018-11-14 17:31:00,570 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 32) no Hoare annotation was computed. [2018-11-14 17:31:00,570 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-14 17:31:00,570 INFO L425 ceAbstractionStarter]: For program point L22-3(lines 11 33) no Hoare annotation was computed. [2018-11-14 17:31:00,570 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-14 17:31:00,571 INFO L421 ceAbstractionStarter]: At program point L16-3(line 16) the Hoare annotation is: (<= 1 f_~z~0) [2018-11-14 17:31:00,571 INFO L421 ceAbstractionStarter]: At program point L16-4(line 16) the Hoare annotation is: (<= 1 f_~z~0) [2018-11-14 17:31:00,571 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:31:00,571 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:31:00,571 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:31:00,571 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:31:00,572 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 34 42) the Hoare annotation is: true [2018-11-14 17:31:00,572 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 34 42) no Hoare annotation was computed. [2018-11-14 17:31:00,572 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 34 42) no Hoare annotation was computed. [2018-11-14 17:31:00,572 INFO L428 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: true [2018-11-14 17:31:00,572 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 36 40) no Hoare annotation was computed. [2018-11-14 17:31:00,572 INFO L428 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: true [2018-11-14 17:31:00,572 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-14 17:31:00,573 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 17:31:00,573 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 17:31:00,573 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:31:00,573 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 17:31:00,573 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 17:31:00,573 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:31:00,575 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:31:00,575 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:31:00,575 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-14 17:31:00,576 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:31:00,577 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:31:00,577 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2018-11-14 17:31:00,577 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 17:31:00,577 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:31:00,577 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-14 17:31:00,578 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:31:00,579 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2018-11-14 17:31:00,579 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:31:00,579 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:31:00,579 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:31:00,579 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:31:00,579 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:31:00,580 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-14 17:31:00,581 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 17:31:00,581 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:31:00,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:31:00 BoogieIcfgContainer [2018-11-14 17:31:00,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:31:00,593 INFO L168 Benchmark]: Toolchain (without parser) took 3423.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -699.3 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:00,596 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:31:00,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.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:31:00,597 INFO L168 Benchmark]: Boogie Preprocessor took 34.57 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:31:00,598 INFO L168 Benchmark]: RCFGBuilder took 716.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:00,599 INFO L168 Benchmark]: TraceAbstraction took 2309.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:00,604 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 357.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 34.57 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 716.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2309.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. 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: 16]: Loop Invariant Derived loop invariant: 1 <= z - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 1 SDslu, 35 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 20 NumberOfFragments, 15 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...