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/loop-crafted/simple_vardep_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:22:37,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:22:37,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:22:37,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:22:37,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:22:37,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:22:37,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:22:37,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:22:37,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:22:37,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:22:37,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:22:37,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:22:37,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:22:37,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:22:37,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:22:37,604 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:22:37,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:22:37,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:22:37,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:22:37,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:22:37,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:22:37,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:22:37,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:22:37,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:22:37,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:22:37,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:22:37,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:22:37,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:22:37,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:22:37,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:22:37,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:22:37,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:22:37,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:22:37,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:22:37,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:22:37,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:22:37,635 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-18 22:22:37,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:22:37,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:22:37,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:22:37,660 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:22:37,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:22:37,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:22:37,661 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:22:37,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:22:37,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:22:37,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:22:37,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:22:37,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:22:37,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:22:37,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:22:37,663 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:22:37,663 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:22:37,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:22:37,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:22:37,663 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:22:37,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:22:37,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:22:37,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:22:37,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:22:37,664 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:22:37,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:22:37,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:22:37,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:22:37,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:22:37,665 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:22:37,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:22:37,666 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:22:37,666 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:22:37,666 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:22:37,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:22:37,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:22:37,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:22:37,739 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:22:37,739 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:22:37,740 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_vardep_true-unreach-call1_true-termination.i [2018-11-18 22:22:37,810 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d8283cc9/6ceeaa01a4a94d7791eb354fd177dd6d/FLAG048acb174 [2018-11-18 22:22:38,239 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:22:38,240 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_vardep_true-unreach-call1_true-termination.i [2018-11-18 22:22:38,245 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d8283cc9/6ceeaa01a4a94d7791eb354fd177dd6d/FLAG048acb174 [2018-11-18 22:22:38,588 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d8283cc9/6ceeaa01a4a94d7791eb354fd177dd6d [2018-11-18 22:22:38,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:22:38,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:22:38,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:22:38,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:22:38,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:22:38,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d17c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38, skipping insertion in model container [2018-11-18 22:22:38,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:22:38,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:22:38,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:22:38,829 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:22:38,847 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:22:38,863 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:22:38,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38 WrapperNode [2018-11-18 22:22:38,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:22:38,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:22:38,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:22:38,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:22:38,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (1/1) ... [2018-11-18 22:22:38,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:22:38,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:22:38,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:22:38,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:22:38,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (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-18 22:22:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:22:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:22:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:22:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:22:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:22:39,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:22:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:22:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:22:39,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:22:39,493 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:22:39,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:39 BoogieIcfgContainer [2018-11-18 22:22:39,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:22:39,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:22:39,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:22:39,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:22:39,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:22:38" (1/3) ... [2018-11-18 22:22:39,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8720ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:39, skipping insertion in model container [2018-11-18 22:22:39,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:38" (2/3) ... [2018-11-18 22:22:39,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8720ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:39, skipping insertion in model container [2018-11-18 22:22:39,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:39" (3/3) ... [2018-11-18 22:22:39,503 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_vardep_true-unreach-call1_true-termination.i [2018-11-18 22:22:39,513 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:22:39,522 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:22:39,540 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:22:39,571 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:22:39,572 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:22:39,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:22:39,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:22:39,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:22:39,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:22:39,573 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:22:39,573 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:22:39,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:22:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-18 22:22:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:22:39,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:39,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:22:39,601 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:39,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash -569563750, now seen corresponding path program 1 times [2018-11-18 22:22:39,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:39,612 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-18 22:22:39,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:39,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:22:40,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-18 22:22:40,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-18 22:22:40,349 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-18 22:22:40,349 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret0 := main(); {21#true} is VALID [2018-11-18 22:22:40,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {38#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-18 22:22:40,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume true; {38#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-18 22:22:40,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {45#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:22:40,405 INFO L256 TraceCheckUtils]: 7: Hoare triple {45#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~k~0 == ~bvadd32(~i~0, ~j~0) then 1bv32 else 0bv32)); {49#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:22:40,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {53#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:22:40,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-18 22:22:40,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-18 22:22:40,433 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-18 22:22:40,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:22:40,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:22:40,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:22:40,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-18 22:22:40,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:22:40,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:22:40,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:22:40,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:22:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:22:40,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:22:40,565 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 6 states. [2018-11-18 22:22:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:41,276 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-18 22:22:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:22:41,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-18 22:22:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:22:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:22:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-18 22:22:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:22:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-18 22:22:41,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-18 22:22:41,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:22:41,603 INFO L225 Difference]: With dead ends: 40 [2018-11-18 22:22:41,604 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 22:22:41,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:22:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 22:22:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-18 22:22:41,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:22:41,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-18 22:22:41,792 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-18 22:22:41,793 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-18 22:22:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:41,798 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-18 22:22:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-18 22:22:41,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:41,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:41,799 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-18 22:22:41,800 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-18 22:22:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:41,803 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-18 22:22:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-18 22:22:41,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:41,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:41,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:22:41,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:22:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:22:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 22:22:41,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2018-11-18 22:22:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:22:41,809 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-18 22:22:41,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:22:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 22:22:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:22:41,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:41,811 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:22:41,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:41,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:41,812 INFO L82 PathProgramCache]: Analyzing trace with hash 501014179, now seen corresponding path program 1 times [2018-11-18 22:22:41,813 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:41,813 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-18 22:22:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:41,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:22:42,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2018-11-18 22:22:42,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-18 22:22:42,264 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #32#return; {192#true} is VALID [2018-11-18 22:22:42,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {192#true} call #t~ret0 := main(); {192#true} is VALID [2018-11-18 22:22:42,266 INFO L273 TraceCheckUtils]: 4: Hoare triple {192#true} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {209#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-18 22:22:42,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume true; {209#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-18 22:22:42,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:22:42,268 INFO L256 TraceCheckUtils]: 7: Hoare triple {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~k~0 == ~bvadd32(~i~0, ~j~0) then 1bv32 else 0bv32)); {192#true} is VALID [2018-11-18 22:22:42,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {192#true} ~cond := #in~cond; {192#true} is VALID [2018-11-18 22:22:42,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {192#true} assume !(0bv32 == ~cond); {192#true} is VALID [2018-11-18 22:22:42,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-18 22:22:42,272 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {192#true} {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #36#return; {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:22:42,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:22:42,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {216#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {238#(and (= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-18 22:22:42,280 INFO L256 TraceCheckUtils]: 14: Hoare triple {238#(and (= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~k~0 == ~bvadd32(~i~0, ~j~0) then 1bv32 else 0bv32)); {242#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:22:42,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {242#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {246#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:22:42,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {246#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {193#false} is VALID [2018-11-18 22:22:42,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {193#false} assume !false; {193#false} is VALID [2018-11-18 22:22:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:22:42,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:22:45,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {193#false} assume !false; {193#false} is VALID [2018-11-18 22:22:45,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {256#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {193#false} is VALID [2018-11-18 22:22:45,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {260#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {256#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:22:45,354 INFO L256 TraceCheckUtils]: 14: Hoare triple {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 == ~bvadd32(~i~0, ~j~0) then 1bv32 else 0bv32)); {260#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:22:45,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} is VALID [2018-11-18 22:22:45,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} assume true; {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} is VALID [2018-11-18 22:22:45,716 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {192#true} {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} #36#return; {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} is VALID [2018-11-18 22:22:45,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-18 22:22:45,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {192#true} assume !(0bv32 == ~cond); {192#true} is VALID [2018-11-18 22:22:45,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {192#true} ~cond := #in~cond; {192#true} is VALID [2018-11-18 22:22:45,717 INFO L256 TraceCheckUtils]: 7: Hoare triple {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} call __VERIFIER_assert((if ~k~0 == ~bvadd32(~i~0, ~j~0) then 1bv32 else 0bv32)); {192#true} is VALID [2018-11-18 22:22:46,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} assume !!~bvult32(~k~0, 268435455bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(2bv32, ~j~0);~k~0 := ~bvadd32(3bv32, ~k~0); {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} is VALID [2018-11-18 22:22:46,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} assume true; {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} is VALID [2018-11-18 22:22:46,047 INFO L273 TraceCheckUtils]: 4: Hoare triple {192#true} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {264#(= (bvadd main_~i~0 main_~j~0) main_~k~0)} is VALID [2018-11-18 22:22:46,048 INFO L256 TraceCheckUtils]: 3: Hoare triple {192#true} call #t~ret0 := main(); {192#true} is VALID [2018-11-18 22:22:46,048 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #32#return; {192#true} is VALID [2018-11-18 22:22:46,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-18 22:22:46,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2018-11-18 22:22:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:22:46,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:22:46,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-18 22:22:46,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-18 22:22:46,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:22:46,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:22:46,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:22:46,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:22:46,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:22:46,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:22:46,450 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 10 states. [2018-11-18 22:22:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:46,953 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-18 22:22:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:22:46,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-18 22:22:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:22:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:22:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-18 22:22:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:22:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-18 22:22:46,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2018-11-18 22:22:47,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:22:47,350 INFO L225 Difference]: With dead ends: 26 [2018-11-18 22:22:47,350 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 22:22:47,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:22:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 22:22:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 22:22:47,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:22:47,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 22:22:47,353 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:22:47,353 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:22:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:47,353 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:22:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:22:47,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:47,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:47,354 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:22:47,354 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:22:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:47,355 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:22:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:22:47,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:47,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:47,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:22:47,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:22:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 22:22:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 22:22:47,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-18 22:22:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:22:47,357 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 22:22:47,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:22:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:22:47,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:47,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 22:22:47,599 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 22:22:47,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:22:47,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:22:47,600 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 22:22:47,600 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 22:22:47,600 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 22:22:47,600 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2018-11-18 22:22:47,600 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (= (bvadd main_~i~0 main_~j~0) main_~k~0) [2018-11-18 22:22:47,600 INFO L421 ceAbstractionStarter]: At program point L26-1(lines 21 27) the Hoare annotation is: (= (bvadd main_~i~0 main_~j~0) main_~k~0) [2018-11-18 22:22:47,601 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 15 29) no Hoare annotation was computed. [2018-11-18 22:22:47,601 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 27) no Hoare annotation was computed. [2018-11-18 22:22:47,601 INFO L425 ceAbstractionStarter]: For program point L21-3(lines 15 29) no Hoare annotation was computed. [2018-11-18 22:22:47,601 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 7 13) the Hoare annotation is: true [2018-11-18 22:22:47,601 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-18 22:22:47,601 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 7 13) no Hoare annotation was computed. [2018-11-18 22:22:47,601 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-11-18 22:22:47,602 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 22:22:47,602 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 7 13) no Hoare annotation was computed. [2018-11-18 22:22:47,603 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:22:47,604 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 22:22:47,604 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-18 22:22:47,605 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-18 22:22:47,606 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-18 22:22:47,606 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2018-11-18 22:22:47,606 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2018-11-18 22:22:47,606 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:22:47,606 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:22:47,606 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:22:47,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:22:47 BoogieIcfgContainer [2018-11-18 22:22:47,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:22:47,615 INFO L168 Benchmark]: Toolchain (without parser) took 9016.44 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -561.4 MB). Peak memory consumption was 161.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:22:47,617 INFO L168 Benchmark]: CDTParser took 0.21 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-18 22:22:47,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.23 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-18 22:22:47,619 INFO L168 Benchmark]: Boogie Preprocessor took 46.30 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-18 22:22:47,619 INFO L168 Benchmark]: RCFGBuilder took 583.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:22:47,620 INFO L168 Benchmark]: TraceAbstraction took 8118.57 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 198.4 MB). Peak memory consumption was 198.4 MB. Max. memory is 7.1 GB. [2018-11-18 22:22:47,625 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.21 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 263.23 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 46.30 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 583.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8118.57 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 198.4 MB). Peak memory consumption was 198.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 21]: Loop Invariant Derived loop invariant: ~bvadd64(i, j) == k - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 14 SDslu, 103 SDs, 0 SdLazy, 73 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=1, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 15 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060 SizeOfPredicates, 4 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 7/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...