java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:17,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:17,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:17,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:17,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:17,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:17,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:17,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:17,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:17,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:17,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:17,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:17,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:17,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:17,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:17,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:17,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:17,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:17,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:17,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:17,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:17,891 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:17,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:17,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:17,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:17,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:17,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:17,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:17,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:17,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:17,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:17,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:17,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:17,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:17,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:17,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:17,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:12:17,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:17,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:17,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:17,920 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:17,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:17,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:17,921 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:17,921 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:17,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:17,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:17,922 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:17,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:17,922 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:17,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:17,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:17,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:17,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:17,926 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:17,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:17,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:17,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:17,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:17,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:17,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:17,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:17,929 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:17,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:17,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:17,929 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:17,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:17,930 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:17,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:18,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:18,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:18,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:18,016 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:18,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-23 13:12:18,072 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32afe23c4/4d45c5bfcf034e2e90c1760538881d85/FLAG236c6ac37 [2018-11-23 13:12:18,545 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:18,546 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-23 13:12:18,552 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32afe23c4/4d45c5bfcf034e2e90c1760538881d85/FLAG236c6ac37 [2018-11-23 13:12:18,898 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32afe23c4/4d45c5bfcf034e2e90c1760538881d85 [2018-11-23 13:12:18,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:18,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:18,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:18,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:18,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:18,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:18" (1/1) ... [2018-11-23 13:12:18,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7179bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:18, skipping insertion in model container [2018-11-23 13:12:18,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:18" (1/1) ... [2018-11-23 13:12:18,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:18,961 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:19,164 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:19,170 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:19,189 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:19,206 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:19,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19 WrapperNode [2018-11-23 13:12:19,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:19,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:19,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:19,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:19,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:19,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:19,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:19,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:19,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:19,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:19,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:19,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:19,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:19,881 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:19,882 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:19,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:19 BoogieIcfgContainer [2018-11-23 13:12:19,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:19,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:19,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:19,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:18" (1/3) ... [2018-11-23 13:12:19,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6f13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:19, skipping insertion in model container [2018-11-23 13:12:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (2/3) ... [2018-11-23 13:12:19,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6f13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:19, skipping insertion in model container [2018-11-23 13:12:19,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:19" (3/3) ... [2018-11-23 13:12:19,891 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005_true-unreach-call_true-termination.c.i [2018-11-23 13:12:19,899 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:19,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:19,925 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:19,956 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:19,956 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:19,957 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:19,957 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:19,958 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:19,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:19,958 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:19,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:19,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:12:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:19,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:19,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:19,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:19,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:19,996 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-11-23 13:12:19,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:19,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:12:20,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:12:20,256 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-23 13:12:20,257 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 13:12:20,270 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {23#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-23 13:12:20,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#(<= (+ main_~i~0 9) main_~j~0)} assume !(~j~0 >= ~i~0); {22#false} is VALID [2018-11-23 13:12:20,273 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {22#false} is VALID [2018-11-23 13:12:20,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:12:20,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:12:20,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:12:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:20,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:20,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:20,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:12:20,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:20,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:20,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:20,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:20,347 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-23 13:12:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,501 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:12:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:20,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:12:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 13:12:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 13:12:20,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 13:12:20,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:20,895 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:12:20,896 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:12:20,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:12:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:12:20,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:20,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,967 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,967 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,971 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:20,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:20,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:20,972 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,972 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:20,977 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:20,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:20,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:20,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:20,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:12:20,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:12:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:20,986 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:12:20,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:20,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:20,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:20,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:20,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash -429188558, now seen corresponding path program 1 times [2018-11-23 13:12:20,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:20,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:20,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:21,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:12:21,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:12:21,112 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #32#return; {111#true} is VALID [2018-11-23 13:12:21,112 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret1 := main(); {111#true} is VALID [2018-11-23 13:12:21,114 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {113#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-23 13:12:21,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {114#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2018-11-23 13:12:21,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {114#(<= (+ main_~i~0 6) main_~j~0)} assume !(~j~0 >= ~i~0); {112#false} is VALID [2018-11-23 13:12:21,116 INFO L256 TraceCheckUtils]: 7: Hoare triple {112#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {112#false} is VALID [2018-11-23 13:12:21,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {112#false} ~cond := #in~cond; {112#false} is VALID [2018-11-23 13:12:21,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:12:21,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:12:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:21,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:21,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:21,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:21,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:21,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:12:21,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:12:21,409 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #32#return; {111#true} is VALID [2018-11-23 13:12:21,409 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret1 := main(); {111#true} is VALID [2018-11-23 13:12:21,410 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {130#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-23 13:12:21,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {130#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {134#(and (<= main_~i~0 3) (<= 9 main_~j~0))} is VALID [2018-11-23 13:12:21,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {134#(and (<= main_~i~0 3) (<= 9 main_~j~0))} assume !(~j~0 >= ~i~0); {112#false} is VALID [2018-11-23 13:12:21,412 INFO L256 TraceCheckUtils]: 7: Hoare triple {112#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {112#false} is VALID [2018-11-23 13:12:21,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {112#false} ~cond := #in~cond; {112#false} is VALID [2018-11-23 13:12:21,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:12:21,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:12:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:21,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:21,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 13:12:21,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 13:12:21,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:21,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:21,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:21,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:21,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:21,464 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 13:12:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,628 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:12:21,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 13:12:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:12:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:12:21,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:12:21,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:21,672 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:12:21,673 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:12:21,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:12:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:12:21,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:21,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,706 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,707 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,708 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:12:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:21,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:21,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:21,709 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,709 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,711 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:12:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:21,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:21,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:21,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:21,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:12:21,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:12:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:21,714 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:12:21,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:21,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:21,716 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:21,716 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:21,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash -384405667, now seen corresponding path program 2 times [2018-11-23 13:12:21,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:21,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:21,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:21,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-23 13:12:22,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-23 13:12:22,176 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #32#return; {226#true} is VALID [2018-11-23 13:12:22,176 INFO L256 TraceCheckUtils]: 3: Hoare triple {226#true} call #t~ret1 := main(); {226#true} is VALID [2018-11-23 13:12:22,183 INFO L273 TraceCheckUtils]: 4: Hoare triple {226#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {228#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-23 13:12:22,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {228#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {229#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2018-11-23 13:12:22,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {229#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {230#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-23 13:12:22,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {230#(<= (+ main_~i~0 3) main_~j~0)} assume !(~j~0 >= ~i~0); {227#false} is VALID [2018-11-23 13:12:22,187 INFO L256 TraceCheckUtils]: 8: Hoare triple {227#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {227#false} is VALID [2018-11-23 13:12:22,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {227#false} ~cond := #in~cond; {227#false} is VALID [2018-11-23 13:12:22,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {227#false} assume 0 == ~cond; {227#false} is VALID [2018-11-23 13:12:22,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-23 13:12:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:22,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:22,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:22,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:22,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:22,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:22,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-23 13:12:22,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-23 13:12:22,486 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #32#return; {226#true} is VALID [2018-11-23 13:12:22,487 INFO L256 TraceCheckUtils]: 3: Hoare triple {226#true} call #t~ret1 := main(); {226#true} is VALID [2018-11-23 13:12:22,488 INFO L273 TraceCheckUtils]: 4: Hoare triple {226#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {246#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-23 13:12:22,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {246#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {250#(and (<= main_~i~0 3) (<= 9 main_~j~0))} is VALID [2018-11-23 13:12:22,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {250#(and (<= main_~i~0 3) (<= 9 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {254#(and (<= 8 main_~j~0) (<= main_~i~0 5))} is VALID [2018-11-23 13:12:22,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {254#(and (<= 8 main_~j~0) (<= main_~i~0 5))} assume !(~j~0 >= ~i~0); {227#false} is VALID [2018-11-23 13:12:22,512 INFO L256 TraceCheckUtils]: 8: Hoare triple {227#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {227#false} is VALID [2018-11-23 13:12:22,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {227#false} ~cond := #in~cond; {227#false} is VALID [2018-11-23 13:12:22,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {227#false} assume 0 == ~cond; {227#false} is VALID [2018-11-23 13:12:22,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-23 13:12:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:22,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 13:12:22,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-11-23 13:12:22,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:22,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:12:22,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:22,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:12:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:22,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:22,561 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-11-23 13:12:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,719 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:12:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:22,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-11-23 13:12:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:12:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:12:22,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:12:22,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:22,752 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:12:22,752 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:12:22,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:12:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:12:22,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:22,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:22,791 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:22,791 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,792 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:22,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,793 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:22,793 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,795 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:22,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:22,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:12:22,798 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:12:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:22,798 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:12:22,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:12:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:12:22,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:22,799 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:22,800 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:22,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1003863954, now seen corresponding path program 3 times [2018-11-23 13:12:22,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:22,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2018-11-23 13:12:22,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-23 13:12:22,968 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #32#return; {352#true} is VALID [2018-11-23 13:12:22,969 INFO L256 TraceCheckUtils]: 3: Hoare triple {352#true} call #t~ret1 := main(); {352#true} is VALID [2018-11-23 13:12:22,970 INFO L273 TraceCheckUtils]: 4: Hoare triple {352#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {354#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-23 13:12:22,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {354#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {355#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2018-11-23 13:12:22,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {355#(<= (+ main_~i~0 6) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {356#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-23 13:12:22,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {356#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {357#(<= main_~i~0 main_~j~0)} is VALID [2018-11-23 13:12:22,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#(<= main_~i~0 main_~j~0)} assume !(~j~0 >= ~i~0); {353#false} is VALID [2018-11-23 13:12:22,975 INFO L256 TraceCheckUtils]: 9: Hoare triple {353#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {353#false} is VALID [2018-11-23 13:12:22,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2018-11-23 13:12:22,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2018-11-23 13:12:22,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#false} assume !false; {353#false} is VALID [2018-11-23 13:12:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:22,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:22,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:22,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:12:22,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:23,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2018-11-23 13:12:23,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-23 13:12:23,233 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #32#return; {352#true} is VALID [2018-11-23 13:12:23,234 INFO L256 TraceCheckUtils]: 3: Hoare triple {352#true} call #t~ret1 := main(); {352#true} is VALID [2018-11-23 13:12:23,235 INFO L273 TraceCheckUtils]: 4: Hoare triple {352#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {373#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-23 13:12:23,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {377#(and (<= main_~i~0 3) (<= 9 main_~j~0))} is VALID [2018-11-23 13:12:23,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {377#(and (<= main_~i~0 3) (<= 9 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {381#(and (<= 8 main_~j~0) (<= main_~i~0 5))} is VALID [2018-11-23 13:12:23,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {381#(and (<= 8 main_~j~0) (<= main_~i~0 5))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {385#(and (<= 7 main_~j~0) (<= main_~i~0 7))} is VALID [2018-11-23 13:12:23,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {385#(and (<= 7 main_~j~0) (<= main_~i~0 7))} assume !(~j~0 >= ~i~0); {353#false} is VALID [2018-11-23 13:12:23,240 INFO L256 TraceCheckUtils]: 9: Hoare triple {353#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {353#false} is VALID [2018-11-23 13:12:23,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2018-11-23 13:12:23,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2018-11-23 13:12:23,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#false} assume !false; {353#false} is VALID [2018-11-23 13:12:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:23,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:23,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 13:12:23,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 13:12:23,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:23,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:12:23,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:23,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:12:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:12:23,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:23,283 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-11-23 13:12:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,423 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:12:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:23,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 13:12:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:12:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:12:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:12:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:12:23,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2018-11-23 13:12:23,467 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-23 13:12:23,468 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:12:23,468 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:12:23,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:12:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:12:23,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:23,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:23,484 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:23,484 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,486 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:12:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:23,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:23,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:23,487 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:23,487 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,489 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:12:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:23,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:23,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:23,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:23,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:12:23,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:12:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:23,492 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:12:23,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:12:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:23,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:23,493 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:23,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:23,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1090549245, now seen corresponding path program 4 times [2018-11-23 13:12:23,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:23,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2018-11-23 13:12:23,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-23 13:12:23,744 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {489#true} {489#true} #32#return; {489#true} is VALID [2018-11-23 13:12:23,745 INFO L256 TraceCheckUtils]: 3: Hoare triple {489#true} call #t~ret1 := main(); {489#true} is VALID [2018-11-23 13:12:23,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {489#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {491#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2018-11-23 13:12:23,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {491#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {492#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2018-11-23 13:12:23,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#(and (<= 9 main_~j~0) (<= main_~j~0 9))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {493#(and (<= 8 main_~j~0) (<= main_~j~0 8))} is VALID [2018-11-23 13:12:23,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {493#(and (<= 8 main_~j~0) (<= main_~j~0 8))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {494#(and (<= 7 main_~j~0) (<= main_~j~0 7))} is VALID [2018-11-23 13:12:23,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#(and (<= 7 main_~j~0) (<= main_~j~0 7))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:12:23,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} assume !(~j~0 >= ~i~0); {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:12:23,753 INFO L256 TraceCheckUtils]: 10: Hoare triple {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {496#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:23,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {496#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {497#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:23,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {497#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {490#false} is VALID [2018-11-23 13:12:23,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {490#false} assume !false; {490#false} is VALID [2018-11-23 13:12:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:23,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:23,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:23,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:12:23,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:12:23,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:23,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2018-11-23 13:12:23,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {489#true} assume true; {489#true} is VALID [2018-11-23 13:12:23,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {489#true} {489#true} #32#return; {489#true} is VALID [2018-11-23 13:12:23,909 INFO L256 TraceCheckUtils]: 3: Hoare triple {489#true} call #t~ret1 := main(); {489#true} is VALID [2018-11-23 13:12:23,909 INFO L273 TraceCheckUtils]: 4: Hoare triple {489#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {491#(and (<= main_~j~0 10) (<= 10 main_~j~0))} is VALID [2018-11-23 13:12:23,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {491#(and (<= main_~j~0 10) (<= 10 main_~j~0))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {492#(and (<= 9 main_~j~0) (<= main_~j~0 9))} is VALID [2018-11-23 13:12:23,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#(and (<= 9 main_~j~0) (<= main_~j~0 9))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {493#(and (<= 8 main_~j~0) (<= main_~j~0 8))} is VALID [2018-11-23 13:12:23,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {493#(and (<= 8 main_~j~0) (<= main_~j~0 8))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {494#(and (<= 7 main_~j~0) (<= main_~j~0 7))} is VALID [2018-11-23 13:12:23,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#(and (<= 7 main_~j~0) (<= main_~j~0 7))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:12:23,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} assume !(~j~0 >= ~i~0); {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:12:23,922 INFO L256 TraceCheckUtils]: 10: Hoare triple {495#(and (<= 6 main_~j~0) (<= main_~j~0 6))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {496#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:23,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {496#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {497#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:23,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {497#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {490#false} is VALID [2018-11-23 13:12:23,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {490#false} assume !false; {490#false} is VALID [2018-11-23 13:12:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:23,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:23,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 13:12:23,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-23 13:12:23,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:23,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:12:24,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:12:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:12:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:12:24,020 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-11-23 13:12:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,316 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:12:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:24,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-23 13:12:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 13:12:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:12:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 13:12:24,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-23 13:12:24,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,346 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:12:24,346 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:24,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:12:24,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:24,368 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:24,369 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,371 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:24,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,372 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:24,373 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,374 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:24,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:12:24,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:12:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,377 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:12:24,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:12:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:12:24,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:24,378 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:24,379 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:24,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -517174030, now seen corresponding path program 5 times [2018-11-23 13:12:24,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:24,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:24,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:24,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2018-11-23 13:12:24,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {636#true} assume true; {636#true} is VALID [2018-11-23 13:12:24,575 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {636#true} {636#true} #32#return; {636#true} is VALID [2018-11-23 13:12:24,575 INFO L256 TraceCheckUtils]: 3: Hoare triple {636#true} call #t~ret1 := main(); {636#true} is VALID [2018-11-23 13:12:24,577 INFO L273 TraceCheckUtils]: 4: Hoare triple {636#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {638#(<= main_~j~0 (+ main_~i~0 9))} is VALID [2018-11-23 13:12:24,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {638#(<= main_~j~0 (+ main_~i~0 9))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {639#(<= main_~j~0 (+ main_~i~0 6))} is VALID [2018-11-23 13:12:24,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(<= main_~j~0 (+ main_~i~0 6))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {640#(<= main_~j~0 (+ main_~i~0 3))} is VALID [2018-11-23 13:12:24,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(<= main_~j~0 (+ main_~i~0 3))} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {641#(<= main_~j~0 main_~i~0)} is VALID [2018-11-23 13:12:24,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {641#(<= main_~j~0 main_~i~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {642#(<= (+ main_~j~0 3) main_~i~0)} is VALID [2018-11-23 13:12:24,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {642#(<= (+ main_~j~0 3) main_~i~0)} assume !!(~j~0 >= ~i~0);~i~0 := 2 + ~i~0;~j~0 := -1 + ~j~0; {637#false} is VALID [2018-11-23 13:12:24,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {637#false} assume !(~j~0 >= ~i~0); {637#false} is VALID [2018-11-23 13:12:24,582 INFO L256 TraceCheckUtils]: 11: Hoare triple {637#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {637#false} is VALID [2018-11-23 13:12:24,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {637#false} ~cond := #in~cond; {637#false} is VALID [2018-11-23 13:12:24,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {637#false} assume 0 == ~cond; {637#false} is VALID [2018-11-23 13:12:24,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {637#false} assume !false; {637#false} is VALID [2018-11-23 13:12:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:24,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:24,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:12:24,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 13:12:24,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:24,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:12:24,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:12:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:12:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:24,622 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 7 states. [2018-11-23 13:12:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,684 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:24,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 13:12:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-23 13:12:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-23 13:12:24,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2018-11-23 13:12:24,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,708 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:12:24,708 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:24,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:24,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,710 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,710 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,710 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,711 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,712 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:24,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-23 13:12:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,713 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:24,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:12:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:24,877 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:24,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:24,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:24,878 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:24,878 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:24,878 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:24,878 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2018-11-23 13:12:24,878 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2018-11-23 13:12:24,878 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-23 13:12:24,878 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2018-11-23 13:12:24,879 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 17) the Hoare annotation is: (or (and (<= 8 main_~j~0) (<= main_~j~0 (+ main_~i~0 3)) (<= main_~i~0 5)) (and (<= 6 main_~j~0) (<= (+ main_~j~0 3) main_~i~0) (<= main_~j~0 6)) (and (<= main_~j~0 (+ main_~i~0 9)) (<= main_~i~0 1) (<= 10 main_~j~0)) (and (<= 7 main_~j~0) (<= main_~j~0 main_~i~0) (<= main_~i~0 7)) (and (<= main_~i~0 3) (<= main_~j~0 (+ main_~i~0 6)) (<= 9 main_~j~0))) [2018-11-23 13:12:24,879 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (and (<= 6 main_~j~0) (<= main_~j~0 6)) [2018-11-23 13:12:24,879 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:24,879 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:24,879 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:24,879 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:24,879 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:24,879 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:24,881 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:24,886 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:24,886 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:24,886 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:24,897 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:24,897 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:24,897 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:24,898 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:24,898 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:24,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:24 BoogieIcfgContainer [2018-11-23 13:12:24,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:24,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:24,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:24,910 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:24,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:19" (3/4) ... [2018-11-23 13:12:24,915 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:24,923 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:24,923 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:24,923 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:24,928 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:12:24,928 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:12:24,928 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:24,977 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:24,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:24,979 INFO L168 Benchmark]: Toolchain (without parser) took 6068.70 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -414.9 MB). Peak memory consumption was 296.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,981 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,983 INFO L168 Benchmark]: Boogie Preprocessor took 26.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,983 INFO L168 Benchmark]: RCFGBuilder took 622.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,984 INFO L168 Benchmark]: TraceAbstraction took 5025.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 332.1 MB). Peak memory consumption was 332.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:24,985 INFO L168 Benchmark]: Witness Printer took 67.46 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:24,989 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.68 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 622.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -757.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5025.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 332.1 MB). Peak memory consumption was 332.1 MB. Max. memory is 7.1 GB. * Witness Printer took 67.46 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((8 <= j && j <= i + 3) && i <= 5) || ((6 <= j && j + 3 <= i) && j <= 6)) || ((j <= i + 9 && i <= 1) && 10 <= j)) || ((7 <= j && j <= i) && i <= 7)) || ((i <= 3 && j <= i + 6) && 9 <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 1 SDslu, 152 SDs, 0 SdLazy, 93 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, 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, 18 NumberOfFragments, 71 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 3659 SizeOfPredicates, 8 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 15/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...