java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:16:38,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:16:38,865 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:16:38,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:16:38,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:16:38,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:16:38,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:16:38,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:16:38,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:16:38,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:16:38,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:16:38,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:16:38,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:16:38,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:16:38,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:16:38,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:16:38,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:16:38,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:16:38,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:16:38,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:16:38,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:16:38,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:16:38,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:16:38,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:16:38,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:16:38,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:16:38,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:16:38,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:16:38,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:16:38,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:16:38,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:16:38,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:16:38,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:16:38,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:16:38,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:16:38,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:16:38,909 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:16:38,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:16:38,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:16:38,934 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:16:38,934 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:16:38,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:16:38,935 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:16:38,935 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:16:38,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:16:38,935 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:16:38,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:16:38,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:16:38,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:16:38,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:16:38,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:16:38,936 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:16:38,937 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:16:38,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:16:38,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:16:38,937 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:16:38,937 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:16:38,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:16:38,939 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:16:38,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:16:38,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:16:38,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:16:38,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:16:38,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:16:38,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:16:38,941 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:16:38,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:16:38,941 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:16:38,941 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:16:38,941 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:16:38,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:16:39,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:16:39,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:16:39,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:16:39,023 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:16:39,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i [2018-11-18 22:16:39,088 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10862ef7a/5551e2ae5a0a4ffea57f696a55e17bd6/FLAGf76310dc4 [2018-11-18 22:16:39,591 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:16:39,592 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i [2018-11-18 22:16:39,601 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10862ef7a/5551e2ae5a0a4ffea57f696a55e17bd6/FLAGf76310dc4 [2018-11-18 22:16:39,948 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10862ef7a/5551e2ae5a0a4ffea57f696a55e17bd6 [2018-11-18 22:16:39,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:16:39,965 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:16:39,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:16:39,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:16:39,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:16:39,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:39" (1/1) ... [2018-11-18 22:16:39,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fdcf58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:39, skipping insertion in model container [2018-11-18 22:16:39,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:39" (1/1) ... [2018-11-18 22:16:39,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:16:40,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:16:40,264 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:16:40,270 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:16:40,290 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:16:40,311 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:16:40,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40 WrapperNode [2018-11-18 22:16:40,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:16:40,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:16:40,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:16:40,313 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:16:40,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... [2018-11-18 22:16:40,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:16:40,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:16:40,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:16:40,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:16:40,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:16:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:16:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:16:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:16:40,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:16:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:16:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:16:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:16:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:16:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:16:40,913 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:16:40,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:40 BoogieIcfgContainer [2018-11-18 22:16:40,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:16:40,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:16:40,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:16:40,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:16:40,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:16:39" (1/3) ... [2018-11-18 22:16:40,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128ea625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:16:40, skipping insertion in model container [2018-11-18 22:16:40,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:40" (2/3) ... [2018-11-18 22:16:40,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128ea625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:16:40, skipping insertion in model container [2018-11-18 22:16:40,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:40" (3/3) ... [2018-11-18 22:16:40,923 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_true-unreach-call_true-termination.i [2018-11-18 22:16:40,933 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:16:40,941 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:16:40,956 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:16:40,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:16:40,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:16:40,992 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:16:40,992 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:16:40,992 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:16:40,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:16:40,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:16:40,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:16:40,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:16:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 22:16:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 22:16:41,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:41,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:41,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:41,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1870586046, now seen corresponding path program 1 times [2018-11-18 22:16:41,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:41,035 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:16:41,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:16:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:41,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:41,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 22:16:41,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-18 22:16:41,222 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-18 22:16:41,223 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-18 22:16:41,223 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {22#true} is VALID [2018-11-18 22:16:41,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-18 22:16:41,231 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-18 22:16:41,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-18 22:16:41,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-18 22:16:41,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 22:16:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:41,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:16:41,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:16:41,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:16:41,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:16:41,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:41,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:16:41,291 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-18 22:16:41,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:16:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:16:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:16:41,303 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 22:16:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:41,378 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 22:16:41,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:16:41,379 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 22:16:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:16:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-18 22:16:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:16:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-18 22:16:41,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-18 22:16:41,661 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-18 22:16:41,673 INFO L225 Difference]: With dead ends: 30 [2018-11-18 22:16:41,673 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 22:16:41,677 INFO L604 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-18 22:16:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 22:16:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 22:16:41,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:41,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-18 22:16:41,784 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:16:41,784 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:16:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:41,787 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:16:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:16:41,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:41,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:41,789 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:16:41,789 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:16:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:41,792 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:16:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:16:41,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:41,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:41,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:41,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:16:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 22:16:41,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-18 22:16:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:41,797 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 22:16:41,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:16:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:16:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:16:41,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:41,799 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:41,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:41,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1861068280, now seen corresponding path program 1 times [2018-11-18 22:16:41,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:41,800 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:16:41,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:16:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:41,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:41,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-18 22:16:41,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-18 22:16:41,987 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #33#return; {138#true} is VALID [2018-11-18 22:16:41,988 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret1 := main(); {138#true} is VALID [2018-11-18 22:16:42,005 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:16:42,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} assume true; {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:16:42,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} assume !~bvsle32(~i~0, 8bv32); {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:16:42,016 INFO L256 TraceCheckUtils]: 7: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {165#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:42,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {165#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {169#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:42,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {139#false} is VALID [2018-11-18 22:16:42,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-18 22:16:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:42,020 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:16:42,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:16:42,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:16:42,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 22:16:42,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:42,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:16:42,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:42,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:16:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:16:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:16:42,121 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2018-11-18 22:16:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:42,403 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:16:42,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:16:42,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 22:16:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:16:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 22:16:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:16:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 22:16:42,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-11-18 22:16:42,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:42,471 INFO L225 Difference]: With dead ends: 20 [2018-11-18 22:16:42,472 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 22:16:42,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:16:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 22:16:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 22:16:42,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:42,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-18 22:16:42,485 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 22:16:42,485 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 22:16:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:42,487 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 22:16:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:16:42,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:42,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:42,488 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 22:16:42,488 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 22:16:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:42,490 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 22:16:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:16:42,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:42,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:42,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:42,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:16:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 22:16:42,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-18 22:16:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:42,494 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 22:16:42,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:16:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:16:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:16:42,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:42,496 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:42,496 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:42,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 996352094, now seen corresponding path program 1 times [2018-11-18 22:16:42,497 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:42,497 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-18 22:16:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:16:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:42,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:42,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2018-11-18 22:16:42,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2018-11-18 22:16:42,695 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #33#return; {260#true} is VALID [2018-11-18 22:16:42,695 INFO L256 TraceCheckUtils]: 3: Hoare triple {260#true} call #t~ret1 := main(); {260#true} is VALID [2018-11-18 22:16:42,697 INFO L273 TraceCheckUtils]: 4: Hoare triple {260#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {277#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:42,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {277#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {277#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:42,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {277#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:42,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {277#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {287#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:42,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(= (_ bv2 32) main_~i~0)} assume true; {287#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:42,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {287#(= (_ bv2 32) main_~i~0)} assume !~bvsle32(~i~0, 8bv32); {261#false} is VALID [2018-11-18 22:16:42,719 INFO L256 TraceCheckUtils]: 10: Hoare triple {261#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {261#false} is VALID [2018-11-18 22:16:42,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2018-11-18 22:16:42,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {261#false} assume 0bv32 == ~cond; {261#false} is VALID [2018-11-18 22:16:42,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {261#false} assume !false; {261#false} is VALID [2018-11-18 22:16:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:42,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:43,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {261#false} assume !false; {261#false} is VALID [2018-11-18 22:16:43,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {261#false} assume 0bv32 == ~cond; {261#false} is VALID [2018-11-18 22:16:43,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2018-11-18 22:16:43,118 INFO L256 TraceCheckUtils]: 10: Hoare triple {261#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {261#false} is VALID [2018-11-18 22:16:43,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {318#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {261#false} is VALID [2018-11-18 22:16:43,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(bvsle main_~i~0 (_ bv8 32))} assume true; {318#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:16:43,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {318#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:16:43,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {325#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:43,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {325#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume true; {325#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:43,122 INFO L273 TraceCheckUtils]: 4: Hoare triple {260#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {325#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:43,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {260#true} call #t~ret1 := main(); {260#true} is VALID [2018-11-18 22:16:43,123 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #33#return; {260#true} is VALID [2018-11-18 22:16:43,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2018-11-18 22:16:43,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2018-11-18 22:16:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:43,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:43,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 22:16:43,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 22:16:43,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:43,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:16:43,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:43,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:16:43,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:16:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:16:43,238 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-11-18 22:16:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:43,434 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-18 22:16:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:16:43,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 22:16:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:16:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-18 22:16:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:16:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-18 22:16:43,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2018-11-18 22:16:43,573 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-18 22:16:43,574 INFO L225 Difference]: With dead ends: 29 [2018-11-18 22:16:43,575 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 22:16:43,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:16:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 22:16:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 22:16:43,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:43,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-18 22:16:43,589 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:16:43,589 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:16:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:43,592 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-18 22:16:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:16:43,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:43,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:43,593 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:16:43,593 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:16:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:43,596 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-18 22:16:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:16:43,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:43,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:43,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:43,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:16:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-18 22:16:43,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2018-11-18 22:16:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:43,600 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-18 22:16:43,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:16:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:16:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:16:43,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:43,601 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:43,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:43,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1082772872, now seen corresponding path program 2 times [2018-11-18 22:16:43,602 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:43,602 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-18 22:16:43,619 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:16:43,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:16:43,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:43,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:43,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {476#true} call ULTIMATE.init(); {476#true} is VALID [2018-11-18 22:16:43,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {476#true} assume true; {476#true} is VALID [2018-11-18 22:16:43,842 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {476#true} {476#true} #33#return; {476#true} is VALID [2018-11-18 22:16:43,843 INFO L256 TraceCheckUtils]: 3: Hoare triple {476#true} call #t~ret1 := main(); {476#true} is VALID [2018-11-18 22:16:43,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {476#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {493#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {493#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {493#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {493#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {493#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,848 INFO L273 TraceCheckUtils]: 7: Hoare triple {493#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {503#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:43,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {503#(= (_ bv2 32) main_~i~0)} assume true; {503#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:43,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {503#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {503#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:43,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {503#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {513#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {513#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {513#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {523#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:16:43,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {523#(= (_ bv4 32) main_~i~0)} assume true; {523#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:16:43,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {523#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {523#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:16:43,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {523#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {533#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {533#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {533#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:43,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {533#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsle32(~i~0, 8bv32); {477#false} is VALID [2018-11-18 22:16:43,867 INFO L256 TraceCheckUtils]: 19: Hoare triple {477#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {477#false} is VALID [2018-11-18 22:16:43,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {477#false} ~cond := #in~cond; {477#false} is VALID [2018-11-18 22:16:43,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {477#false} assume 0bv32 == ~cond; {477#false} is VALID [2018-11-18 22:16:43,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {477#false} assume !false; {477#false} is VALID [2018-11-18 22:16:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:43,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:44,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {477#false} assume !false; {477#false} is VALID [2018-11-18 22:16:44,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {477#false} assume 0bv32 == ~cond; {477#false} is VALID [2018-11-18 22:16:44,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {477#false} ~cond := #in~cond; {477#false} is VALID [2018-11-18 22:16:44,359 INFO L256 TraceCheckUtils]: 19: Hoare triple {477#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {477#false} is VALID [2018-11-18 22:16:44,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {564#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {477#false} is VALID [2018-11-18 22:16:44,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {564#(bvsle main_~i~0 (_ bv8 32))} assume true; {564#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:16:44,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {564#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-18 22:16:44,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {571#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume true; {571#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {581#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {571#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {581#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {581#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {581#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume true; {581#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {591#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {581#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {591#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {591#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {591#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume true; {591#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {601#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {591#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {601#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {601#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {601#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume true; {601#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,378 INFO L273 TraceCheckUtils]: 4: Hoare triple {476#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {601#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-18 22:16:44,378 INFO L256 TraceCheckUtils]: 3: Hoare triple {476#true} call #t~ret1 := main(); {476#true} is VALID [2018-11-18 22:16:44,378 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {476#true} {476#true} #33#return; {476#true} is VALID [2018-11-18 22:16:44,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {476#true} assume true; {476#true} is VALID [2018-11-18 22:16:44,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {476#true} call ULTIMATE.init(); {476#true} is VALID [2018-11-18 22:16:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:44,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:44,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 22:16:44,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-18 22:16:44,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:44,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:16:44,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:44,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:16:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:16:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:16:44,463 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-11-18 22:16:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:44,916 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-18 22:16:44,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:16:44,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-18 22:16:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:16:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-18 22:16:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:16:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-18 22:16:44,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2018-11-18 22:16:45,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:45,007 INFO L225 Difference]: With dead ends: 41 [2018-11-18 22:16:45,009 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 22:16:45,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:16:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 22:16:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 22:16:45,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:45,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-18 22:16:45,033 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-18 22:16:45,033 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-18 22:16:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:45,036 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-18 22:16:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-18 22:16:45,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:45,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:45,037 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-18 22:16:45,037 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-18 22:16:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:45,040 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-18 22:16:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-18 22:16:45,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:45,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:45,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:45,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:16:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-18 22:16:45,044 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-11-18 22:16:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:45,045 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-18 22:16:45,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:16:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-18 22:16:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:16:45,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:45,047 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:45,047 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:45,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1829764856, now seen corresponding path program 3 times [2018-11-18 22:16:45,048 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:45,048 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-18 22:16:45,069 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 22:16:45,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-18 22:16:45,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:45,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:45,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {810#true} call ULTIMATE.init(); {810#true} is VALID [2018-11-18 22:16:45,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {810#true} assume true; {810#true} is VALID [2018-11-18 22:16:45,561 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {810#true} {810#true} #33#return; {810#true} is VALID [2018-11-18 22:16:45,562 INFO L256 TraceCheckUtils]: 3: Hoare triple {810#true} call #t~ret1 := main(); {810#true} is VALID [2018-11-18 22:16:45,562 INFO L273 TraceCheckUtils]: 4: Hoare triple {810#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {827#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#(= (_ bv0 32) main_~sn~0)} assume true; {827#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {827#(= (_ bv0 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {834#(= (_ bv2 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {834#(= (_ bv2 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {834#(= (_ bv2 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {834#(= (_ bv2 32) main_~sn~0)} assume true; {834#(= (_ bv2 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {834#(= (_ bv2 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {844#(= (_ bv4 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {844#(= (_ bv4 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {844#(= (_ bv4 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {844#(= (_ bv4 32) main_~sn~0)} assume true; {844#(= (_ bv4 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {844#(= (_ bv4 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {854#(= (_ bv6 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {854#(= (_ bv6 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {854#(= (_ bv6 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {854#(= (_ bv6 32) main_~sn~0)} assume true; {854#(= (_ bv6 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {854#(= (_ bv6 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {864#(= (_ bv8 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#(= (_ bv8 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {864#(= (_ bv8 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {864#(= (_ bv8 32) main_~sn~0)} assume true; {864#(= (_ bv8 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {864#(= (_ bv8 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {874#(= (_ bv10 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {874#(= (_ bv10 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {874#(= (_ bv10 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {874#(= (_ bv10 32) main_~sn~0)} assume true; {874#(= (_ bv10 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {874#(= (_ bv10 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {884#(= (_ bv12 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {884#(= (_ bv12 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {884#(= (_ bv12 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {884#(= (_ bv12 32) main_~sn~0)} assume true; {884#(= (_ bv12 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {884#(= (_ bv12 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {894#(= (_ bv14 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {894#(= (_ bv14 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {894#(= (_ bv14 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {894#(= (_ bv14 32) main_~sn~0)} assume true; {894#(= (_ bv14 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {894#(= (_ bv14 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {904#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {904#(= (_ bv16 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {904#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {904#(= (_ bv16 32) main_~sn~0)} assume true; {904#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {904#(= (_ bv16 32) main_~sn~0)} assume !~bvsle32(~i~0, 8bv32); {904#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-18 22:16:45,606 INFO L256 TraceCheckUtils]: 31: Hoare triple {904#(= (_ bv16 32) main_~sn~0)} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {917#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:45,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {917#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {921#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:45,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {921#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {811#false} is VALID [2018-11-18 22:16:45,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {811#false} assume !false; {811#false} is VALID [2018-11-18 22:16:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:45,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:46,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {811#false} assume !false; {811#false} is VALID [2018-11-18 22:16:46,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {931#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {811#false} is VALID [2018-11-18 22:16:46,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {935#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {931#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:16:46,016 INFO L256 TraceCheckUtils]: 31: Hoare triple {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {935#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:16:46,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} assume !~bvsle32(~i~0, 8bv32); {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} assume true; {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {952#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {939#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {952#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} assume true; {952#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {952#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {952#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {962#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {952#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {962#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} assume true; {962#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {962#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {962#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {972#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {962#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {972#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} assume true; {972#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {972#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {972#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {982#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {972#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {982#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} assume true; {982#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {982#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {982#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {992#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {982#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {992#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} assume true; {992#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {992#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {992#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {1002#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {992#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {1002#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} assume true; {1002#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {1002#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1002#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {1012#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1002#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {1012#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} assume true; {1012#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {1012#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1012#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {1022#(or (= (_ bv0 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv16 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1012#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-18 22:16:46,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#(or (= (_ bv0 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv16 32)) (_ bv0 32)))} assume true; {1022#(or (= (_ bv0 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv16 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,044 INFO L273 TraceCheckUtils]: 4: Hoare triple {810#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {1022#(or (= (_ bv0 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv16 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:46,044 INFO L256 TraceCheckUtils]: 3: Hoare triple {810#true} call #t~ret1 := main(); {810#true} is VALID [2018-11-18 22:16:46,045 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {810#true} {810#true} #33#return; {810#true} is VALID [2018-11-18 22:16:46,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {810#true} assume true; {810#true} is VALID [2018-11-18 22:16:46,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {810#true} call ULTIMATE.init(); {810#true} is VALID [2018-11-18 22:16:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:46,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:46,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-18 22:16:46,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-18 22:16:46,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:46,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:16:46,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:46,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:16:46,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:16:46,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:16:46,192 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 24 states. [2018-11-18 22:16:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:47,173 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-18 22:16:47,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:16:47,174 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-18 22:16:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:16:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2018-11-18 22:16:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:16:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2018-11-18 22:16:47,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2018-11-18 22:16:47,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:47,247 INFO L225 Difference]: With dead ends: 44 [2018-11-18 22:16:47,247 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 22:16:47,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:16:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 22:16:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 22:16:47,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:47,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:47,271 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:47,271 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:47,274 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-18 22:16:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 22:16:47,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:47,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:47,275 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:47,275 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:47,278 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-18 22:16:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 22:16:47,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:47,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:47,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:47,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:16:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-18 22:16:47,281 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-11-18 22:16:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:47,282 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-18 22:16:47,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:16:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-18 22:16:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 22:16:47,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:47,284 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:47,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:47,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 443950942, now seen corresponding path program 4 times [2018-11-18 22:16:47,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:47,285 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-18 22:16:47,308 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:16:47,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:16:47,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:47,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:47,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-18 22:16:47,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-18 22:16:47,621 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #33#return; {1240#true} is VALID [2018-11-18 22:16:47,621 INFO L256 TraceCheckUtils]: 3: Hoare triple {1240#true} call #t~ret1 := main(); {1240#true} is VALID [2018-11-18 22:16:47,622 INFO L273 TraceCheckUtils]: 4: Hoare triple {1240#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {1257#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {1257#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1257#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {1257#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1257#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {1257#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1267#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:47,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {1267#(= (_ bv2 32) main_~i~0)} assume true; {1267#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:47,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {1267#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1267#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 22:16:47,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {1267#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {1277#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1287#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:16:47,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {1287#(= (_ bv4 32) main_~i~0)} assume true; {1287#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:16:47,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {1287#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1287#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 22:16:47,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {1287#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1297#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {1297#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1297#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {1297#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1297#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {1297#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1307#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 22:16:47,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {1307#(= (_ bv6 32) main_~i~0)} assume true; {1307#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 22:16:47,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {1307#(= (_ bv6 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1307#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 22:16:47,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {1307#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1317#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {1317#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1317#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {1317#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1317#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {1317#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1327#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 22:16:47,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {1327#(= (_ bv8 32) main_~i~0)} assume true; {1327#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 22:16:47,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {1327#(= (_ bv8 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1327#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 22:16:47,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {1327#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1337#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {1337#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1337#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:47,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {1337#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1241#false} is VALID [2018-11-18 22:16:47,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {1241#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1241#false} is VALID [2018-11-18 22:16:47,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {1241#false} assume true; {1241#false} is VALID [2018-11-18 22:16:47,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {1241#false} assume !~bvsle32(~i~0, 8bv32); {1241#false} is VALID [2018-11-18 22:16:47,642 INFO L256 TraceCheckUtils]: 34: Hoare triple {1241#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1241#false} is VALID [2018-11-18 22:16:47,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-18 22:16:47,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {1241#false} assume 0bv32 == ~cond; {1241#false} is VALID [2018-11-18 22:16:47,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-18 22:16:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:47,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:48,036 INFO L273 TraceCheckUtils]: 37: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-18 22:16:48,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {1241#false} assume 0bv32 == ~cond; {1241#false} is VALID [2018-11-18 22:16:48,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-18 22:16:48,037 INFO L256 TraceCheckUtils]: 34: Hoare triple {1241#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1241#false} is VALID [2018-11-18 22:16:48,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {1241#false} assume !~bvsle32(~i~0, 8bv32); {1241#false} is VALID [2018-11-18 22:16:48,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {1241#false} assume true; {1241#false} is VALID [2018-11-18 22:16:48,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {1241#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1241#false} is VALID [2018-11-18 22:16:48,039 INFO L273 TraceCheckUtils]: 30: Hoare triple {1386#(not (bvsle main_~i~0 (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1241#false} is VALID [2018-11-18 22:16:48,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {1386#(not (bvsle main_~i~0 (_ bv8 32)))} assume true; {1386#(not (bvsle main_~i~0 (_ bv8 32)))} is VALID [2018-11-18 22:16:48,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {1393#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1386#(not (bvsle main_~i~0 (_ bv8 32)))} is VALID [2018-11-18 22:16:48,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {1393#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1393#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {1393#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} assume true; {1393#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {1403#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1393#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {1403#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1403#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {1403#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} assume true; {1403#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {1413#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1403#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {1413#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1413#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {1413#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} assume true; {1413#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {1423#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1413#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {1423#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1423#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {1423#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} assume true; {1423#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {1433#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1423#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {1433#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1433#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {1433#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} assume true; {1433#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {1443#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1433#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {1443#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1443#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} assume true; {1443#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {1453#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1443#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {1453#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1453#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {1453#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} assume true; {1453#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {1463#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1453#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {1463#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1463#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {1463#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} assume true; {1463#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {1240#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {1463#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} is VALID [2018-11-18 22:16:48,113 INFO L256 TraceCheckUtils]: 3: Hoare triple {1240#true} call #t~ret1 := main(); {1240#true} is VALID [2018-11-18 22:16:48,114 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #33#return; {1240#true} is VALID [2018-11-18 22:16:48,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-18 22:16:48,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-18 22:16:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:48,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-18 22:16:48,125 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-11-18 22:16:48,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:48,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:16:48,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:48,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:16:48,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:16:48,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:16:48,294 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-11-18 22:16:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:49,266 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-18 22:16:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:16:49,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-11-18 22:16:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:16:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2018-11-18 22:16:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:16:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2018-11-18 22:16:49,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2018-11-18 22:16:49,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:49,343 INFO L225 Difference]: With dead ends: 39 [2018-11-18 22:16:49,343 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 22:16:49,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:16:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 22:16:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 22:16:49,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:49,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 22:16:49,345 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:16:49,345 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:16:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:49,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:16:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:16:49,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:49,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:49,346 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:16:49,346 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:16:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:49,347 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:16:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:16:49,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:49,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:49,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:49,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 22:16:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 22:16:49,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-11-18 22:16:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:49,348 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 22:16:49,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:16:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:16:49,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:49,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 22:16:50,010 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-18 22:16:50,029 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 22:16:50,029 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:16:50,029 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:16:50,030 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 22:16:50,030 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 22:16:50,030 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 22:16:50,030 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2018-11-18 22:16:50,030 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2018-11-18 22:16:50,030 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2018-11-18 22:16:50,030 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-11-18 22:16:50,030 INFO L425 ceAbstractionStarter]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2018-11-18 22:16:50,031 INFO L421 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (or (and (= (_ bv14 32) main_~sn~0) (= (_ bv8 32) main_~i~0)) (and (= (_ bv6 32) main_~i~0) (= (_ bv10 32) main_~sn~0)) (and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv8 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (_ bv16 32) main_~sn~0)) (and (= (_ bv12 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0)) (and (= (_ bv6 32) main_~sn~0) (= (_ bv4 32) main_~i~0)) (and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))) [2018-11-18 22:16:50,031 INFO L421 ceAbstractionStarter]: At program point L13-5(lines 13 15) the Hoare annotation is: (or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0)) [2018-11-18 22:16:50,031 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 22:16:50,031 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:16:50,031 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 22:16:50,031 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 22:16:50,032 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 22:16:50,032 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:16:50,033 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:16:50,052 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:16:50,052 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:16:50,052 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:16:50,052 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-18 22:16:50,067 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:16:50,067 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:16:50,067 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:16:50,067 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-18 22:16:50,067 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:16:50,068 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:16:50,068 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:16:50,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:16:50 BoogieIcfgContainer [2018-11-18 22:16:50,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:16:50,083 INFO L168 Benchmark]: Toolchain (without parser) took 10118.89 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 843.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -869.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 22:16:50,084 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 22:16:50,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 22:16:50,085 INFO L168 Benchmark]: Boogie Preprocessor took 34.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 22:16:50,086 INFO L168 Benchmark]: RCFGBuilder took 566.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-18 22:16:50,087 INFO L168 Benchmark]: TraceAbstraction took 9166.21 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 139.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -127.0 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2018-11-18 22:16:50,091 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.81 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 566.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9166.21 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 139.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -127.0 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((14bv32 == sn && 8bv32 == i) || (6bv32 == i && 10bv32 == sn)) || (0bv32 == sn && ~bvadd64(i, 4294967295bv32) == 0bv32)) || (8bv32 == sn && ~bvadd64(i, 4294967291bv32) == 0bv32)) || (~bvadd64(i, 4294967287bv32) == 0bv32 && 16bv32 == sn)) || (12bv32 == sn && ~bvadd64(i, 4294967289bv32) == 0bv32)) || (2bv32 == sn && 2bv32 == i)) || (6bv32 == sn && 4bv32 == i)) || (~bvadd64(i, 4294967293bv32) == 0bv32 && 4bv32 == sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 9.0s OverallTime, 6 OverallIterations, 10 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 97 SDtfs, 17 SDslu, 600 SDs, 0 SdLazy, 419 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 86 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 25803 SizeOfPredicates, 7 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 52/508 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...