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_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test29_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:24:56,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:24:56,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:24:56,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:24:56,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:24:56,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:24:56,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:24:56,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:24:56,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:24:56,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:24:56,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:24:56,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:24:56,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:24:56,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:24:56,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:24:56,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:24:56,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:24:56,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:24:56,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:24:56,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:24:56,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:24:56,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:24:56,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:24:56,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:24:56,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:24:56,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:24:56,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:24:56,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:24:56,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:24:56,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:24:56,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:24:56,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:24:56,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:24:56,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:24:56,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:24:56,585 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:24:56,586 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:24:56,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:24:56,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:24:56,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:24:56,615 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:24:56,615 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:24:56,616 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:24:56,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:24:56,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:24:56,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:24:56,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:24:56,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:24:56,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:24:56,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:24:56,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:24:56,618 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:24:56,619 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:24:56,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:24:56,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:24:56,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:24:56,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:24:56,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:24:56,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:24:56,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:24:56,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:24:56,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:24:56,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:24:56,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:24:56,622 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:24:56,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:24:56,622 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:24:56,623 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:24:56,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:24:56,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:24:56,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:24:56,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:24:56,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:24:56,710 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:24:56,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29_true-unreach-call_true-termination.c [2018-11-14 16:24:56,782 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d692d952d/3d6b72928b6e4b3ca0b0b79867c0c5d5/FLAG3dc37ab2d [2018-11-14 16:24:57,283 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:24:57,284 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29_true-unreach-call_true-termination.c [2018-11-14 16:24:57,291 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d692d952d/3d6b72928b6e4b3ca0b0b79867c0c5d5/FLAG3dc37ab2d [2018-11-14 16:24:57,307 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d692d952d/3d6b72928b6e4b3ca0b0b79867c0c5d5 [2018-11-14 16:24:57,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:24:57,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:24:57,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:24:57,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:24:57,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:24:57,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d81e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57, skipping insertion in model container [2018-11-14 16:24:57,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:24:57,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:24:57,592 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:24:57,619 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:24:57,642 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:24:57,666 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:24:57,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57 WrapperNode [2018-11-14 16:24:57,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:24:57,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:24:57,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:24:57,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:24:57,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (1/1) ... [2018-11-14 16:24:57,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:24:57,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:24:57,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:24:57,712 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:24:57,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24: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 16:24:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:24:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:24:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:24:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:24:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:24:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:24:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:24:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:24:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-14 16:24:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-14 16:24:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:24:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:24:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:24:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-14 16:24:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:24:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:24:58,359 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:24:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:24:58 BoogieIcfgContainer [2018-11-14 16:24:58,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:24:58,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:24:58,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:24:58,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:24:58,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:24:57" (1/3) ... [2018-11-14 16:24:58,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2751c7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:24:58, skipping insertion in model container [2018-11-14 16:24:58,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:24:57" (2/3) ... [2018-11-14 16:24:58,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2751c7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:24:58, skipping insertion in model container [2018-11-14 16:24:58,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:24:58" (3/3) ... [2018-11-14 16:24:58,368 INFO L112 eAbstractionObserver]: Analyzing ICFG test29_true-unreach-call_true-termination.c [2018-11-14 16:24:58,378 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:24:58,387 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:24:58,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:24:58,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:24:58,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:24:58,438 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:24:58,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:24:58,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:24:58,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:24:58,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:24:58,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:24:58,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:24:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 16:24:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:24:58,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:24:58,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:24:58,467 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:24:58,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:24:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash -871132785, now seen corresponding path program 1 times [2018-11-14 16:24:58,479 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:24:58,480 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:24:58,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:24:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:24:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:24:58,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:24:58,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 16:24:58,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:24:58,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:24:58,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-14 16:24:59,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 16:24:59,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {21#true} is VALID [2018-11-14 16:24:59,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 16:24:59,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2018-11-14 16:24:59,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2018-11-14 16:24:59,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4bv32);~n~0 := #t~nondet0;havoc #t~nondet0; {41#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2018-11-14 16:24:59,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume ~n~0 != 0bv32;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {45#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2018-11-14 16:24:59,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {49#(not (= |main_~#d2~0.base| main_~pd~0.base))} is VALID [2018-11-14 16:24:59,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(not (= |main_~#d2~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32); {49#(not (= |main_~#d2~0.base| main_~pd~0.base))} is VALID [2018-11-14 16:24:59,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#(not (= |main_~#d2~0.base| main_~pd~0.base))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {56#(not |main_#t~short3|)} is VALID [2018-11-14 16:24:59,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {56#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~intINTTYPE1(~#d2~0.base, ~#d2~0.offset, 1bv32);#t~short3 := ~sign_extendFrom8To32(#t~mem2) != 0bv32; {22#false} is VALID [2018-11-14 16:24:59,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~short3;havoc #t~mem2; {22#false} is VALID [2018-11-14 16:24:59,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 16:24:59,203 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 16:24:59,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:24:59,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:24:59,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:24:59,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 16:24:59,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:24:59,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:24:59,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:24:59,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:24:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:24:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:24:59,287 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 6 states. [2018-11-14 16:25:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:00,252 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-14 16:25:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:25:00,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 16:25:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:25:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-14 16:25:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:25:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-14 16:25:00,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2018-11-14 16:25:00,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:00,464 INFO L225 Difference]: With dead ends: 31 [2018-11-14 16:25:00,465 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 16:25:00,468 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:25:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 16:25:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 16:25:00,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:00,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 16:25:00,512 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:25:00,513 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:25:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:00,516 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-14 16:25:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-14 16:25:00,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:00,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:00,517 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:25:00,517 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:25:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:00,520 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-14 16:25:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-14 16:25:00,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:00,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:00,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:00,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:25:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-11-14 16:25:00,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2018-11-14 16:25:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:00,526 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-11-14 16:25:00,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:25:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-14 16:25:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:25:00,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:00,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:00,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:00,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash 905721619, now seen corresponding path program 1 times [2018-11-14 16:25:00,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:00,529 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:00,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:00,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:00,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-11-14 16:25:00,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 16:25:00,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:00,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:00,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:00,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-14 16:25:00,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {157#true} call ULTIMATE.init(); {157#true} is VALID [2018-11-14 16:25:00,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {157#true} is VALID [2018-11-14 16:25:00,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {157#true} assume true; {157#true} is VALID [2018-11-14 16:25:00,949 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} #35#return; {157#true} is VALID [2018-11-14 16:25:00,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {157#true} call #t~ret4 := main(); {157#true} is VALID [2018-11-14 16:25:00,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {157#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4bv32);~n~0 := #t~nondet0;havoc #t~nondet0; {177#(= (_ bv0 32) |main_~#d2~0.offset|)} is VALID [2018-11-14 16:25:00,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {177#(= (_ bv0 32) |main_~#d2~0.offset|)} assume !(~n~0 != 0bv32);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {181#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= (_ bv0 32) |main_~#d2~0.offset|))} is VALID [2018-11-14 16:25:00,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= |main_#t~ite1.offset| |main_~#d2~0.offset|) (= (_ bv0 32) |main_~#d2~0.offset|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {185#(and (= |main_~#d2~0.base| main_~pd~0.base) (= |main_~#d2~0.offset| main_~pd~0.offset) (= (_ bv0 32) |main_~#d2~0.offset|))} is VALID [2018-11-14 16:25:00,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#(and (= |main_~#d2~0.base| main_~pd~0.base) (= |main_~#d2~0.offset| main_~pd~0.offset) (= (_ bv0 32) |main_~#d2~0.offset|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~intINTTYPE1(0bv8, ~pd~0.base, ~pd~0.offset, 1bv32); {189#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= (_ bv0 32) |main_~#d2~0.offset|))} is VALID [2018-11-14 16:25:00,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {189#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= (_ bv0 32) |main_~#d2~0.offset|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {189#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= (_ bv0 32) |main_~#d2~0.offset|))} is VALID [2018-11-14 16:25:00,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#(and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |#memory_int| |main_~#d2~0.base|) |main_~#d2~0.offset|)) (= (_ bv0 32) |main_~#d2~0.offset|))} assume #t~short3;call #t~mem2 := read~intINTTYPE1(~#d2~0.base, ~#d2~0.offset, 1bv32);#t~short3 := ~sign_extendFrom8To32(#t~mem2) != 0bv32; {196#(not |main_#t~short3|)} is VALID [2018-11-14 16:25:00,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {196#(not |main_#t~short3|)} assume #t~short3;havoc #t~short3;havoc #t~mem2; {158#false} is VALID [2018-11-14 16:25:00,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {158#false} assume !false; {158#false} is VALID [2018-11-14 16:25:00,962 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 16:25:00,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:25:00,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-14 16:25:00,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:00,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:25:00,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:00,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:25:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:25:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:25:00,990 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 7 states. [2018-11-14 16:25:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:01,240 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-14 16:25:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:25:01,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-14 16:25:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:25:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-11-14 16:25:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:25:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-11-14 16:25:01,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2018-11-14 16:25:01,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:01,276 INFO L225 Difference]: With dead ends: 14 [2018-11-14 16:25:01,276 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:25:01,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:25:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:25:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:25:01,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:01,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:25:01,279 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:25:01,279 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:25:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:01,279 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:25:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:25:01,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:01,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:01,280 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:25:01,280 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:25:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:01,281 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:25:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:25:01,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:01,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:01,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:01,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:25:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:25:01,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-14 16:25:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:01,282 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:25:01,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:25:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:25:01,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:01,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:25:01,585 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:25:01,586 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:25:01,586 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:25:01,586 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:25:01,586 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:25:01,586 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:25:01,586 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:25:01,586 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2018-11-14 16:25:01,587 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-14 16:25:01,587 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2018-11-14 16:25:01,587 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-14 16:25:01,587 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2018-11-14 16:25:01,587 INFO L425 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2018-11-14 16:25:01,587 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2018-11-14 16:25:01,588 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: true [2018-11-14 16:25:01,588 INFO L421 ceAbstractionStarter]: At program point L22(lines 12 29) the Hoare annotation is: false [2018-11-14 16:25:01,588 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-14 16:25:01,588 INFO L425 ceAbstractionStarter]: For program point L16-2(lines 16 20) no Hoare annotation was computed. [2018-11-14 16:25:01,590 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:25:01,590 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 16:25:01,591 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:25:01,591 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:25:01,591 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 16:25:01,591 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 16:25:01,591 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:25:01,592 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:25:01,592 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-14 16:25:01,592 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 16:25:01,592 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 16:25:01,592 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-14 16:25:01,592 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:25:01,593 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:25:01,593 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-14 16:25:01,593 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-14 16:25:01,593 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 16:25:01,593 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:25:01,593 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:25:01,594 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:25:01,594 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:25:01,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:25:01 BoogieIcfgContainer [2018-11-14 16:25:01,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:25:01,602 INFO L168 Benchmark]: Toolchain (without parser) took 4282.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -598.7 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:25:01,604 INFO L168 Benchmark]: CDTParser took 0.23 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 16:25:01,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.19 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 16:25:01,606 INFO L168 Benchmark]: Boogie Preprocessor took 44.23 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 16:25:01,606 INFO L168 Benchmark]: RCFGBuilder took 647.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -750.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:25:01,607 INFO L168 Benchmark]: TraceAbstraction took 3239.73 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 140.7 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:25:01,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.23 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 345.19 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 44.23 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 647.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -750.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3239.73 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 140.7 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 12]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. SAFE Result, 3.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 26 SDslu, 50 SDs, 0 SdLazy, 55 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 5 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 960 SizeOfPredicates, 11 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 14 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...