java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:29:54,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:29:54,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:29:54,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:29:54,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:29:54,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:29:54,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:29:54,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:29:54,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:29:54,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:29:54,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:29:54,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:29:54,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:29:54,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:29:54,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:29:54,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:29:54,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:29:54,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:29:54,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:29:54,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:29:54,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:29:54,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:29:54,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:29:54,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:29:54,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:29:54,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:29:54,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:29:54,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:29:54,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:29:54,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:29:54,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:29:54,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:29:54,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:29:54,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:29:54,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:29:54,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:29:54,150 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-14 17:29:54,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:29:54,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:29:54,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:29:54,184 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:29:54,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:29:54,185 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:29:54,185 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:29:54,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:29:54,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:29:54,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:29:54,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:29:54,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:29:54,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:29:54,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:29:54,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:29:54,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:29:54,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:29:54,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:29:54,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:29:54,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:29:54,188 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:29:54,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:29:54,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:29:54,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:29:54,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:29:54,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:29:54,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:29:54,190 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:29:54,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:29:54,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:29:54,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:29:54,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:29:54,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:29:54,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:29:54,282 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:29:54,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-14 17:29:54,354 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33613183c/e8cd2baf0abe4fd48b0d92f208312a6f/FLAGa8ae88749 [2018-11-14 17:29:54,843 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:29:54,844 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-14 17:29:54,856 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33613183c/e8cd2baf0abe4fd48b0d92f208312a6f/FLAGa8ae88749 [2018-11-14 17:29:54,870 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33613183c/e8cd2baf0abe4fd48b0d92f208312a6f [2018-11-14 17:29:54,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:29:54,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:29:54,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:29:54,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:29:54,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:29:54,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:54" (1/1) ... [2018-11-14 17:29:54,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e00be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:54, skipping insertion in model container [2018-11-14 17:29:54,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:54" (1/1) ... [2018-11-14 17:29:54,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:29:54,922 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:29:55,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:29:55,148 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:29:55,168 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:29:55,187 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:29:55,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55 WrapperNode [2018-11-14 17:29:55,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:29:55,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:29:55,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:29:55,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:29:55,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... [2018-11-14 17:29:55,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:29:55,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:29:55,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:29:55,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:29:55,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:29:55,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:29:55,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:29:55,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:29:55,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:29:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:29:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:29:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:29:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:29:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:29:55,787 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:29:55,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:55 BoogieIcfgContainer [2018-11-14 17:29:55,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:29:55,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:29:55,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:29:55,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:29:55,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:29:54" (1/3) ... [2018-11-14 17:29:55,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206bc989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:55, skipping insertion in model container [2018-11-14 17:29:55,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:55" (2/3) ... [2018-11-14 17:29:55,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206bc989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:55, skipping insertion in model container [2018-11-14 17:29:55,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:55" (3/3) ... [2018-11-14 17:29:55,796 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_false-unreach-call_true-termination.i [2018-11-14 17:29:55,805 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:29:55,812 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:29:55,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:29:55,857 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:29:55,857 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:29:55,858 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:29:55,858 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:29:55,858 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:29:55,858 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:29:55,858 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:29:55,858 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:29:55,858 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:29:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 17:29:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:29:55,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:55,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:55,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:55,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-14 17:29:55,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:55,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:56,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 17:29:56,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 17:29:56,024 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2018-11-14 17:29:56,025 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2018-11-14 17:29:56,025 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2018-11-14 17:29:56,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 17:29:56,027 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {24#false} is VALID [2018-11-14 17:29:56,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 17:29:56,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume ~cond == 0; {24#false} is VALID [2018-11-14 17:29:56,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 17:29:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:56,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:56,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:29:56,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:29:56,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:56,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:29:56,109 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-14 17:29:56,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:29:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:29:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:29:56,120 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 17:29:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,211 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:29:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:29:56,212 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:29:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:29:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 17:29:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:29:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 17:29:56,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-14 17:29:56,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:56,445 INFO L225 Difference]: With dead ends: 31 [2018-11-14 17:29:56,445 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:29:56,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:29:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:29:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:29:56,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:56,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:29:56,548 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:29:56,548 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:29:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,551 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 17:29:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:29:56,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:56,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:56,552 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:29:56,552 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:29:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,556 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 17:29:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:29:56,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:56,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:56,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:56,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:29:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 17:29:56,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-14 17:29:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:56,562 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 17:29:56,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:29:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:29:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:29:56,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:56,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:56,563 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:56,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179357, now seen corresponding path program 1 times [2018-11-14 17:29:56,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:56,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:56,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:56,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-14 17:29:56,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-14 17:29:56,658 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #38#return; {116#true} is VALID [2018-11-14 17:29:56,659 INFO L256 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret1 := main(); {116#true} is VALID [2018-11-14 17:29:56,660 INFO L273 TraceCheckUtils]: 4: Hoare triple {116#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {118#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:56,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#(<= main_~i~0 1)} assume true; {118#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:56,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#(<= main_~i~0 1)} assume !(~i~0 <= 8); {117#false} is VALID [2018-11-14 17:29:56,664 INFO L256 TraceCheckUtils]: 7: Hoare triple {117#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {117#false} is VALID [2018-11-14 17:29:56,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {117#false} ~cond := #in~cond; {117#false} is VALID [2018-11-14 17:29:56,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {117#false} assume ~cond == 0; {117#false} is VALID [2018-11-14 17:29:56,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-14 17:29:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:56,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:56,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:29:56,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:29:56,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:56,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:29:56,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:56,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:29:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:29:56,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:29:56,763 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-14 17:29:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,908 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 17:29:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:29:56,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:29:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:29:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-14 17:29:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:29:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-14 17:29:56,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2018-11-14 17:29:57,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:57,083 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:29:57,083 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:29:57,085 INFO L604 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-14 17:29:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:29:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 17:29:57,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:57,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 17:29:57,100 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 17:29:57,101 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 17:29:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:57,104 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 17:29:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 17:29:57,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:57,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:57,105 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 17:29:57,105 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 17:29:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:57,107 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 17:29:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 17:29:57,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:57,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:57,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:57,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:29:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 17:29:57,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-14 17:29:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:57,111 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 17:29:57,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:29:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 17:29:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:29:57,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:57,113 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:57,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:57,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1652058138, now seen corresponding path program 1 times [2018-11-14 17:29:57,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:57,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:57,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-14 17:29:57,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 17:29:57,211 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #38#return; {220#true} is VALID [2018-11-14 17:29:57,211 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret1 := main(); {220#true} is VALID [2018-11-14 17:29:57,215 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {222#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:57,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#(<= main_~i~0 1)} assume true; {222#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:57,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {222#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:57,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {222#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:57,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {223#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:57,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#(<= main_~i~0 2)} assume true; {223#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:57,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#(<= main_~i~0 2)} assume !(~i~0 <= 8); {221#false} is VALID [2018-11-14 17:29:57,219 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {221#false} is VALID [2018-11-14 17:29:57,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-14 17:29:57,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume ~cond == 0; {221#false} is VALID [2018-11-14 17:29:57,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-14 17:29:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:57,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:57,223 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-14 17:29:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:57,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:57,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-14 17:29:57,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 17:29:57,402 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #38#return; {220#true} is VALID [2018-11-14 17:29:57,403 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret1 := main(); {220#true} is VALID [2018-11-14 17:29:57,403 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {220#true} is VALID [2018-11-14 17:29:57,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 17:29:57,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {220#true} assume !!(~i~0 <= 8); {220#true} is VALID [2018-11-14 17:29:57,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {220#true} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {248#(< main_~i~0 4)} is VALID [2018-11-14 17:29:57,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {248#(< main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {252#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:57,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {252#(<= main_~i~0 4)} assume true; {252#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:57,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {252#(<= main_~i~0 4)} assume !(~i~0 <= 8); {221#false} is VALID [2018-11-14 17:29:57,410 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {221#false} is VALID [2018-11-14 17:29:57,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-14 17:29:57,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume ~cond == 0; {221#false} is VALID [2018-11-14 17:29:57,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-14 17:29:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:57,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:29:57,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-14 17:29:57,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:29:57,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:57,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:29:57,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:57,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:29:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:29:57,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:29:57,620 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-14 17:29:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,022 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-14 17:29:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:29:58,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:29:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:29:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-14 17:29:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:29:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-14 17:29:58,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2018-11-14 17:29:58,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:58,102 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:29:58,102 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:29:58,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:29:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:29:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-14 17:29:58,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:58,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-14 17:29:58,116 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-14 17:29:58,116 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-14 17:29:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,119 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-14 17:29:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 17:29:58,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:58,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:58,120 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-14 17:29:58,121 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-14 17:29:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,123 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-14 17:29:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 17:29:58,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:58,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:58,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:58,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:29:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-14 17:29:58,127 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2018-11-14 17:29:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:58,127 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-14 17:29:58,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:29:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 17:29:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:29:58,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:58,129 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:58,129 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:58,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash 352425279, now seen corresponding path program 1 times [2018-11-14 17:29:58,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:58,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-14 17:29:58,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 17:29:58,358 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2018-11-14 17:29:58,358 INFO L256 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret1 := main(); {422#true} is VALID [2018-11-14 17:29:58,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {422#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {422#true} is VALID [2018-11-14 17:29:58,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 17:29:58,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {422#true} assume !!(~i~0 <= 8); {422#true} is VALID [2018-11-14 17:29:58,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {422#true} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {422#true} is VALID [2018-11-14 17:29:58,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {422#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {422#true} is VALID [2018-11-14 17:29:58,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 17:29:58,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {422#true} assume !!(~i~0 <= 8); {422#true} is VALID [2018-11-14 17:29:58,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {422#true} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {422#true} is VALID [2018-11-14 17:29:58,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {422#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {422#true} is VALID [2018-11-14 17:29:58,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 17:29:58,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {422#true} assume !!(~i~0 <= 8); {422#true} is VALID [2018-11-14 17:29:58,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {422#true} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {424#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:58,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {424#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#(<= main_~i~0 4)} assume true; {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {425#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {425#(<= main_~i~0 4)} assume !(~i~0 < 4); {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {425#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {426#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:58,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {426#(<= main_~i~0 5)} assume true; {426#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:58,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {426#(<= main_~i~0 5)} assume !(~i~0 <= 8); {423#false} is VALID [2018-11-14 17:29:58,372 INFO L256 TraceCheckUtils]: 23: Hoare triple {423#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {423#false} is VALID [2018-11-14 17:29:58,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2018-11-14 17:29:58,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {423#false} assume ~cond == 0; {423#false} is VALID [2018-11-14 17:29:58,372 INFO L273 TraceCheckUtils]: 26: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-14 17:29:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:29:58,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:58,374 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-14 17:29:58,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:58,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:58,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-14 17:29:58,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 17:29:58,628 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #38#return; {422#true} is VALID [2018-11-14 17:29:58,629 INFO L256 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret1 := main(); {422#true} is VALID [2018-11-14 17:29:58,629 INFO L273 TraceCheckUtils]: 4: Hoare triple {422#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {422#true} is VALID [2018-11-14 17:29:58,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-14 17:29:58,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {422#true} assume !!(~i~0 <= 8); {422#true} is VALID [2018-11-14 17:29:58,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {422#true} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {424#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:58,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {424#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {425#(<= main_~i~0 4)} assume true; {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#(<= main_~i~0 4)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {425#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:58,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {426#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:58,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#(<= main_~i~0 5)} assume true; {426#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:58,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {426#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:58,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#(<= main_~i~0 5)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {426#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:58,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {426#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {478#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:58,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {478#(<= main_~i~0 6)} assume true; {478#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:58,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {478#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:58,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#(<= main_~i~0 6)} assume !(~i~0 < 4); {478#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:58,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {478#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {491#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:58,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {491#(<= main_~i~0 7)} assume true; {491#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:58,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {491#(<= main_~i~0 7)} assume !(~i~0 <= 8); {423#false} is VALID [2018-11-14 17:29:58,655 INFO L256 TraceCheckUtils]: 23: Hoare triple {423#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {423#false} is VALID [2018-11-14 17:29:58,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2018-11-14 17:29:58,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {423#false} assume ~cond == 0; {423#false} is VALID [2018-11-14 17:29:58,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-14 17:29:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:58,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2018-11-14 17:29:58,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 17:29:58,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:58,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:29:58,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:58,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:29:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:29:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:29:58,787 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-11-14 17:29:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,994 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-14 17:29:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:29:58,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-14 17:29:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:29:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-14 17:29:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:29:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-14 17:29:59,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2018-11-14 17:29:59,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:59,138 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:29:59,138 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:29:59,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:29:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:29:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-14 17:29:59,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:59,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-14 17:29:59,169 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-14 17:29:59,169 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-14 17:29:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:59,172 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 17:29:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 17:29:59,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:59,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:59,174 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-14 17:29:59,174 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-14 17:29:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:59,178 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 17:29:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 17:29:59,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:59,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:59,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:59,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:29:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-14 17:29:59,182 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 27 [2018-11-14 17:29:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:59,182 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-14 17:29:59,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:29:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:29:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:29:59,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:59,184 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:59,185 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:59,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1518099348, now seen corresponding path program 2 times [2018-11-14 17:29:59,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:59,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-14 17:29:59,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 17:29:59,418 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {710#true} {710#true} #38#return; {710#true} is VALID [2018-11-14 17:29:59,419 INFO L256 TraceCheckUtils]: 3: Hoare triple {710#true} call #t~ret1 := main(); {710#true} is VALID [2018-11-14 17:29:59,424 INFO L273 TraceCheckUtils]: 4: Hoare triple {710#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#(<= main_~i~0 1)} assume true; {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {712#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#(<= main_~i~0 2)} assume true; {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {713#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {714#(<= main_~i~0 3)} assume true; {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {714#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {714#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {714#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {715#(<= main_~i~0 4)} assume true; {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,454 INFO L273 TraceCheckUtils]: 18: Hoare triple {715#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {715#(<= main_~i~0 4)} assume !(~i~0 < 4); {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {715#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {716#(<= main_~i~0 5)} assume true; {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {716#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {716#(<= main_~i~0 5)} assume !(~i~0 < 4); {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {716#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {717#(<= main_~i~0 6)} assume true; {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {717#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {717#(<= main_~i~0 6)} assume !(~i~0 < 4); {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {717#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {718#(<= main_~i~0 7)} assume true; {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {718#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {718#(<= main_~i~0 7)} assume !(~i~0 < 4); {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {718#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {719#(<= main_~i~0 8)} is VALID [2018-11-14 17:29:59,473 INFO L273 TraceCheckUtils]: 33: Hoare triple {719#(<= main_~i~0 8)} assume true; {719#(<= main_~i~0 8)} is VALID [2018-11-14 17:29:59,474 INFO L273 TraceCheckUtils]: 34: Hoare triple {719#(<= main_~i~0 8)} assume !(~i~0 <= 8); {711#false} is VALID [2018-11-14 17:29:59,474 INFO L256 TraceCheckUtils]: 35: Hoare triple {711#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {711#false} is VALID [2018-11-14 17:29:59,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-14 17:29:59,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {711#false} assume ~cond == 0; {711#false} is VALID [2018-11-14 17:29:59,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-14 17:29:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:59,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:59,480 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-14 17:29:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:29:59,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:29:59,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:29:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:59,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:59,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-14 17:29:59,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 17:29:59,689 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {710#true} {710#true} #38#return; {710#true} is VALID [2018-11-14 17:29:59,689 INFO L256 TraceCheckUtils]: 3: Hoare triple {710#true} call #t~ret1 := main(); {710#true} is VALID [2018-11-14 17:29:59,690 INFO L273 TraceCheckUtils]: 4: Hoare triple {710#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#(<= main_~i~0 1)} assume true; {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {712#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,692 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {712#(<= main_~i~0 1)} is VALID [2018-11-14 17:29:59,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#(<= main_~i~0 2)} assume true; {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {713#(<= main_~i~0 2)} is VALID [2018-11-14 17:29:59,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {713#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {714#(<= main_~i~0 3)} assume true; {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {714#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {714#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := ~sn~0 + 2; {714#(<= main_~i~0 3)} is VALID [2018-11-14 17:29:59,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {714#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {715#(<= main_~i~0 4)} assume true; {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {715#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {715#(<= main_~i~0 4)} assume !(~i~0 < 4); {715#(<= main_~i~0 4)} is VALID [2018-11-14 17:29:59,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {715#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {716#(<= main_~i~0 5)} assume true; {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,710 INFO L273 TraceCheckUtils]: 22: Hoare triple {716#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {716#(<= main_~i~0 5)} assume !(~i~0 < 4); {716#(<= main_~i~0 5)} is VALID [2018-11-14 17:29:59,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {716#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {717#(<= main_~i~0 6)} assume true; {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {717#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {717#(<= main_~i~0 6)} assume !(~i~0 < 4); {717#(<= main_~i~0 6)} is VALID [2018-11-14 17:29:59,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {717#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {718#(<= main_~i~0 7)} assume true; {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {718#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {718#(<= main_~i~0 7)} assume !(~i~0 < 4); {718#(<= main_~i~0 7)} is VALID [2018-11-14 17:29:59,718 INFO L273 TraceCheckUtils]: 32: Hoare triple {718#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {719#(<= main_~i~0 8)} is VALID [2018-11-14 17:29:59,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {719#(<= main_~i~0 8)} assume true; {719#(<= main_~i~0 8)} is VALID [2018-11-14 17:29:59,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {719#(<= main_~i~0 8)} assume !(~i~0 <= 8); {711#false} is VALID [2018-11-14 17:29:59,720 INFO L256 TraceCheckUtils]: 35: Hoare triple {711#false} call __VERIFIER_assert((if ~sn~0 == 16 || ~sn~0 == 0 then 1 else 0)); {711#false} is VALID [2018-11-14 17:29:59,720 INFO L273 TraceCheckUtils]: 36: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2018-11-14 17:29:59,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {711#false} assume ~cond == 0; {711#false} is VALID [2018-11-14 17:29:59,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-14 17:29:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:59,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:59,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-14 17:29:59,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-14 17:29:59,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:59,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:29:59,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:59,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:29:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:29:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:29:59,792 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 10 states. [2018-11-14 17:30:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:00,008 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-14 17:30:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:30:00,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-14 17:30:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:30:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-14 17:30:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:30:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-14 17:30:00,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2018-11-14 17:30:00,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:00,158 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:30:00,159 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:30:00,159 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:30:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:30:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:30:00,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:00,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:30:00,186 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:30:00,186 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:30:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:00,189 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:30:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:30:00,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:00,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:00,191 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:30:00,191 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:30:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:00,193 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:30:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:30:00,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:00,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:00,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:00,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:30:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-14 17:30:00,198 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-11-14 17:30:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:00,198 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-14 17:30:00,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:30:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:30:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:30:00,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:00,200 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:00,200 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:00,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash 940069211, now seen corresponding path program 3 times [2018-11-14 17:30:00,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:00,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:30:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:30:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:30:00,263 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:30:00,290 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:30:00,290 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:30:00,290 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:30:00,290 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:30:00,290 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 17:30:00,290 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 17:30:00,291 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-14 17:30:00,292 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:30:00,293 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:30:00,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:30:00 BoogieIcfgContainer [2018-11-14 17:30:00,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:30:00,296 INFO L168 Benchmark]: Toolchain (without parser) took 5416.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -459.2 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:00,298 INFO L168 Benchmark]: CDTParser took 0.33 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-14 17:30:00,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.36 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-14 17:30:00,300 INFO L168 Benchmark]: Boogie Preprocessor took 31.31 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-14 17:30:00,300 INFO L168 Benchmark]: RCFGBuilder took 568.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:00,301 INFO L168 Benchmark]: TraceAbstraction took 4506.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 307.9 MB). Peak memory consumption was 307.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:00,305 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.33 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 306.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.31 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 568.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4506.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 307.9 MB). Peak memory consumption was 307.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 6 OverallIterations, 9 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 48 SDslu, 138 SDs, 0 SdLazy, 85 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 10809 SizeOfPredicates, 2 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 42/264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...