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-Const.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:30:53,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:30:53,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:30:53,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:30:53,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:30:53,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:30:53,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:30:53,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:30:53,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:30:53,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:30:53,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:30:53,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:30:53,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:30:53,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:30:53,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:30:53,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:30:53,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:30:53,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:30:53,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:30:53,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:30:53,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:30:53,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:30:53,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:30:53,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:30:53,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:30:53,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:30:53,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:30:53,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:30:53,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:30:53,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:30:53,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:30:53,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:30:53,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:30:53,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:30:53,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:30:53,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:30:53,669 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:30:53,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:30:53,691 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:30:53,692 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:30:53,692 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:30:53,692 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:30:53,693 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:30:53,693 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:30:53,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:30:53,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:30:53,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:30:53,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:30:53,694 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:30:53,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:30:53,694 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:30:53,694 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:30:53,695 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:30:53,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:30:53,695 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:30:53,695 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:30:53,695 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:30:53,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:30:53,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:30:53,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:30:53,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:30:53,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:30:53,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:30:53,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:30:53,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:30:53,697 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:30:53,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:30:53,697 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:30:53,698 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:30:53,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:30:53,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:30:53,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:30:53,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:30:53,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:30:53,770 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:30:53,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-14 18:30:53,837 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f84a149/88d313f6cc56405db2a2517b3c36ec69/FLAG592ae48da [2018-11-14 18:30:54,261 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:30:54,261 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-14 18:30:54,267 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f84a149/88d313f6cc56405db2a2517b3c36ec69/FLAG592ae48da [2018-11-14 18:30:54,281 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f84a149/88d313f6cc56405db2a2517b3c36ec69 [2018-11-14 18:30:54,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:30:54,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:30:54,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:30:54,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:30:54,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:30:54,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23362a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54, skipping insertion in model container [2018-11-14 18:30:54,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:30:54,348 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:30:54,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:30:54,635 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:30:54,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:30:54,692 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:30:54,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54 WrapperNode [2018-11-14 18:30:54,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:30:54,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:30:54,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:30:54,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:30:54,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (1/1) ... [2018-11-14 18:30:54,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:30:54,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:30:54,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:30:54,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:30:54,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (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 18:30:54,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:30:54,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:30:54,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:30:54,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:30:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:30:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:30:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:30:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:30:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:30:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:30:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:30:55,602 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:30:55,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:30:55 BoogieIcfgContainer [2018-11-14 18:30:55,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:30:55,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:30:55,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:30:55,607 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:30:55,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:30:54" (1/3) ... [2018-11-14 18:30:55,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c7d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:30:55, skipping insertion in model container [2018-11-14 18:30:55,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:30:54" (2/3) ... [2018-11-14 18:30:55,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c7d206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:30:55, skipping insertion in model container [2018-11-14 18:30:55,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:30:55" (3/3) ... [2018-11-14 18:30:55,611 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-14 18:30:55,620 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:30:55,628 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:30:55,642 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:30:55,676 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:30:55,676 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:30:55,676 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:30:55,677 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:30:55,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:30:55,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:30:55,677 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:30:55,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:30:55,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:30:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-14 18:30:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:30:55,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:55,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:55,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:55,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:55,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1613398923, now seen corresponding path program 1 times [2018-11-14 18:30:55,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:55,716 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 18:30:55,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:55,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:56,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2018-11-14 18:30:56,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 18:30:56,096 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #94#return; {46#true} is VALID [2018-11-14 18:30:56,096 INFO L256 TraceCheckUtils]: 3: Hoare triple {46#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {46#true} is VALID [2018-11-14 18:30:56,096 INFO L273 TraceCheckUtils]: 4: Hoare triple {46#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {46#true} is VALID [2018-11-14 18:30:56,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {46#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {46#true} is VALID [2018-11-14 18:30:56,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {46#true} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {46#true} is VALID [2018-11-14 18:30:56,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 18:30:56,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#true} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {46#true} is VALID [2018-11-14 18:30:56,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#true} assume !true; {47#false} is VALID [2018-11-14 18:30:56,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {47#false} assume ~bvsgt32(~l~0, 1bv32); {47#false} is VALID [2018-11-14 18:30:56,099 INFO L256 TraceCheckUtils]: 11: Hoare triple {47#false} call __VERIFIER_assert((if ~bvsle32(1bv32, ~l~0) then 1bv32 else 0bv32)); {47#false} is VALID [2018-11-14 18:30:56,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2018-11-14 18:30:56,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {47#false} assume ~cond == 0bv32; {47#false} is VALID [2018-11-14 18:30:56,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {47#false} assume !false; {47#false} is VALID [2018-11-14 18:30:56,103 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 18:30:56,104 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:56,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:56,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:30:56,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 18:30:56,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:56,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:30:56,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:56,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:30:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:30:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:30:56,235 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-14 18:30:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:56,526 INFO L93 Difference]: Finished difference Result 79 states and 137 transitions. [2018-11-14 18:30:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:30:56,527 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 18:30:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:30:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-14 18:30:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:30:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 137 transitions. [2018-11-14 18:30:56,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 137 transitions. [2018-11-14 18:30:57,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:57,744 INFO L225 Difference]: With dead ends: 79 [2018-11-14 18:30:57,744 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:30:57,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:30:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:30:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 18:30:57,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:57,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 18:30:57,840 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 18:30:57,840 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 18:30:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:57,853 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2018-11-14 18:30:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2018-11-14 18:30:57,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:57,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:57,856 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 18:30:57,856 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 18:30:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:57,863 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2018-11-14 18:30:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2018-11-14 18:30:57,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:57,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:57,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:57,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:30:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2018-11-14 18:30:57,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 57 transitions. Word has length 15 [2018-11-14 18:30:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:57,874 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 57 transitions. [2018-11-14 18:30:57,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:30:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2018-11-14 18:30:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:30:57,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:57,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:57,876 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:57,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash -151066835, now seen corresponding path program 1 times [2018-11-14 18:30:57,877 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:57,877 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 18:30:57,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:30:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:57,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:58,553 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 18:30:59,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {341#true} is VALID [2018-11-14 18:30:59,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {341#true} assume true; {341#true} is VALID [2018-11-14 18:30:59,047 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {341#true} {341#true} #94#return; {341#true} is VALID [2018-11-14 18:30:59,047 INFO L256 TraceCheckUtils]: 3: Hoare triple {341#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {341#true} is VALID [2018-11-14 18:30:59,048 INFO L273 TraceCheckUtils]: 4: Hoare triple {341#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {341#true} is VALID [2018-11-14 18:30:59,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {341#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {361#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-14 18:30:59,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {361#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {365#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-14 18:30:59,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {365#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} assume true; {365#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-14 18:30:59,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {365#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {372#(and (bvsle main_~r~0 (_ bv1000000 32)) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-14 18:30:59,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {372#(and (bvsle main_~r~0 (_ bv1000000 32)) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))) (bvsle (_ bv1 32) main_~r~0))} assume true; {372#(and (bvsle main_~r~0 (_ bv1000000 32)) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-14 18:30:59,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {372#(and (bvsle main_~r~0 (_ bv1000000 32)) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))) (bvsle (_ bv1 32) main_~r~0))} assume !!~bvsle32(~j~0, ~r~0); {379#(and (bvsle main_~r~0 (_ bv1000000 32)) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))) (bvsle main_~j~0 main_~r~0) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-14 18:30:59,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {379#(and (bvsle main_~r~0 (_ bv1000000 32)) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))) (bvsle main_~j~0 main_~r~0) (bvsle (_ bv1 32) main_~r~0))} assume !~bvslt32(~j~0, ~r~0); {383#(and (exists ((main_~r~0 (_ BitVec 32))) (and (bvsle main_~r~0 (_ bv1000000 32)) (not (bvslt main_~j~0 main_~r~0)) (bvsle main_~j~0 main_~r~0) (bvsle (_ bv1 32) main_~r~0))) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))))} is VALID [2018-11-14 18:30:59,118 INFO L256 TraceCheckUtils]: 12: Hoare triple {383#(and (exists ((main_~r~0 (_ BitVec 32))) (and (bvsle main_~r~0 (_ bv1000000 32)) (not (bvslt main_~j~0 main_~r~0)) (bvsle main_~j~0 main_~r~0) (bvsle (_ bv1 32) main_~r~0))) (exists ((main_~l~0 (_ BitVec 32))) (and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {387#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:59,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {387#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {391#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:30:59,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {342#false} is VALID [2018-11-14 18:30:59,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {342#false} assume !false; {342#false} is VALID [2018-11-14 18:30:59,125 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 18:30:59,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:30:59,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:30:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 18:30:59,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 18:30:59,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:59,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:30:59,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:59,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:30:59,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:30:59,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:30:59,187 INFO L87 Difference]: Start difference. First operand 38 states and 57 transitions. Second operand 9 states. [2018-11-14 18:31:00,241 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 18:31:00,517 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 20 [2018-11-14 18:31:06,979 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-14 18:31:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:22,682 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2018-11-14 18:31:22,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:31:22,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-14 18:31:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:31:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 239 transitions. [2018-11-14 18:31:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:31:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 239 transitions. [2018-11-14 18:31:22,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 239 transitions. [2018-11-14 18:31:23,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:23,832 INFO L225 Difference]: With dead ends: 147 [2018-11-14 18:31:23,832 INFO L226 Difference]: Without dead ends: 145 [2018-11-14 18:31:23,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:31:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-14 18:31:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2018-11-14 18:31:23,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:23,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 100 states. [2018-11-14 18:31:23,987 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 100 states. [2018-11-14 18:31:23,988 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 100 states. [2018-11-14 18:31:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:24,006 INFO L93 Difference]: Finished difference Result 145 states and 237 transitions. [2018-11-14 18:31:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2018-11-14 18:31:24,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:24,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:24,012 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 145 states. [2018-11-14 18:31:24,013 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 145 states. [2018-11-14 18:31:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:24,030 INFO L93 Difference]: Finished difference Result 145 states and 237 transitions. [2018-11-14 18:31:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2018-11-14 18:31:24,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:24,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:24,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:24,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-14 18:31:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 164 transitions. [2018-11-14 18:31:24,044 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 164 transitions. Word has length 16 [2018-11-14 18:31:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:24,044 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 164 transitions. [2018-11-14 18:31:24,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:31:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 164 transitions. [2018-11-14 18:31:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:31:24,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:24,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:24,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:24,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:24,046 INFO L82 PathProgramCache]: Analyzing trace with hash -162387415, now seen corresponding path program 1 times [2018-11-14 18:31:24,047 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:24,047 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:24,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:24,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:29,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {1082#true} call ULTIMATE.init(); {1082#true} is VALID [2018-11-14 18:31:29,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {1082#true} assume true; {1082#true} is VALID [2018-11-14 18:31:29,377 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1082#true} {1082#true} #94#return; {1082#true} is VALID [2018-11-14 18:31:29,377 INFO L256 TraceCheckUtils]: 3: Hoare triple {1082#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1082#true} is VALID [2018-11-14 18:31:29,378 INFO L273 TraceCheckUtils]: 4: Hoare triple {1082#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1082#true} is VALID [2018-11-14 18:31:29,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {1082#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {1102#(exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-14 18:31:29,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {1102#(exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32))))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1106#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-14 18:31:29,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {1106#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)))} assume true; {1106#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-14 18:31:29,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {1106#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-14 18:31:29,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} assume true; {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-14 18:31:29,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} assume !!~bvsle32(~j~0, ~r~0); {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-14 18:31:29,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} assume ~bvslt32(~j~0, ~r~0); {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-14 18:31:29,484 INFO L256 TraceCheckUtils]: 12: Hoare triple {1113#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {1126#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:29,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {1126#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1130#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:29,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {1130#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1083#false} is VALID [2018-11-14 18:31:29,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2018-11-14 18:31:29,489 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 18:31:29,489 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:29,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:29,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:31:29,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-14 18:31:29,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:29,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:31:29,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:29,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:31:29,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:31:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=29, Unknown=2, NotChecked=0, Total=42 [2018-11-14 18:31:29,749 INFO L87 Difference]: Start difference. First operand 100 states and 164 transitions. Second operand 7 states. [2018-11-14 18:31:51,278 WARN L179 SmtUtils]: Spent 8.30 s on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-14 18:32:04,174 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-14 18:32:09,491 WARN L179 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 26 DAG size of output: 24