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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:33:25,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:33:25,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:33:25,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:33:25,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:33:25,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:33:25,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:33:25,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:33:25,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:33:25,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:33:25,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:33:25,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:33:25,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:33:25,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:33:25,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:33:25,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:33:25,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:33:25,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:33:25,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:33:25,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:33:25,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:33:25,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:33:25,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:33:25,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:33:25,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:33:25,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:33:25,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:33:25,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:33:25,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:33:25,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:33:25,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:33:25,950 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:33:25,950 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:33:25,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:33:25,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:33:25,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:33:25,953 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-23 11:33:25,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:33:25,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:33:25,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:33:25,983 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:33:25,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:33:25,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:33:25,985 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:33:25,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:33:25,985 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:33:25,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:33:25,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:33:25,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:33:25,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:33:25,986 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:33:25,986 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:33:25,987 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:33:25,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:33:25,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:33:25,988 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:33:25,988 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:33:25,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:33:25,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:33:25,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:33:25,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:33:25,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:33:25,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:33:25,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:33:25,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:33:25,991 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:33:25,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:33:25,991 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:33:25,991 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:33:25,991 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:33:26,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:33:26,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:33:26,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:33:26,071 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:33:26,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:33:26,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-23 11:33:26,147 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c8a7034/7db71417f7614e3ca585fc92187dfb4a/FLAG111f300ca [2018-11-23 11:33:26,632 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:33:26,633 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-11-23 11:33:26,640 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c8a7034/7db71417f7614e3ca585fc92187dfb4a/FLAG111f300ca [2018-11-23 11:33:26,978 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c8a7034/7db71417f7614e3ca585fc92187dfb4a [2018-11-23 11:33:26,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:33:26,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:33:26,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:33:26,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:33:26,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:33:26,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:26" (1/1) ... [2018-11-23 11:33:27,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539c7c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:26, skipping insertion in model container [2018-11-23 11:33:27,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:26" (1/1) ... [2018-11-23 11:33:27,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:33:27,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:33:27,286 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:33:27,292 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:33:27,318 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:33:27,341 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:33:27,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27 WrapperNode [2018-11-23 11:33:27,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:33:27,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:33:27,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:33:27,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:33:27,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:33:27,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:33:27,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:33:27,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:33:27,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (1/1) ... [2018-11-23 11:33:27,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:33:27,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:33:27,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:33:27,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:33:27,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (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-23 11:33:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:33:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:33:27,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:33:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:33:27,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:33:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:33:27,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:33:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:33:28,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:33:28,077 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:33:28,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:28 BoogieIcfgContainer [2018-11-23 11:33:28,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:33:28,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:33:28,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:33:28,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:33:28,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:26" (1/3) ... [2018-11-23 11:33:28,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21efd0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:28, skipping insertion in model container [2018-11-23 11:33:28,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:27" (2/3) ... [2018-11-23 11:33:28,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21efd0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:28, skipping insertion in model container [2018-11-23 11:33:28,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:28" (3/3) ... [2018-11-23 11:33:28,087 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const_true-unreach-call_true-termination.i [2018-11-23 11:33:28,098 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:33:28,107 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:33:28,126 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:33:28,157 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:33:28,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:33:28,158 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:33:28,158 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:33:28,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:33:28,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:33:28,159 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:33:28,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:33:28,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:33:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:33:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:33:28,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:28,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:28,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:28,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 576145336, now seen corresponding path program 1 times [2018-11-23 11:33:28,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:28,203 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-23 11:33:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:28,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:28,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:33:28,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:33:28,365 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2018-11-23 11:33:28,365 INFO L256 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {28#true} is VALID [2018-11-23 11:33:28,366 INFO L273 TraceCheckUtils]: 4: Hoare triple {28#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2018-11-23 11:33:28,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {28#true} is VALID [2018-11-23 11:33:28,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:33:28,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~j~0 := 0bv32; {29#false} is VALID [2018-11-23 11:33:28,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!~bvslt32(~j~0, ~n~0); {29#false} is VALID [2018-11-23 11:33:28,368 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 11:33:28,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:33:28,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 11:33:28,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:33:28,374 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-23 11:33:28,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:28,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:28,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:33:28,386 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:33:28,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:28,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:33:28,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:28,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:33:28,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:33:28,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:33:28,543 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:33:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:28,880 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 11:33:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:33:28,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:33:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:33:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 11:33:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:33:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 11:33:28,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 11:33:29,103 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-23 11:33:29,113 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:33:29,114 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:33:29,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-23 11:33:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:33:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:33:29,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:29,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:33:29,156 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:33:29,157 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:33:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:29,161 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 11:33:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:33:29,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:29,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:29,162 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:33:29,162 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:33:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:29,166 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 11:33:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:33:29,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:29,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:29,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:29,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:33:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 11:33:29,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2018-11-23 11:33:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:29,173 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 11:33:29,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:33:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:33:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:33:29,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:29,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:29,174 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:29,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 893444581, now seen corresponding path program 1 times [2018-11-23 11:33:29,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:29,175 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-23 11:33:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:29,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:29,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {187#true} is VALID [2018-11-23 11:33:29,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {187#true} assume true; {187#true} is VALID [2018-11-23 11:33:29,470 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {187#true} {187#true} #65#return; {187#true} is VALID [2018-11-23 11:33:29,471 INFO L256 TraceCheckUtils]: 3: Hoare triple {187#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {187#true} is VALID [2018-11-23 11:33:29,471 INFO L273 TraceCheckUtils]: 4: Hoare triple {187#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {187#true} is VALID [2018-11-23 11:33:29,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {187#true} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {207#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:29,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {207#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {211#(and (not (bvslt (_ bv0 32) main_~n~0)) (bvsle (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:29,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {211#(and (not (bvslt (_ bv0 32) main_~n~0)) (bvsle (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {215#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:29,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {188#false} is VALID [2018-11-23 11:33:29,482 INFO L256 TraceCheckUtils]: 9: Hoare triple {188#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {188#false} is VALID [2018-11-23 11:33:29,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {188#false} ~cond := #in~cond; {188#false} is VALID [2018-11-23 11:33:29,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {188#false} assume 0bv32 == ~cond; {188#false} is VALID [2018-11-23 11:33:29,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {188#false} assume !false; {188#false} is VALID [2018-11-23 11:33:29,485 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-23 11:33:29,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:29,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:29,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:33:29,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:33:29,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:29,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:33:29,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:29,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:33:29,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:33:29,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:29,528 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-23 11:33:29,940 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-23 11:33:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:30,349 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 11:33:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:30,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:33:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 11:33:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 11:33:30,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-23 11:33:30,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:30,444 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:33:30,444 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:33:30,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:33:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:33:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:33:30,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:30,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:33:30,480 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:33:30,480 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:33:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:30,483 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 11:33:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:33:30,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:30,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:30,484 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:33:30,484 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:33:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:30,486 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 11:33:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:33:30,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:30,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:30,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:30,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:33:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 11:33:30,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2018-11-23 11:33:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:30,490 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 11:33:30,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:33:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:33:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:33:30,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:30,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:30,492 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:30,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash -884671747, now seen corresponding path program 1 times [2018-11-23 11:33:30,493 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:30,493 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-23 11:33:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:30,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:30,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 11:33:30,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 11:33:30,675 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #65#return; {351#true} is VALID [2018-11-23 11:33:30,675 INFO L256 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {351#true} is VALID [2018-11-23 11:33:30,676 INFO L273 TraceCheckUtils]: 4: Hoare triple {351#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {368#(= (_ bv4000 32) main_~c1~0)} is VALID [2018-11-23 11:33:30,681 INFO L273 TraceCheckUtils]: 5: Hoare triple {368#(= (_ bv4000 32) main_~c1~0)} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {372#(and (= (_ bv4000 32) main_~c1~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:30,682 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#(and (= (_ bv4000 32) main_~c1~0) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {372#(and (= (_ bv4000 32) main_~c1~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:30,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {372#(and (= (_ bv4000 32) main_~c1~0) (= main_~k~0 (_ bv0 32)))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {372#(and (= (_ bv4000 32) main_~c1~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:30,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {372#(and (= (_ bv4000 32) main_~c1~0) (= main_~k~0 (_ bv0 32)))} assume 0bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c1~0); {382#(= (_ bv4000 32) main_~k~0)} is VALID [2018-11-23 11:33:30,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(= (_ bv4000 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {382#(= (_ bv4000 32) main_~k~0)} is VALID [2018-11-23 11:33:30,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(= (_ bv4000 32) main_~k~0)} ~j~0 := 0bv32; {382#(= (_ bv4000 32) main_~k~0)} is VALID [2018-11-23 11:33:30,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#(= (_ bv4000 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {382#(= (_ bv4000 32) main_~k~0)} is VALID [2018-11-23 11:33:30,686 INFO L256 TraceCheckUtils]: 12: Hoare triple {382#(= (_ bv4000 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {395#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:30,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {395#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {399#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:30,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 11:33:30,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 11:33:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:30,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:30,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 11:33:30,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {409#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 11:33:30,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {413#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {409#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:30,958 INFO L256 TraceCheckUtils]: 12: Hoare triple {417#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {413#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:30,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {417#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {417#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:30,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {417#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {417#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:30,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {417#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {417#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:30,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {430#(bvsgt (bvadd main_~c1~0 main_~k~0) (_ bv0 32))} assume 0bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c1~0); {417#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:30,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {430#(bvsgt (bvadd main_~c1~0 main_~k~0) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {430#(bvsgt (bvadd main_~c1~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:30,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {430#(bvsgt (bvadd main_~c1~0 main_~k~0) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {430#(bvsgt (bvadd main_~c1~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:30,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {440#(bvsgt main_~c1~0 (_ bv0 32))} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {430#(bvsgt (bvadd main_~c1~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:30,977 INFO L273 TraceCheckUtils]: 4: Hoare triple {351#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {440#(bvsgt main_~c1~0 (_ bv0 32))} is VALID [2018-11-23 11:33:30,977 INFO L256 TraceCheckUtils]: 3: Hoare triple {351#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {351#true} is VALID [2018-11-23 11:33:30,978 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {351#true} {351#true} #65#return; {351#true} is VALID [2018-11-23 11:33:30,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 11:33:30,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 11:33:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:30,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:30,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:33:30,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 11:33:30,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:30,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:33:31,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:31,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:33:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:33:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:33:31,034 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 12 states. [2018-11-23 11:33:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:32,318 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2018-11-23 11:33:32,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:33:32,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 11:33:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:33:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:33:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:33:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:33:32,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 11:33:32,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:32,485 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:33:32,485 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:33:32,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:33:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:33:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-23 11:33:32,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:32,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 41 states. [2018-11-23 11:33:32,558 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 41 states. [2018-11-23 11:33:32,558 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 41 states. [2018-11-23 11:33:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:32,565 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:33:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 11:33:32,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:32,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:32,567 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 55 states. [2018-11-23 11:33:32,567 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 55 states. [2018-11-23 11:33:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:32,572 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:33:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 11:33:32,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:32,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:32,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:32,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:33:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2018-11-23 11:33:32,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 16 [2018-11-23 11:33:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:32,578 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-23 11:33:32,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:33:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 11:33:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:33:32,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:32,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:32,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:32,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash 213378718, now seen corresponding path program 1 times [2018-11-23 11:33:32,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:32,581 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:32,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:32,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:32,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {714#true} call ULTIMATE.init(); {714#true} is VALID [2018-11-23 11:33:32,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {714#true} assume true; {714#true} is VALID [2018-11-23 11:33:32,816 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {714#true} {714#true} #65#return; {714#true} is VALID [2018-11-23 11:33:32,816 INFO L256 TraceCheckUtils]: 3: Hoare triple {714#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {714#true} is VALID [2018-11-23 11:33:32,818 INFO L273 TraceCheckUtils]: 4: Hoare triple {714#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {731#(= (_ bv2000 32) main_~c2~0)} is VALID [2018-11-23 11:33:32,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {731#(= (_ bv2000 32) main_~c2~0)} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {735#(and (= (_ bv2000 32) main_~c2~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:32,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {735#(and (= (_ bv2000 32) main_~c2~0) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {735#(and (= (_ bv2000 32) main_~c2~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:32,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {735#(and (= (_ bv2000 32) main_~c2~0) (= main_~k~0 (_ bv0 32)))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {735#(and (= (_ bv2000 32) main_~c2~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:32,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(and (= (_ bv2000 32) main_~c2~0) (= main_~k~0 (_ bv0 32)))} assume !(0bv32 == ~v~0); {745#(and (= (_ bv2000 32) main_~c2~0) (not (= main_~v~0 (_ bv0 32))) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:32,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {745#(and (= (_ bv2000 32) main_~c2~0) (not (= main_~v~0 (_ bv0 32))) (= main_~k~0 (_ bv0 32)))} assume 1bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c2~0); {749#(= (_ bv2000 32) main_~k~0)} is VALID [2018-11-23 11:33:32,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {749#(= (_ bv2000 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {749#(= (_ bv2000 32) main_~k~0)} is VALID [2018-11-23 11:33:32,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {749#(= (_ bv2000 32) main_~k~0)} ~j~0 := 0bv32; {749#(= (_ bv2000 32) main_~k~0)} is VALID [2018-11-23 11:33:32,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {749#(= (_ bv2000 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {749#(= (_ bv2000 32) main_~k~0)} is VALID [2018-11-23 11:33:32,826 INFO L256 TraceCheckUtils]: 13: Hoare triple {749#(= (_ bv2000 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {762#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:32,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {762#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {766#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:32,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {715#false} is VALID [2018-11-23 11:33:32,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {715#false} assume !false; {715#false} is VALID [2018-11-23 11:33:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:32,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:33,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {715#false} assume !false; {715#false} is VALID [2018-11-23 11:33:33,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {776#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {715#false} is VALID [2018-11-23 11:33:33,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {780#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {776#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:33,053 INFO L256 TraceCheckUtils]: 13: Hoare triple {784#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {780#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:33,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {784#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {784#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:33,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {784#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:33,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {784#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {784#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:33,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {797#(or (bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32)) (not (= (bvadd main_~v~0 (_ bv4294967295 32)) (_ bv0 32))))} assume 1bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c2~0); {784#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:33,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {801#(bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32))} assume !(0bv32 == ~v~0); {797#(or (bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32)) (not (= (bvadd main_~v~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:33:33,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {801#(bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:33,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {801#(bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:33,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {811#(bvsgt main_~c2~0 (_ bv0 32))} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {801#(bvsgt (bvadd main_~c2~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:33,070 INFO L273 TraceCheckUtils]: 4: Hoare triple {714#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {811#(bvsgt main_~c2~0 (_ bv0 32))} is VALID [2018-11-23 11:33:33,070 INFO L256 TraceCheckUtils]: 3: Hoare triple {714#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {714#true} is VALID [2018-11-23 11:33:33,071 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {714#true} {714#true} #65#return; {714#true} is VALID [2018-11-23 11:33:33,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {714#true} assume true; {714#true} is VALID [2018-11-23 11:33:33,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {714#true} call ULTIMATE.init(); {714#true} is VALID [2018-11-23 11:33:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:33,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:33,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:33:33,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-11-23 11:33:33,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:33,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:33:33,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:33,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:33:33,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:33:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:33:33,288 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 14 states. [2018-11-23 11:33:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:35,048 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2018-11-23 11:33:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:33:35,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-11-23 11:33:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:33:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 81 transitions. [2018-11-23 11:33:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:33:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 81 transitions. [2018-11-23 11:33:35,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 81 transitions. [2018-11-23 11:33:35,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:35,219 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:33:35,219 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:33:35,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:33:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:33:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-11-23 11:33:35,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:35,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 50 states. [2018-11-23 11:33:35,317 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 50 states. [2018-11-23 11:33:35,317 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 50 states. [2018-11-23 11:33:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:35,323 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 11:33:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:33:35,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:35,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:35,326 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 80 states. [2018-11-23 11:33:35,326 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 80 states. [2018-11-23 11:33:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:35,333 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 11:33:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:33:35,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:35,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:35,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:35,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:33:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2018-11-23 11:33:35,339 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 17 [2018-11-23 11:33:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:35,339 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2018-11-23 11:33:35,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:33:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2018-11-23 11:33:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:33:35,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:35,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:35,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:35,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash -595967908, now seen corresponding path program 1 times [2018-11-23 11:33:35,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:35,342 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:35,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:35,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:35,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2018-11-23 11:33:35,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {1186#true} assume true; {1186#true} is VALID [2018-11-23 11:33:35,523 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1186#true} {1186#true} #65#return; {1186#true} is VALID [2018-11-23 11:33:35,523 INFO L256 TraceCheckUtils]: 3: Hoare triple {1186#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1186#true} is VALID [2018-11-23 11:33:35,524 INFO L273 TraceCheckUtils]: 4: Hoare triple {1186#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1203#(= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:35,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {1203#(= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:35,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:35,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:35,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !(0bv32 == ~v~0); {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:35,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {1207#(and (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !(1bv32 == ~v~0);~k~0 := ~bvadd32(~k~0, ~c3~0); {1220#(= (_ bv10000 32) main_~k~0)} is VALID [2018-11-23 11:33:35,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {1220#(= (_ bv10000 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {1220#(= (_ bv10000 32) main_~k~0)} is VALID [2018-11-23 11:33:35,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {1220#(= (_ bv10000 32) main_~k~0)} ~j~0 := 0bv32; {1220#(= (_ bv10000 32) main_~k~0)} is VALID [2018-11-23 11:33:35,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {1220#(= (_ bv10000 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {1220#(= (_ bv10000 32) main_~k~0)} is VALID [2018-11-23 11:33:35,538 INFO L256 TraceCheckUtils]: 13: Hoare triple {1220#(= (_ bv10000 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1233#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:35,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {1233#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1237#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:35,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {1237#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1187#false} is VALID [2018-11-23 11:33:35,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2018-11-23 11:33:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:35,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:35,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2018-11-23 11:33:35,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1187#false} is VALID [2018-11-23 11:33:35,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {1251#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1247#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:35,680 INFO L256 TraceCheckUtils]: 13: Hoare triple {1255#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1251#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:35,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {1255#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {1255#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:35,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {1255#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {1255#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:35,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {1255#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {1255#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:35,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} assume !(1bv32 == ~v~0);~k~0 := ~bvadd32(~k~0, ~c3~0); {1255#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:35,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} assume !(0bv32 == ~v~0); {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:35,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:35,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:35,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {1281#(bvsgt main_~c3~0 (_ bv0 32))} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {1268#(bvsgt (bvadd main_~c3~0 main_~k~0) (_ bv0 32))} is VALID [2018-11-23 11:33:35,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {1186#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1281#(bvsgt main_~c3~0 (_ bv0 32))} is VALID [2018-11-23 11:33:35,703 INFO L256 TraceCheckUtils]: 3: Hoare triple {1186#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1186#true} is VALID [2018-11-23 11:33:35,703 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1186#true} {1186#true} #65#return; {1186#true} is VALID [2018-11-23 11:33:35,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {1186#true} assume true; {1186#true} is VALID [2018-11-23 11:33:35,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2018-11-23 11:33:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:35,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:35,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:33:35,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 11:33:35,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:35,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:33:35,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:35,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:33:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:33:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:33:35,803 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand 12 states. [2018-11-23 11:33:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:37,271 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2018-11-23 11:33:37,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:33:37,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 11:33:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:33:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:33:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:33:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:33:37,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 11:33:37,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:37,465 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:33:37,465 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:33:37,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:33:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:33:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2018-11-23 11:33:37,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:37,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 58 states. [2018-11-23 11:33:37,603 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 58 states. [2018-11-23 11:33:37,603 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 58 states. [2018-11-23 11:33:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:37,608 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2018-11-23 11:33:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2018-11-23 11:33:37,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:37,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:37,609 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 81 states. [2018-11-23 11:33:37,609 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 81 states. [2018-11-23 11:33:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:37,614 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2018-11-23 11:33:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2018-11-23 11:33:37,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:37,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:37,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:37,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:33:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2018-11-23 11:33:37,618 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 17 [2018-11-23 11:33:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:37,619 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2018-11-23 11:33:37,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:33:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2018-11-23 11:33:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:33:37,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:37,620 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:37,620 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:37,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1650045878, now seen corresponding path program 1 times [2018-11-23 11:33:37,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:37,621 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:37,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:37,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2018-11-23 11:33:37,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {1664#true} assume true; {1664#true} is VALID [2018-11-23 11:33:37,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1664#true} {1664#true} #65#return; {1664#true} is VALID [2018-11-23 11:33:37,846 INFO L256 TraceCheckUtils]: 3: Hoare triple {1664#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1664#true} is VALID [2018-11-23 11:33:37,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {1664#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1664#true} is VALID [2018-11-23 11:33:37,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {1664#true} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {1684#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:37,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {1684#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1688#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:37,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {1688#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {1692#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:37,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {1692#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c1~0); {1692#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:37,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {1692#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1665#false} is VALID [2018-11-23 11:33:37,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#false} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {1665#false} is VALID [2018-11-23 11:33:37,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#false} assume !(0bv32 == ~v~0); {1665#false} is VALID [2018-11-23 11:33:37,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1665#false} assume 1bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c2~0); {1665#false} is VALID [2018-11-23 11:33:37,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {1665#false} assume !~bvslt32(~i~0, ~n~0); {1665#false} is VALID [2018-11-23 11:33:37,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {1665#false} ~j~0 := 0bv32; {1665#false} is VALID [2018-11-23 11:33:37,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {1665#false} assume !!~bvslt32(~j~0, ~n~0); {1665#false} is VALID [2018-11-23 11:33:37,853 INFO L256 TraceCheckUtils]: 16: Hoare triple {1665#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1665#false} is VALID [2018-11-23 11:33:37,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {1665#false} ~cond := #in~cond; {1665#false} is VALID [2018-11-23 11:33:37,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {1665#false} assume 0bv32 == ~cond; {1665#false} is VALID [2018-11-23 11:33:37,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2018-11-23 11:33:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:37,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:37,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2018-11-23 11:33:37,959 INFO L273 TraceCheckUtils]: 18: Hoare triple {1665#false} assume 0bv32 == ~cond; {1665#false} is VALID [2018-11-23 11:33:37,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {1665#false} ~cond := #in~cond; {1665#false} is VALID [2018-11-23 11:33:37,959 INFO L256 TraceCheckUtils]: 16: Hoare triple {1665#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1665#false} is VALID [2018-11-23 11:33:37,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {1665#false} assume !!~bvslt32(~j~0, ~n~0); {1665#false} is VALID [2018-11-23 11:33:37,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {1665#false} ~j~0 := 0bv32; {1665#false} is VALID [2018-11-23 11:33:37,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {1665#false} assume !~bvslt32(~i~0, ~n~0); {1665#false} is VALID [2018-11-23 11:33:37,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {1665#false} assume 1bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c2~0); {1665#false} is VALID [2018-11-23 11:33:37,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#false} assume !(0bv32 == ~v~0); {1665#false} is VALID [2018-11-23 11:33:37,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#false} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {1665#false} is VALID [2018-11-23 11:33:37,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {1759#(not (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1665#false} is VALID [2018-11-23 11:33:37,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {1759#(not (bvslt main_~i~0 main_~n~0))} assume 0bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c1~0); {1759#(not (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:33:37,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {1766#(or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt main_~n~0 (_ bv2 32))))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {1759#(not (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:33:37,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {1770#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~n~0 (_ bv2 32))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1766#(or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt main_~n~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:37,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {1664#true} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {1770#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~n~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:37,967 INFO L273 TraceCheckUtils]: 4: Hoare triple {1664#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1664#true} is VALID [2018-11-23 11:33:37,967 INFO L256 TraceCheckUtils]: 3: Hoare triple {1664#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1664#true} is VALID [2018-11-23 11:33:37,968 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1664#true} {1664#true} #65#return; {1664#true} is VALID [2018-11-23 11:33:37,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {1664#true} assume true; {1664#true} is VALID [2018-11-23 11:33:37,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2018-11-23 11:33:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:37,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:37,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:33:37,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 11:33:37,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:37,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:33:38,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:38,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:33:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:33:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:33:38,011 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand 8 states. [2018-11-23 11:33:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:38,369 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2018-11-23 11:33:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:38,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 11:33:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:33:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 11:33:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:33:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 11:33:38,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2018-11-23 11:33:38,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:38,451 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:33:38,451 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:33:38,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:33:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:33:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 11:33:38,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:38,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 11:33:38,492 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 11:33:38,493 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 11:33:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:38,494 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 11:33:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 11:33:38,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:38,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:38,495 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 11:33:38,495 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 11:33:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:38,497 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 11:33:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 11:33:38,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:38,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:38,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:38,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:33:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 11:33:38,500 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2018-11-23 11:33:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:38,501 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 11:33:38,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:33:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 11:33:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:33:38,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:38,502 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:38,502 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:38,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:38,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1617331331, now seen corresponding path program 1 times [2018-11-23 11:33:38,503 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:38,503 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:38,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:38,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:38,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {1999#true} call ULTIMATE.init(); {1999#true} is VALID [2018-11-23 11:33:38,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-23 11:33:38,887 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1999#true} {1999#true} #65#return; {1999#true} is VALID [2018-11-23 11:33:38,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {1999#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1999#true} is VALID [2018-11-23 11:33:38,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {1999#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1999#true} is VALID [2018-11-23 11:33:38,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {1999#true} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {2019#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:38,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {2019#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {2019#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:38,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {2019#(and (bvslt main_~n~0 (_ bv10 32)) (bvsle (_ bv0 32) main_~n~0))} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {2026#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} is VALID [2018-11-23 11:33:38,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {2026#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} assume 0bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c1~0); {2026#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} is VALID [2018-11-23 11:33:38,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {2026#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} assume !~bvslt32(~i~0, ~n~0); {2026#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} is VALID [2018-11-23 11:33:38,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {2026#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} ~j~0 := 0bv32; {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} is VALID [2018-11-23 11:33:38,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} assume !!~bvslt32(~j~0, ~n~0); {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} is VALID [2018-11-23 11:33:38,893 INFO L256 TraceCheckUtils]: 12: Hoare triple {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1999#true} is VALID [2018-11-23 11:33:38,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {1999#true} ~cond := #in~cond; {1999#true} is VALID [2018-11-23 11:33:38,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {1999#true} assume !(0bv32 == ~cond); {1999#true} is VALID [2018-11-23 11:33:38,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-23 11:33:38,895 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1999#true} {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} #69#return; {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} is VALID [2018-11-23 11:33:38,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {2036#(and (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2058#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:38,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {2058#(and (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {2000#false} is VALID [2018-11-23 11:33:38,897 INFO L256 TraceCheckUtils]: 19: Hoare triple {2000#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2000#false} is VALID [2018-11-23 11:33:38,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {2000#false} ~cond := #in~cond; {2000#false} is VALID [2018-11-23 11:33:38,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {2000#false} assume !(0bv32 == ~cond); {2000#false} is VALID [2018-11-23 11:33:38,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {2000#false} assume true; {2000#false} is VALID [2018-11-23 11:33:38,899 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2000#false} {2000#false} #69#return; {2000#false} is VALID [2018-11-23 11:33:38,899 INFO L273 TraceCheckUtils]: 24: Hoare triple {2000#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2000#false} is VALID [2018-11-23 11:33:38,899 INFO L273 TraceCheckUtils]: 25: Hoare triple {2000#false} assume !!~bvslt32(~j~0, ~n~0); {2000#false} is VALID [2018-11-23 11:33:38,900 INFO L256 TraceCheckUtils]: 26: Hoare triple {2000#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2000#false} is VALID [2018-11-23 11:33:38,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {2000#false} ~cond := #in~cond; {2000#false} is VALID [2018-11-23 11:33:38,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {2000#false} assume 0bv32 == ~cond; {2000#false} is VALID [2018-11-23 11:33:38,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {2000#false} assume !false; {2000#false} is VALID [2018-11-23 11:33:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:33:38,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:39,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {2000#false} assume !false; {2000#false} is VALID [2018-11-23 11:33:39,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {2000#false} assume 0bv32 == ~cond; {2000#false} is VALID [2018-11-23 11:33:39,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {2000#false} ~cond := #in~cond; {2000#false} is VALID [2018-11-23 11:33:39,042 INFO L256 TraceCheckUtils]: 26: Hoare triple {2000#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2000#false} is VALID [2018-11-23 11:33:39,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {2000#false} assume !!~bvslt32(~j~0, ~n~0); {2000#false} is VALID [2018-11-23 11:33:39,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {2000#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2000#false} is VALID [2018-11-23 11:33:39,043 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1999#true} {2000#false} #69#return; {2000#false} is VALID [2018-11-23 11:33:39,043 INFO L273 TraceCheckUtils]: 22: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-23 11:33:39,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {1999#true} assume !(0bv32 == ~cond); {1999#true} is VALID [2018-11-23 11:33:39,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {1999#true} ~cond := #in~cond; {1999#true} is VALID [2018-11-23 11:33:39,044 INFO L256 TraceCheckUtils]: 19: Hoare triple {2000#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1999#true} is VALID [2018-11-23 11:33:39,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {2128#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {2000#false} is VALID [2018-11-23 11:33:39,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2128#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-23 11:33:39,051 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1999#true} {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #69#return; {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:33:39,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-23 11:33:39,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {1999#true} assume !(0bv32 == ~cond); {1999#true} is VALID [2018-11-23 11:33:39,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {1999#true} ~cond := #in~cond; {1999#true} is VALID [2018-11-23 11:33:39,052 INFO L256 TraceCheckUtils]: 12: Hoare triple {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1999#true} is VALID [2018-11-23 11:33:39,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:33:39,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {2154#(not (bvslt (_ bv1 32) main_~n~0))} ~j~0 := 0bv32; {2132#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:33:39,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {2154#(not (bvslt (_ bv1 32) main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {2154#(not (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:33:39,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {2154#(not (bvslt (_ bv1 32) main_~n~0))} assume 0bv32 == ~v~0;~k~0 := ~bvadd32(~k~0, ~c1~0); {2154#(not (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:33:39,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {1999#true} assume !!(~bvsle32(0bv32, ~v~0) && ~bvslt32(~n~0, 2bv32)); {2154#(not (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:33:39,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {1999#true} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~v~0 := #t~nondet3;havoc #t~nondet3; {1999#true} is VALID [2018-11-23 11:33:39,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {1999#true} assume !!(~bvsle32(0bv32, ~n~0) && ~bvslt32(~n~0, 10bv32));~k~0 := 0bv32;~i~0 := 0bv32; {1999#true} is VALID [2018-11-23 11:33:39,057 INFO L273 TraceCheckUtils]: 4: Hoare triple {1999#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000bv32;~c2~0 := 2000bv32;~c3~0 := 10000bv32;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1999#true} is VALID [2018-11-23 11:33:39,057 INFO L256 TraceCheckUtils]: 3: Hoare triple {1999#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1999#true} is VALID [2018-11-23 11:33:39,058 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1999#true} {1999#true} #65#return; {1999#true} is VALID [2018-11-23 11:33:39,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {1999#true} assume true; {1999#true} is VALID [2018-11-23 11:33:39,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {1999#true} call ULTIMATE.init(); {1999#true} is VALID [2018-11-23 11:33:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:33:39,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:39,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:33:39,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 11:33:39,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:39,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:33:39,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:39,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:33:39,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:33:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:33:39,118 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2018-11-23 11:33:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:39,448 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:33:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:33:39,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-23 11:33:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:33:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 11:33:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:33:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 11:33:39,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2018-11-23 11:33:39,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:39,492 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:33:39,493 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:33:39,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:33:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:33:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:33:39,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:39,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:39,495 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:39,495 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:39,495 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:33:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:33:39,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:39,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:39,496 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:39,496 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:39,496 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:33:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:33:39,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:39,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:39,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:39,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:33:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:33:39,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-23 11:33:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:39,497 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:33:39,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:33:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:33:39,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:39,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:33:40,181 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-23 11:33:40,387 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-23 11:33:40,720 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2018-11-23 11:33:40,727 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:33:40,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:33:40,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:33:40,728 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:33:40,728 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:33:40,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:33:40,728 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (let ((.cse0 (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32))) (.cse2 (= (_ bv4000 32) main_~c1~0)) (.cse1 (= (_ bv2000 32) main_~c2~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv10000 32) main_~k~0)) (and .cse0 (or (and (= (_ bv2000 32) main_~k~0) .cse1 .cse2) (and .cse2 .cse1 (= (_ bv4000 32) main_~k~0)))))) (= main_~j~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~n~0) (bvslt main_~n~0 (_ bv2 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:33:40,729 INFO L448 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-11-23 11:33:40,729 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2018-11-23 11:33:40,729 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-23 11:33:40,729 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-23 11:33:40,729 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2018-11-23 11:33:40,729 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 36) the Hoare annotation is: (let ((.cse5 (bvslt main_~n~0 (_ bv2 32))) (.cse0 (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32))) (.cse1 (= (_ bv2000 32) main_~c2~0)) (.cse2 (= (_ bv4000 32) main_~c1~0)) (.cse6 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= main_~j~0 (_ bv0 32))) (.cse4 (bvsle (_ bv0 32) main_~n~0))) (or (and (or (and .cse0 .cse1 .cse2 (= (_ bv10000 32) main_~k~0)) (and .cse0 (or (and (= (_ bv2000 32) main_~k~0) .cse1 .cse2) (and .cse2 .cse1 (= (_ bv4000 32) main_~k~0))))) .cse3 .cse4 .cse5 .cse6) (and .cse4 .cse5 (and .cse0 (and .cse1 .cse2 (bvsgt main_~k~0 (_ bv0 32)))) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) .cse6) (and (not (bvslt (_ bv0 32) main_~n~0)) .cse3 .cse4 (= main_~i~0 (_ bv0 32))))) [2018-11-23 11:33:40,729 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2018-11-23 11:33:40,730 INFO L448 ceAbstractionStarter]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2018-11-23 11:33:40,730 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-11-23 11:33:40,730 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-11-23 11:33:40,730 INFO L444 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (= (bvadd main_~c3~0 (_ bv4294957296 32)) (_ bv0 32))) (.cse1 (= (_ bv4000 32) main_~c1~0)) (.cse2 (= (_ bv2000 32) main_~c2~0)) (.cse3 (bvsle (_ bv0 32) main_~n~0)) (.cse4 (bvslt main_~n~0 (_ bv2 32))) (.cse5 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv4000 32) main_~k~0) .cse3 .cse4 .cse5) (and .cse0 (bvslt main_~n~0 (_ bv10 32)) .cse1 .cse2 .cse3 (= main_~i~0 (_ bv0 32)) (= main_~k~0 (_ bv0 32))) (and .cse0 (= (_ bv2000 32) main_~k~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv10000 32) main_~k~0) .cse5))) [2018-11-23 11:33:40,730 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2018-11-23 11:33:40,730 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:33:40,730 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:33:40,731 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:33:40,731 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:33:40,731 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:33:40,731 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:33:40,732 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:33:40,733 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:33:40,734 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 11:33:40,735 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:33:40,735 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:33:40,735 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:40,735 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2018-11-23 11:33:40,735 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2018-11-23 11:33:40,737 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:33:40,738 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:33:40,738 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-23 11:33:40,738 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2018-11-23 11:33:40,738 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-23 11:33:40,738 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 11:33:40,738 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-23 11:33:40,738 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-23 11:33:40,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:33:40 BoogieIcfgContainer [2018-11-23 11:33:40,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:33:40,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:33:40,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:33:40,758 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:33:40,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:28" (3/4) ... [2018-11-23 11:33:40,763 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:33:40,769 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:33:40,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:33:40,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:33:40,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 11:33:40,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:33:40,779 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:33:40,833 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/large_const_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:33:40,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:33:40,835 INFO L168 Benchmark]: Toolchain (without parser) took 13845.38 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 846.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -583.3 MB). Peak memory consumption was 263.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:40,837 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:33:40,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.91 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:40,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.11 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-23 11:33:40,839 INFO L168 Benchmark]: Boogie Preprocessor took 32.99 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-23 11:33:40,839 INFO L168 Benchmark]: RCFGBuilder took 673.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:40,840 INFO L168 Benchmark]: TraceAbstraction took 12679.01 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 138.5 MB). Peak memory consumption was 273.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:40,840 INFO L168 Benchmark]: Witness Printer took 75.33 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:40,843 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.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.91 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.11 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. * Boogie Preprocessor took 32.99 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 673.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12679.01 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 134.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 138.5 MB). Peak memory consumption was 273.3 MB. Max. memory is 7.1 GB. * Witness Printer took 75.33 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((~bvadd64(c3, 4294957296bv32) == 0bv32 && 4000bv32 == c1) && 2000bv32 == c2) && 4000bv32 == k) && ~bvsle32(0bv32, n)) && ~bvslt32(n, 2bv32)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || ((((((~bvadd64(c3, 4294957296bv32) == 0bv32 && ~bvslt32(n, 10bv32)) && 4000bv32 == c1) && 2000bv32 == c2) && ~bvsle32(0bv32, n)) && i == 0bv32) && k == 0bv32)) || ((((((~bvadd64(c3, 4294957296bv32) == 0bv32 && 2000bv32 == k) && 4000bv32 == c1) && 2000bv32 == c2) && ~bvsle32(0bv32, n)) && ~bvslt32(n, 2bv32)) && ~bvadd64(i, 4294967295bv32) == 0bv32)) || ((((((~bvadd64(c3, 4294957296bv32) == 0bv32 && 4000bv32 == c1) && 2000bv32 == c2) && ~bvsle32(0bv32, n)) && ~bvslt32(n, 2bv32)) && 10000bv32 == k) && ~bvadd64(i, 4294967295bv32) == 0bv32) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((~bvadd64(c3, 4294957296bv32) == 0bv32 && 2000bv32 == c2) && 4000bv32 == c1) && 10000bv32 == k) || (~bvadd64(c3, 4294957296bv32) == 0bv32 && (((2000bv32 == k && 2000bv32 == c2) && 4000bv32 == c1) || ((4000bv32 == c1 && 2000bv32 == c2) && 4000bv32 == k)))) && j == 0bv32) && ~bvsle32(0bv32, n)) && ~bvslt32(n, 2bv32)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || ((((~bvsle32(0bv32, n) && ~bvslt32(n, 2bv32)) && ~bvadd64(c3, 4294957296bv32) == 0bv32 && (2000bv32 == c2 && 4000bv32 == c1) && ~bvsgt32(k, 0bv32)) && ~bvadd64(j, 4294967295bv32) == 0bv32) && ~bvadd64(i, 4294967295bv32) == 0bv32)) || (((!~bvslt32(0bv32, n) && j == 0bv32) && ~bvsle32(0bv32, n)) && i == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 12.5s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 215 SDslu, 590 SDs, 0 SdLazy, 396 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 69 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 272 HoareAnnotationTreeSize, 14 FomulaSimplifications, 366 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 12151 SizeOfPredicates, 18 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 38/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...