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-lit/gj2007b_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:38:40,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:40,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:40,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:40,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:40,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:40,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:40,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:40,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:40,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:40,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:40,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:40,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:40,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:40,864 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:40,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:40,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:40,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:40,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:40,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:40,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:40,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:40,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:40,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:40,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:40,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:40,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:40,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:40,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:40,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:40,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:40,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:40,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:40,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:40,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:40,890 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:40,895 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:38:40,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:40,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:40,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:40,923 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:40,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:40,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:40,925 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:40,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:40,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:40,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:40,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:40,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:40,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:40,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:40,927 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:38:40,927 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:38:40,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:40,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:40,928 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:40,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:40,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:40,928 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:40,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:40,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:40,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:40,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:40,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:40,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:40,930 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:38:40,930 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:40,930 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:38:40,930 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:38:40,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:38:40,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:40,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:40,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:41,001 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:41,002 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:41,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i [2018-11-23 11:38:41,053 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d15811d/4deba7ee33394f39b22b5f10b0dd7013/FLAG3808f8668 [2018-11-23 11:38:41,531 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:41,531 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i [2018-11-23 11:38:41,538 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d15811d/4deba7ee33394f39b22b5f10b0dd7013/FLAG3808f8668 [2018-11-23 11:38:41,873 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d15811d/4deba7ee33394f39b22b5f10b0dd7013 [2018-11-23 11:38:41,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:41,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:41,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:41,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:41,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:41,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a77f7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41, skipping insertion in model container [2018-11-23 11:38:41,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:41,933 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:42,185 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:42,192 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:42,215 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:42,236 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:42,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42 WrapperNode [2018-11-23 11:38:42,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:42,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:42,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:42,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:42,249 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:38:42" (1/1) ... [2018-11-23 11:38:42,260 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:38:42" (1/1) ... [2018-11-23 11:38:42,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:42,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:42,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:42,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:42,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (1/1) ... [2018-11-23 11:38:42,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:42,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:42,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:42,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:42,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (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:38:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:42,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:42,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:42,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:42,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:38:42,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:38:42,842 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:42,842 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:38:42,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:42 BoogieIcfgContainer [2018-11-23 11:38:42,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:42,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:42,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:42,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:42,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:41" (1/3) ... [2018-11-23 11:38:42,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f70397a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:42, skipping insertion in model container [2018-11-23 11:38:42,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:42" (2/3) ... [2018-11-23 11:38:42,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f70397a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:42, skipping insertion in model container [2018-11-23 11:38:42,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:42" (3/3) ... [2018-11-23 11:38:42,854 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007b_true-unreach-call_true-termination.c.i [2018-11-23 11:38:42,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:42,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:42,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:42,924 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:42,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:42,925 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:42,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:42,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:42,925 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:42,925 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:42,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:42,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:38:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:38:42,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:42,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:42,953 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:42,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:42,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2009018560, now seen corresponding path program 1 times [2018-11-23 11:38:42,965 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:42,966 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:38:42,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:43,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:38:43,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:38:43,110 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #40#return; {24#true} is VALID [2018-11-23 11:38:43,111 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-23 11:38:43,111 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 11:38:43,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:38:43,125 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:38:43,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:38:43,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:38:43,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:38:43,129 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:38:43,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:43,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:43,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:38:43,139 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:38:43,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:43,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:38:43,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:43,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:38:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:38:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:43,196 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:38:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,340 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 11:38:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:38:43,340 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:38:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:38:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2018-11-23 11:38:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:38:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2018-11-23 11:38:43,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2018-11-23 11:38:43,706 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:38:43,718 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:38:43,718 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:38:43,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:38:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:38:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 11:38:43,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:43,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:43,775 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:43,776 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,781 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:38:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:38:43,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:43,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:43,782 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:43,782 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:38:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,786 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:38:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:38:43,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:43,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:43,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:43,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 11:38:43,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 11:38:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:43,795 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 11:38:43,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:38:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:38:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:38:43,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:43,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:43,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:43,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2019177291, now seen corresponding path program 1 times [2018-11-23 11:38:43,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:43,798 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:38:43,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:43,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 11:38:43,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 11:38:43,978 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #40#return; {156#true} is VALID [2018-11-23 11:38:43,979 INFO L256 TraceCheckUtils]: 3: Hoare triple {156#true} call #t~ret3 := main(); {156#true} is VALID [2018-11-23 11:38:43,979 INFO L273 TraceCheckUtils]: 4: Hoare triple {156#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {173#(= main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:43,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {173#(= main_~m~0 (_ bv0 32))} assume !~bvslt32(~x~0, ~n~0); {173#(= main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:43,986 INFO L256 TraceCheckUtils]: 6: Hoare triple {173#(= main_~m~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:43,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:43,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {157#false} is VALID [2018-11-23 11:38:43,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 11:38:43,994 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:38:43,994 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:43,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:43,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:38:44,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:38:44,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:44,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:38:44,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:44,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:38:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:38:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:38:44,121 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-11-23 11:38:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,424 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 11:38:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:38:44,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:38:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:38:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:38:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:38:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:38:44,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-23 11:38:44,744 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:38:44,748 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:38:44,748 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:38:44,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:38:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:38:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:38:44,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:44,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,789 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,790 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,792 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-23 11:38:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 11:38:44,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:44,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:44,793 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,793 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,796 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-23 11:38:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 11:38:44,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:44,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:44,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:44,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:38:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-23 11:38:44,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2018-11-23 11:38:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:44,800 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 11:38:44,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:38:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 11:38:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:38:44,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:44,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:44,801 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:44,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1543015754, now seen corresponding path program 1 times [2018-11-23 11:38:44,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:44,802 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:38:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:44,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:45,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:38:45,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:38:45,112 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #40#return; {297#true} is VALID [2018-11-23 11:38:45,112 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret3 := main(); {297#true} is VALID [2018-11-23 11:38:45,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {314#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {314#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(= main_~x~0 (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {321#(= main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {321#(= main_~m~0 (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {321#(= main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {321#(= main_~m~0 (_ bv0 32))} assume !~bvslt32(~x~0, ~n~0); {321#(= main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,119 INFO L256 TraceCheckUtils]: 9: Hoare triple {321#(= main_~m~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {331#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:45,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {335#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:45,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {335#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:38:45,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:38:45,123 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:38:45,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:45,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:38:45,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {345#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:38:45,276 INFO L273 TraceCheckUtils]: 10: Hoare triple {349#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {345#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:45,277 INFO L256 TraceCheckUtils]: 9: Hoare triple {353#(bvsge main_~m~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {349#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:45,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {353#(bvsge main_~m~0 (_ bv0 32))} assume !~bvslt32(~x~0, ~n~0); {353#(bvsge main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#(bvsge main_~m~0 (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {353#(bvsge main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(bvsge main_~x~0 (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {353#(bvsge main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {363#(bvsge main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {363#(bvsge main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,281 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {363#(bvsge main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:45,281 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret3 := main(); {297#true} is VALID [2018-11-23 11:38:45,281 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #40#return; {297#true} is VALID [2018-11-23 11:38:45,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:38:45,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:38:45,283 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:38:45,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:45,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:38:45,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:38:45,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:45,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:38:45,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:45,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:38:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:38:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:45,341 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2018-11-23 11:38:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,316 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2018-11-23 11:38:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:38:46,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:38:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:38:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 11:38:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:38:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 11:38:46,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2018-11-23 11:38:46,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:46,437 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:38:46,437 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:38:46,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:38:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-23 11:38:46,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:46,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 32 states. [2018-11-23 11:38:46,468 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 32 states. [2018-11-23 11:38:46,469 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 32 states. [2018-11-23 11:38:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,473 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 11:38:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-23 11:38:46,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:46,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:46,475 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 42 states. [2018-11-23 11:38:46,475 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 42 states. [2018-11-23 11:38:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,479 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 11:38:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-11-23 11:38:46,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:46,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:46,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:46,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:38:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 11:38:46,484 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 13 [2018-11-23 11:38:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:46,484 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 11:38:46,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:38:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 11:38:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:38:46,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:46,486 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:46,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:46,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2054152790, now seen corresponding path program 2 times [2018-11-23 11:38:46,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:46,487 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:38:46,514 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:46,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:46,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:46,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:46,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {591#true} call ULTIMATE.init(); {591#true} is VALID [2018-11-23 11:38:46,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {591#true} assume true; {591#true} is VALID [2018-11-23 11:38:46,681 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {591#true} {591#true} #40#return; {591#true} is VALID [2018-11-23 11:38:46,682 INFO L256 TraceCheckUtils]: 3: Hoare triple {591#true} call #t~ret3 := main(); {591#true} is VALID [2018-11-23 11:38:46,684 INFO L273 TraceCheckUtils]: 4: Hoare triple {591#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {608#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {608#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {608#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {608#(= main_~x~0 (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {608#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {608#(= main_~x~0 (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {618#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {618#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {618#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {618#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {618#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {628#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {628#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {635#(= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {635#(= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {635#(= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,697 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~x~0, ~n~0); {635#(= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,707 INFO L256 TraceCheckUtils]: 15: Hoare triple {635#(= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {645#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {645#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {649#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {649#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {592#false} is VALID [2018-11-23 11:38:46,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {592#false} assume !false; {592#false} is VALID [2018-11-23 11:38:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:46,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:46,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {592#false} assume !false; {592#false} is VALID [2018-11-23 11:38:46,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {659#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {592#false} is VALID [2018-11-23 11:38:46,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {663#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {659#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:46,911 INFO L256 TraceCheckUtils]: 15: Hoare triple {667#(bvsge main_~m~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {663#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:46,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {667#(bvsge main_~m~0 (_ bv0 32))} assume !~bvslt32(~x~0, ~n~0); {667#(bvsge main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {667#(bvsge main_~m~0 (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {667#(bvsge main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#(bvsge main_~x~0 (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {667#(bvsge main_~m~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#(bvsge main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {677#(bvsge main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {684#(bvsge (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {677#(bvsge main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {684#(bvsge (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {684#(bvsge (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {684#(bvsge (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {684#(bvsge (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(bvsge (bvadd main_~x~0 (_ bv2 32)) (_ bv0 32))} ~x~0 := ~bvadd32(1bv32, ~x~0); {684#(bvsge (bvadd main_~x~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {694#(bvsge (bvadd main_~x~0 (_ bv2 32)) (_ bv0 32))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {694#(bvsge (bvadd main_~x~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {694#(bvsge (bvadd main_~x~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {694#(bvsge (bvadd main_~x~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,921 INFO L273 TraceCheckUtils]: 4: Hoare triple {591#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {694#(bvsge (bvadd main_~x~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,921 INFO L256 TraceCheckUtils]: 3: Hoare triple {591#true} call #t~ret3 := main(); {591#true} is VALID [2018-11-23 11:38:46,921 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {591#true} {591#true} #40#return; {591#true} is VALID [2018-11-23 11:38:46,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {591#true} assume true; {591#true} is VALID [2018-11-23 11:38:46,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {591#true} call ULTIMATE.init(); {591#true} is VALID [2018-11-23 11:38:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:46,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:38:46,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-11-23 11:38:46,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:46,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:38:46,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:46,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:38:46,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:38:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:46,993 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 14 states. [2018-11-23 11:38:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,617 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2018-11-23 11:38:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:38:48,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-11-23 11:38:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2018-11-23 11:38:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2018-11-23 11:38:48,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2018-11-23 11:38:48,902 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:38:48,907 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:38:48,907 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:38:48,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:38:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:38:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 23. [2018-11-23 11:38:48,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:48,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 23 states. [2018-11-23 11:38:48,968 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 23 states. [2018-11-23 11:38:48,968 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 23 states. [2018-11-23 11:38:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,983 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2018-11-23 11:38:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2018-11-23 11:38:48,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,989 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 73 states. [2018-11-23 11:38:48,990 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 73 states. [2018-11-23 11:38:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,997 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2018-11-23 11:38:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2018-11-23 11:38:48,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:48,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:38:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 11:38:49,001 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2018-11-23 11:38:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:49,002 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 11:38:49,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:38:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:38:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:38:49,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:49,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:49,003 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:49,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1165348024, now seen corresponding path program 1 times [2018-11-23 11:38:49,004 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:49,004 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:38:49,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:38:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:49,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:49,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {1035#true} call ULTIMATE.init(); {1035#true} is VALID [2018-11-23 11:38:49,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {1035#true} assume true; {1035#true} is VALID [2018-11-23 11:38:49,333 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1035#true} {1035#true} #40#return; {1035#true} is VALID [2018-11-23 11:38:49,334 INFO L256 TraceCheckUtils]: 3: Hoare triple {1035#true} call #t~ret3 := main(); {1035#true} is VALID [2018-11-23 11:38:49,337 INFO L273 TraceCheckUtils]: 4: Hoare triple {1035#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1052#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:49,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {1052#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {1056#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:49,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {1056#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1056#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:49,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {1056#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1063#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:49,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {1063#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1067#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:49,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {1067#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1071#(and (bvslt main_~x~0 main_~n~0) (= main_~m~0 main_~x~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:49,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {1071#(and (bvslt main_~x~0 main_~n~0) (= main_~m~0 main_~x~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1075#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} is VALID [2018-11-23 11:38:49,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} assume !~bvslt32(~x~0, ~n~0); {1079#(and (not (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0)) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} is VALID [2018-11-23 11:38:49,402 INFO L256 TraceCheckUtils]: 12: Hoare triple {1079#(and (not (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0)) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1035#true} is VALID [2018-11-23 11:38:49,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {1035#true} ~cond := #in~cond; {1035#true} is VALID [2018-11-23 11:38:49,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {1035#true} assume !(0bv32 == ~cond); {1035#true} is VALID [2018-11-23 11:38:49,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {1035#true} assume true; {1035#true} is VALID [2018-11-23 11:38:49,406 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1035#true} {1079#(and (not (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0)) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} #44#return; {1079#(and (not (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0)) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} is VALID [2018-11-23 11:38:49,407 INFO L256 TraceCheckUtils]: 17: Hoare triple {1079#(and (not (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0)) (bvslt main_~m~0 main_~n~0) (= (_ bv1 32) main_~m~0))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1098#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:49,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {1098#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1102#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:49,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {1102#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1036#false} is VALID [2018-11-23 11:38:49,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {1036#false} assume !false; {1036#false} is VALID [2018-11-23 11:38:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:49,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:49,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {1036#false} assume !false; {1036#false} is VALID [2018-11-23 11:38:49,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {1112#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1036#false} is VALID [2018-11-23 11:38:49,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {1116#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1112#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:49,816 INFO L256 TraceCheckUtils]: 17: Hoare triple {1120#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1116#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:49,818 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1035#true} {1120#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} #44#return; {1120#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:49,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {1035#true} assume true; {1035#true} is VALID [2018-11-23 11:38:49,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {1035#true} assume !(0bv32 == ~cond); {1035#true} is VALID [2018-11-23 11:38:49,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {1035#true} ~cond := #in~cond; {1035#true} is VALID [2018-11-23 11:38:49,819 INFO L256 TraceCheckUtils]: 12: Hoare triple {1120#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1035#true} is VALID [2018-11-23 11:38:49,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {1139#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !~bvslt32(~x~0, ~n~0); {1120#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:49,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {1143#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1139#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:49,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {1147#(or (bvslt main_~x~0 main_~n~0) (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1143#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:49,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {1035#true} assume !!~bvslt32(~x~0, ~n~0); {1147#(or (bvslt main_~x~0 main_~n~0) (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:49,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {1035#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {1035#true} is VALID [2018-11-23 11:38:49,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {1035#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1035#true} is VALID [2018-11-23 11:38:49,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {1035#true} assume !!~bvslt32(~x~0, ~n~0); {1035#true} is VALID [2018-11-23 11:38:49,823 INFO L273 TraceCheckUtils]: 4: Hoare triple {1035#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1035#true} is VALID [2018-11-23 11:38:49,824 INFO L256 TraceCheckUtils]: 3: Hoare triple {1035#true} call #t~ret3 := main(); {1035#true} is VALID [2018-11-23 11:38:49,824 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1035#true} {1035#true} #40#return; {1035#true} is VALID [2018-11-23 11:38:49,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {1035#true} assume true; {1035#true} is VALID [2018-11-23 11:38:49,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {1035#true} call ULTIMATE.init(); {1035#true} is VALID [2018-11-23 11:38:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:38:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:38:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2018-11-23 11:38:49,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-11-23 11:38:49,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:49,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:38:49,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:49,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:38:49,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:38:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:38:49,898 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 17 states. [2018-11-23 11:38:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,495 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 11:38:51,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:38:51,495 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-11-23 11:38:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:38:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-11-23 11:38:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:38:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-11-23 11:38:51,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 51 transitions. [2018-11-23 11:38:51,579 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:38:51,580 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:38:51,581 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:38:51,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:38:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:38:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-11-23 11:38:51,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:51,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 31 states. [2018-11-23 11:38:51,743 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 31 states. [2018-11-23 11:38:51,743 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 31 states. [2018-11-23 11:38:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,746 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:38:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:38:51,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,747 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 36 states. [2018-11-23 11:38:51,747 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 36 states. [2018-11-23 11:38:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:51,749 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:38:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:38:51,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:51,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:51,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:51,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:38:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:38:51,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 11:38:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:51,753 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:38:51,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:38:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:38:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:38:51,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:51,754 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:51,754 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:51,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:51,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1738534428, now seen corresponding path program 1 times [2018-11-23 11:38:51,755 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:51,755 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:38:51,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:51,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:52,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-23 11:38:52,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 11:38:52,251 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1388#true} {1388#true} #40#return; {1388#true} is VALID [2018-11-23 11:38:52,251 INFO L256 TraceCheckUtils]: 3: Hoare triple {1388#true} call #t~ret3 := main(); {1388#true} is VALID [2018-11-23 11:38:52,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {1388#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1405#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:52,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1405#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {1409#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:52,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {1409#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1409#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:52,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1409#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1416#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {1416#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1416#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1416#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1416#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {1416#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1426#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {1426#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1426#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {1426#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1433#(and (= main_~m~0 main_~x~0) (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {1433#(and (= main_~m~0 main_~x~0) (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1437#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:52,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {1437#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1441#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {1441#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1441#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {1441#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1448#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {1448#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~x~0, ~n~0); {1452#(and (not (bvslt (bvadd main_~m~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,294 INFO L256 TraceCheckUtils]: 18: Hoare triple {1452#(and (not (bvslt (bvadd main_~m~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1388#true} is VALID [2018-11-23 11:38:52,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {1388#true} ~cond := #in~cond; {1388#true} is VALID [2018-11-23 11:38:52,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {1388#true} assume !(0bv32 == ~cond); {1388#true} is VALID [2018-11-23 11:38:52,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 11:38:52,298 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1388#true} {1452#(and (not (bvslt (bvadd main_~m~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} #44#return; {1452#(and (not (bvslt (bvadd main_~m~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:52,299 INFO L256 TraceCheckUtils]: 23: Hoare triple {1452#(and (not (bvslt (bvadd main_~m~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~m~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~m~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1471#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:52,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {1471#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1475#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:52,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {1475#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1389#false} is VALID [2018-11-23 11:38:52,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-23 11:38:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:52,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:52,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-23 11:38:52,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {1485#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1389#false} is VALID [2018-11-23 11:38:52,671 INFO L273 TraceCheckUtils]: 24: Hoare triple {1489#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1485#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:52,671 INFO L256 TraceCheckUtils]: 23: Hoare triple {1493#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1489#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:52,672 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1388#true} {1493#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} #44#return; {1493#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:52,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 11:38:52,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {1388#true} assume !(0bv32 == ~cond); {1388#true} is VALID [2018-11-23 11:38:52,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {1388#true} ~cond := #in~cond; {1388#true} is VALID [2018-11-23 11:38:52,673 INFO L256 TraceCheckUtils]: 18: Hoare triple {1493#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1388#true} is VALID [2018-11-23 11:38:52,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {1512#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !~bvslt32(~x~0, ~n~0); {1493#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:52,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {1516#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1512#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:52,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {1516#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1516#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:52,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {1523#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~x~0 main_~n~0)) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1516#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:52,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {1527#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1523#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~x~0 main_~n~0)) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:52,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {1388#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1527#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:38:52,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {1388#true} assume !!~bvslt32(~x~0, ~n~0); {1388#true} is VALID [2018-11-23 11:38:52,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {1388#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {1388#true} is VALID [2018-11-23 11:38:52,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {1388#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1388#true} is VALID [2018-11-23 11:38:52,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {1388#true} assume !!~bvslt32(~x~0, ~n~0); {1388#true} is VALID [2018-11-23 11:38:52,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {1388#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {1388#true} is VALID [2018-11-23 11:38:52,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1388#true} is VALID [2018-11-23 11:38:52,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} assume !!~bvslt32(~x~0, ~n~0); {1388#true} is VALID [2018-11-23 11:38:52,719 INFO L273 TraceCheckUtils]: 4: Hoare triple {1388#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1388#true} is VALID [2018-11-23 11:38:52,719 INFO L256 TraceCheckUtils]: 3: Hoare triple {1388#true} call #t~ret3 := main(); {1388#true} is VALID [2018-11-23 11:38:52,719 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1388#true} {1388#true} #40#return; {1388#true} is VALID [2018-11-23 11:38:52,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-23 11:38:52,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-23 11:38:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:38:52,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:52,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 11:38:52,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-23 11:38:52,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:52,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:38:52,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:52,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:38:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:38:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:38:52,830 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 20 states. [2018-11-23 11:38:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:55,499 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-23 11:38:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:38:55,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-11-23 11:38:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:38:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2018-11-23 11:38:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:38:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2018-11-23 11:38:55,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 68 transitions. [2018-11-23 11:38:55,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:55,690 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:38:55,690 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:38:55,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:38:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:38:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2018-11-23 11:38:55,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:55,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 37 states. [2018-11-23 11:38:55,746 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 37 states. [2018-11-23 11:38:55,746 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 37 states. [2018-11-23 11:38:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:55,749 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-23 11:38:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-23 11:38:55,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:55,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:55,750 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 62 states. [2018-11-23 11:38:55,750 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 62 states. [2018-11-23 11:38:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:55,753 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-23 11:38:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-23 11:38:55,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:55,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:55,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:55,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:38:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 11:38:55,755 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2018-11-23 11:38:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:55,756 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 11:38:55,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:38:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:38:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:38:55,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:55,757 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:55,757 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:55,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1463704374, now seen corresponding path program 2 times [2018-11-23 11:38:55,758 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:55,758 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:38:55,791 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:55,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:55,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:55,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:56,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {1873#true} call ULTIMATE.init(); {1873#true} is VALID [2018-11-23 11:38:56,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {1873#true} assume true; {1873#true} is VALID [2018-11-23 11:38:56,452 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1873#true} {1873#true} #40#return; {1873#true} is VALID [2018-11-23 11:38:56,453 INFO L256 TraceCheckUtils]: 3: Hoare triple {1873#true} call #t~ret3 := main(); {1873#true} is VALID [2018-11-23 11:38:56,453 INFO L273 TraceCheckUtils]: 4: Hoare triple {1873#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1890#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:56,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {1890#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {1894#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:56,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {1894#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1894#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:56,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {1894#(and (bvslt main_~x~0 main_~n~0) (= main_~x~0 (_ bv0 32)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1901#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1901#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {1901#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1901#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {1901#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1911#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {1911#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1911#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {1911#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1911#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {1911#(and (= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1921#(and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:38:56,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {1921#(and (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1925#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:56,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {1925#(and (bvslt main_~x~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1929#(and (bvslt main_~x~0 main_~n~0) (= main_~m~0 main_~x~0) (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:56,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {1929#(and (bvslt main_~x~0 main_~n~0) (= main_~m~0 main_~x~0) (= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32)))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1933#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {1933#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1933#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,463 INFO L273 TraceCheckUtils]: 18: Hoare triple {1933#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1933#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {1933#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~m~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1943#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {1943#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {1943#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {1943#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1943#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {1943#(and (= (bvadd main_~m~0 (_ bv2 32)) main_~x~0) (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {1953#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~m~0))} is VALID [2018-11-23 11:38:56,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {1953#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~m~0))} assume !~bvslt32(~x~0, ~n~0); {1957#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~m~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:38:56,477 INFO L256 TraceCheckUtils]: 24: Hoare triple {1957#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~m~0 (_ bv3 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1873#true} is VALID [2018-11-23 11:38:56,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2018-11-23 11:38:56,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {1873#true} assume !(0bv32 == ~cond); {1873#true} is VALID [2018-11-23 11:38:56,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {1873#true} assume true; {1873#true} is VALID [2018-11-23 11:38:56,478 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1873#true} {1957#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~m~0 (_ bv3 32)) main_~n~0)))} #44#return; {1957#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~m~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:38:56,480 INFO L256 TraceCheckUtils]: 29: Hoare triple {1957#(and (= (bvadd main_~m~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~m~0 main_~n~0) (not (bvslt (bvadd main_~m~0 (_ bv3 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1976#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:56,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {1976#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1980#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:56,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {1980#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1874#false} is VALID [2018-11-23 11:38:56,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {1874#false} assume !false; {1874#false} is VALID [2018-11-23 11:38:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:56,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:56,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {1874#false} assume !false; {1874#false} is VALID [2018-11-23 11:38:56,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {1990#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1874#false} is VALID [2018-11-23 11:38:56,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {1994#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1990#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:56,982 INFO L256 TraceCheckUtils]: 29: Hoare triple {1998#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1994#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:56,983 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1873#true} {1998#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} #44#return; {1998#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {1873#true} assume true; {1873#true} is VALID [2018-11-23 11:38:56,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {1873#true} assume !(0bv32 == ~cond); {1873#true} is VALID [2018-11-23 11:38:56,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2018-11-23 11:38:56,984 INFO L256 TraceCheckUtils]: 24: Hoare triple {1998#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {1873#true} is VALID [2018-11-23 11:38:56,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {2017#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !~bvslt32(~x~0, ~n~0); {1998#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {2021#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2017#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {2021#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2021#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:56,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {2021#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2021#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:57,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {2031#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2021#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:57,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {2031#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2031#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:57,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {2031#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2031#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:57,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {2041#(or (bvslt (bvadd main_~x~0 (_ bv3 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2031#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:57,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {2045#(or (bvslt main_~x~0 main_~n~0) (bvslt (bvadd main_~x~0 (_ bv3 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2041#(or (bvslt (bvadd main_~x~0 (_ bv3 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:38:57,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {1873#true} assume !!~bvslt32(~x~0, ~n~0); {2045#(or (bvslt main_~x~0 main_~n~0) (bvslt (bvadd main_~x~0 (_ bv3 32)) main_~n~0) (bvsle main_~n~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:57,050 INFO L273 TraceCheckUtils]: 13: Hoare triple {1873#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {1873#true} is VALID [2018-11-23 11:38:57,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {1873#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1873#true} is VALID [2018-11-23 11:38:57,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {1873#true} assume !!~bvslt32(~x~0, ~n~0); {1873#true} is VALID [2018-11-23 11:38:57,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {1873#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {1873#true} is VALID [2018-11-23 11:38:57,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {1873#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1873#true} is VALID [2018-11-23 11:38:57,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {1873#true} assume !!~bvslt32(~x~0, ~n~0); {1873#true} is VALID [2018-11-23 11:38:57,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {1873#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {1873#true} is VALID [2018-11-23 11:38:57,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {1873#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1873#true} is VALID [2018-11-23 11:38:57,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {1873#true} assume !!~bvslt32(~x~0, ~n~0); {1873#true} is VALID [2018-11-23 11:38:57,051 INFO L273 TraceCheckUtils]: 4: Hoare triple {1873#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1873#true} is VALID [2018-11-23 11:38:57,051 INFO L256 TraceCheckUtils]: 3: Hoare triple {1873#true} call #t~ret3 := main(); {1873#true} is VALID [2018-11-23 11:38:57,052 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1873#true} {1873#true} #40#return; {1873#true} is VALID [2018-11-23 11:38:57,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {1873#true} assume true; {1873#true} is VALID [2018-11-23 11:38:57,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {1873#true} call ULTIMATE.init(); {1873#true} is VALID [2018-11-23 11:38:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:38:57,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:57,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 11:38:57,056 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 11:38:57,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:57,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:38:57,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:57,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:38:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:38:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:38:57,198 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 23 states. [2018-11-23 11:39:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:00,564 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-23 11:39:00,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:39:00,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 11:39:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:39:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 75 transitions. [2018-11-23 11:39:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:39:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 75 transitions. [2018-11-23 11:39:00,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 75 transitions. [2018-11-23 11:39:00,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:00,779 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:39:00,780 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:39:00,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:39:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:39:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2018-11-23 11:39:00,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:00,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 49 states. [2018-11-23 11:39:00,994 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 49 states. [2018-11-23 11:39:00,994 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 49 states. [2018-11-23 11:39:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:00,997 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-11-23 11:39:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2018-11-23 11:39:00,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:00,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:00,998 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 72 states. [2018-11-23 11:39:00,998 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 72 states. [2018-11-23 11:39:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:01,001 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-11-23 11:39:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2018-11-23 11:39:01,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:01,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:01,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:01,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:39:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-11-23 11:39:01,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 33 [2018-11-23 11:39:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:01,004 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-23 11:39:01,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:39:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 11:39:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:39:01,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:01,005 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:01,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:01,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -718603420, now seen corresponding path program 3 times [2018-11-23 11:39:01,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:01,006 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:39:01,027 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:39:01,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 11:39:01,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:01,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:01,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {2459#true} call ULTIMATE.init(); {2459#true} is VALID [2018-11-23 11:39:01,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {2459#true} assume true; {2459#true} is VALID [2018-11-23 11:39:01,289 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2459#true} {2459#true} #40#return; {2459#true} is VALID [2018-11-23 11:39:01,289 INFO L256 TraceCheckUtils]: 3: Hoare triple {2459#true} call #t~ret3 := main(); {2459#true} is VALID [2018-11-23 11:39:01,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {2459#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2476#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:39:01,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {2476#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, ~n~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} ~x~0 := ~bvadd32(1bv32, ~x~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume !!~bvslt32(~x~0, ~n~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} ~x~0 := ~bvadd32(1bv32, ~x~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume !!~bvslt32(~x~0, ~n~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} ~x~0 := ~bvadd32(1bv32, ~x~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume !!~bvslt32(~x~0, ~n~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} ~x~0 := ~bvadd32(1bv32, ~x~0); {2480#(bvslt (_ bv0 32) main_~n~0)} is VALID [2018-11-23 11:39:01,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {2480#(bvslt (_ bv0 32) main_~n~0)} assume !!~bvslt32(~x~0, ~n~0); {2517#(and (bvslt main_~x~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {2517#(and (bvslt main_~x~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,314 INFO L273 TraceCheckUtils]: 24: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~x~0, ~n~0); {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,316 INFO L256 TraceCheckUtils]: 30: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {2459#true} is VALID [2018-11-23 11:39:01,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {2459#true} ~cond := #in~cond; {2459#true} is VALID [2018-11-23 11:39:01,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {2459#true} assume !(0bv32 == ~cond); {2459#true} is VALID [2018-11-23 11:39:01,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {2459#true} assume true; {2459#true} is VALID [2018-11-23 11:39:01,317 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2459#true} {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} #44#return; {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:39:01,318 INFO L256 TraceCheckUtils]: 35: Hoare triple {2521#(and (bvslt main_~m~0 main_~n~0) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {2573#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,318 INFO L273 TraceCheckUtils]: 36: Hoare triple {2573#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2577#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {2577#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2460#false} is VALID [2018-11-23 11:39:01,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {2460#false} assume !false; {2460#false} is VALID [2018-11-23 11:39:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 11:39:01,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:01,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {2460#false} assume !false; {2460#false} is VALID [2018-11-23 11:39:01,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {2587#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2460#false} is VALID [2018-11-23 11:39:01,459 INFO L273 TraceCheckUtils]: 36: Hoare triple {2591#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2587#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:39:01,460 INFO L256 TraceCheckUtils]: 35: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvslt32(~m~0, ~n~0) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {2591#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:39:01,461 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2459#true} {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} #44#return; {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {2459#true} assume true; {2459#true} is VALID [2018-11-23 11:39:01,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {2459#true} assume !(0bv32 == ~cond); {2459#true} is VALID [2018-11-23 11:39:01,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {2459#true} ~cond := #in~cond; {2459#true} is VALID [2018-11-23 11:39:01,462 INFO L256 TraceCheckUtils]: 30: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~m~0, 0bv32) || ~bvsle32(~n~0, 0bv32) then 1bv32 else 0bv32)); {2459#true} is VALID [2018-11-23 11:39:01,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !~bvslt32(~x~0, ~n~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} assume !!~bvslt32(~x~0, ~n~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} ~x~0 := ~bvadd32(1bv32, ~x~0); {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {2647#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)))} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2595#(or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0))} is VALID [2018-11-23 11:39:01,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {2459#true} assume !!~bvslt32(~x~0, ~n~0); {2647#(or (bvslt main_~x~0 main_~n~0) (bvsle main_~n~0 (_ bv0 32)))} is VALID [2018-11-23 11:39:01,476 INFO L273 TraceCheckUtils]: 16: Hoare triple {2459#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {2459#true} is VALID [2018-11-23 11:39:01,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {2459#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2459#true} is VALID [2018-11-23 11:39:01,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {2459#true} assume !!~bvslt32(~x~0, ~n~0); {2459#true} is VALID [2018-11-23 11:39:01,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {2459#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {2459#true} is VALID [2018-11-23 11:39:01,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {2459#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#true} assume !!~bvslt32(~x~0, ~n~0); {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {2459#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {2459#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {2459#true} assume !!~bvslt32(~x~0, ~n~0); {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {2459#true} ~x~0 := ~bvadd32(1bv32, ~x~0); {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {2459#true} assume 0bv32 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {2459#true} is VALID [2018-11-23 11:39:01,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {2459#true} assume !!~bvslt32(~x~0, ~n~0); {2459#true} is VALID [2018-11-23 11:39:01,479 INFO L273 TraceCheckUtils]: 4: Hoare triple {2459#true} ~x~0 := 0bv32;~m~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2459#true} is VALID [2018-11-23 11:39:01,479 INFO L256 TraceCheckUtils]: 3: Hoare triple {2459#true} call #t~ret3 := main(); {2459#true} is VALID [2018-11-23 11:39:01,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2459#true} {2459#true} #40#return; {2459#true} is VALID [2018-11-23 11:39:01,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {2459#true} assume true; {2459#true} is VALID [2018-11-23 11:39:01,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {2459#true} call ULTIMATE.init(); {2459#true} is VALID [2018-11-23 11:39:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 11:39:01,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:01,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:39:01,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:39:01,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:01,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:39:01,550 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:39:01,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:39:01,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:39:01,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:39:01,551 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 12 states. [2018-11-23 11:39:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,093 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 11:39:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:39:02,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:39:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:39:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 11:39:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:39:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 11:39:02,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2018-11-23 11:39:02,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:02,124 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:39:02,124 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:39:02,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:39:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:39:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:39:02,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:02,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:02,125 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:02,125 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,126 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:39:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:02,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:02,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:02,126 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:02,126 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:02,127 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:39:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:02,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:02,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:02,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:02,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:39:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:39:02,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-23 11:39:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:02,128 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:39:02,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:39:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:02,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:02,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:39:02,289 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-11-23 11:39:02,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:39:02,452 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2018-11-23 11:39:02,642 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 13 [2018-11-23 11:39:02,870 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 13 [2018-11-23 11:39:02,981 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:39:02,982 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (or (and (or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0)) (and (bvsge main_~m~0 (_ bv0 32)) (bvsge main_~x~0 (_ bv0 32)))) (= main_~m~0 (_ bv0 32))) [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 17) no Hoare annotation was computed. [2018-11-23 11:39:02,982 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-23 11:39:02,983 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 19) the Hoare annotation is: (or (and (= main_~x~0 (_ bv0 32)) (= main_~m~0 (_ bv0 32))) (and (and (bvsge main_~m~0 (_ bv0 32)) (bvsge main_~x~0 (_ bv0 32))) (bvslt main_~m~0 main_~n~0))) [2018-11-23 11:39:02,983 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 19) the Hoare annotation is: (or (and (or (bvsle main_~n~0 (_ bv0 32)) (bvslt main_~m~0 main_~n~0)) (and (bvsge main_~m~0 (_ bv0 32)) (bvsge main_~x~0 (_ bv0 32)))) (= main_~m~0 (_ bv0 32))) [2018-11-23 11:39:02,983 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:39:02,983 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:39:02,983 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:39:02,983 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:39:02,983 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:39:02,983 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:39:02,985 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:39:02,988 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:39:02,989 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:39:02,989 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:39:02,990 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:39:02,991 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:39:02,991 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:39:03,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:39:03 BoogieIcfgContainer [2018-11-23 11:39:03,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:39:03,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:39:03,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:39:03,002 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:39:03,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:42" (3/4) ... [2018-11-23 11:39:03,006 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:39:03,013 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:39:03,013 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:39:03,013 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:39:03,019 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:39:03,019 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:39:03,021 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:39:03,065 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/gj2007b_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 11:39:03,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:39:03,067 INFO L168 Benchmark]: Toolchain (without parser) took 21180.87 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -887.9 MB). Peak memory consumption was 143.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:03,068 INFO L168 Benchmark]: CDTParser took 0.23 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:39:03,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:03,069 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.51 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:39:03,070 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 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:39:03,070 INFO L168 Benchmark]: RCFGBuilder took 542.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:03,071 INFO L168 Benchmark]: TraceAbstraction took 20156.40 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 310.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -141.1 MB). Peak memory consumption was 169.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:03,072 INFO L168 Benchmark]: Witness Printer took 63.69 ms. Allocated memory is still 2.6 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:39:03,076 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.51 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.55 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 542.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20156.40 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 310.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -141.1 MB). Peak memory consumption was 169.3 MB. Max. memory is 7.1 GB. * Witness Printer took 63.69 ms. Allocated memory is still 2.6 GB. Free memory is still 2.3 GB. There was no memory consumed. 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: 14]: Loop Invariant Derived loop invariant: (x == 0bv32 && m == 0bv32) || ((~bvsge32(m, 0bv32) && ~bvsge32(x, 0bv32)) && ~bvslt32(m, n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 20.0s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 224 SDslu, 813 SDs, 0 SdLazy, 1081 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, 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.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 113 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 29 PreInvPairs, 56 NumberOfFragments, 62 HoareAnnotationTreeSize, 29 FomulaSimplifications, 5301 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1263 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 37646 SizeOfPredicates, 23 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 253/382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...