./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:50:50,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:50:50,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:50:50,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:50:50,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:50:50,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:50:50,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:50:50,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:50:50,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:50:50,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:50:50,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:50:50,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:50:50,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:50:50,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:50:50,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:50:50,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:50:50,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:50:50,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:50:50,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:50:50,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:50:50,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:50:50,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:50:50,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:50:50,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:50:50,784 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:50:50,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:50:50,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:50:50,787 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:50:50,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:50:50,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:50:50,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:50:50,792 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:50:50,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:50:50,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:50:50,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:50:50,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:50:50,796 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:50:50,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:50:50,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:50:50,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:50:50,814 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:50:50,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:50:50,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:50:50,816 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:50:50,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:50:50,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:50:50,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:50:50,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:50:50,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:50:50,818 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:50:50,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:50:50,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:50:50,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:50:50,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:50:50,819 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:50:50,819 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:50:50,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:50:50,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:50:50,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:50:50,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:50:50,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:50:50,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:50:50,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:50:50,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:50:50,822 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:50:50,822 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:50:50,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:50:50,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe571d33601eb001defa960d70b02ea99b59263c [2018-11-28 18:50:50,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:50:50,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:50:50,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:50:50,907 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:50:50,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:50:50,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-28 18:50:50,980 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93cf51469/9cd0b9d12fd2491a933ccad3de33155c/FLAG4682e04b7 [2018-11-28 18:50:51,446 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:50:51,447 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-28 18:50:51,454 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93cf51469/9cd0b9d12fd2491a933ccad3de33155c/FLAG4682e04b7 [2018-11-28 18:50:51,815 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93cf51469/9cd0b9d12fd2491a933ccad3de33155c [2018-11-28 18:50:51,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:50:51,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:50:51,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:51,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:50:51,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:50:51,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:51" (1/1) ... [2018-11-28 18:50:51,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270eac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:51, skipping insertion in model container [2018-11-28 18:50:51,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:51" (1/1) ... [2018-11-28 18:50:51,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:50:51,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:50:52,044 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:52,050 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:50:52,080 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:52,098 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:50:52,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52 WrapperNode [2018-11-28 18:50:52,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:52,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:52,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:50:52,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:50:52,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:52,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:50:52,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:50:52,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:50:52,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (1/1) ... [2018-11-28 18:50:52,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:50:52,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:50:52,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:50:52,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:50:52,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (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-28 18:50:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:50:52,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:50:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:50:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:50:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:50:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:50:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-28 18:50:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-28 18:50:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-28 18:50:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-28 18:50:52,738 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:50:52,741 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:50:52,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:52 BoogieIcfgContainer [2018-11-28 18:50:52,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:50:52,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:50:52,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:50:52,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:50:52,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:50:51" (1/3) ... [2018-11-28 18:50:52,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426ddf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:50:52, skipping insertion in model container [2018-11-28 18:50:52,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:52" (2/3) ... [2018-11-28 18:50:52,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426ddf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:50:52, skipping insertion in model container [2018-11-28 18:50:52,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:52" (3/3) ... [2018-11-28 18:50:52,751 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-28 18:50:52,762 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:50:52,770 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:50:52,788 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:50:52,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:50:52,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:50:52,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:50:52,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:50:52,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:50:52,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:50:52,822 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:50:52,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:50:52,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:50:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 18:50:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:50:52,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:52,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:52,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:52,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-28 18:50:52,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:52,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:52,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:53,098 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-28 18:50:53,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:50:53,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:50:53,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:50:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:50:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:50:53,122 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-28 18:50:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:53,301 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-28 18:50:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:50:53,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:50:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:53,315 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:50:53,315 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:50:53,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:50:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:50:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 18:50:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:50:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 18:50:53,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-28 18:50:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:53,365 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 18:50:53,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:50:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 18:50:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:50:53,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:53,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:53,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:53,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-28 18:50:53,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:53,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:53,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:53,445 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-28 18:50:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:50:53,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:50:53,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:50:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:50:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:50:53,448 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-28 18:50:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:53,764 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 18:50:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:50:53,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:50:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:53,767 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:50:53,767 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:50:53,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:50:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:50:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:50:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:50:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 18:50:53,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-28 18:50:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:53,785 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 18:50:53,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:50:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 18:50:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:50:53,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:53,787 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:53,792 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:53,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-28 18:50:53,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:53,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:53,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:53,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:53,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:50:53,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:53,978 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-28 18:50:53,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:54,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:50:54,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:54,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-28 18:50:54,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:50:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:50:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:50:54,180 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-28 18:50:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:54,986 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-28 18:50:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:50:54,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 18:50:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:54,988 INFO L225 Difference]: With dead ends: 58 [2018-11-28 18:50:54,988 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 18:50:54,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:50:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 18:50:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 18:50:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 18:50:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-28 18:50:54,999 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-28 18:50:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:54,999 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 18:50:55,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:50:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-28 18:50:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:50:55,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:55,002 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:55,002 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:55,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-28 18:50:55,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:55,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:55,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:50:55,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:55,146 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-28 18:50:55,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:55,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:50:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 18:50:55,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:50:55,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:50:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:50:55,231 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-28 18:50:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:55,539 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-28 18:50:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:50:55,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 18:50:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:55,543 INFO L225 Difference]: With dead ends: 43 [2018-11-28 18:50:55,543 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:50:55,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:50:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:50:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-28 18:50:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:50:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-28 18:50:55,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-28 18:50:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:55,555 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-28 18:50:55,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:50:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-28 18:50:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:50:55,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:55,558 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:55,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:55,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-28 18:50:55,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:55,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:50:55,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:55,706 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-28 18:50:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:55,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:50:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-28 18:50:55,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:50:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:50:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:50:55,892 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-28 18:50:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:56,270 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-28 18:50:56,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:50:56,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-28 18:50:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:56,274 INFO L225 Difference]: With dead ends: 70 [2018-11-28 18:50:56,274 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:50:56,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:50:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:50:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 18:50:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:50:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-28 18:50:56,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-28 18:50:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:56,285 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 18:50:56,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:50:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-28 18:50:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:50:56,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:56,288 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:56,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:56,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:56,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-28 18:50:56,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:56,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:56,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 18:50:56,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:56,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:50:56,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:56,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 18:50:56,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:56,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-28 18:50:56,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:50:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:50:56,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:50:56,571 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-28 18:50:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:56,779 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-28 18:50:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:50:56,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-28 18:50:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:56,784 INFO L225 Difference]: With dead ends: 61 [2018-11-28 18:50:56,784 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 18:50:56,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:50:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 18:50:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-28 18:50:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 18:50:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-28 18:50:56,801 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-28 18:50:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:56,802 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-28 18:50:56,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:50:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-28 18:50:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 18:50:56,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:56,806 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:56,806 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:56,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-28 18:50:56,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:56,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:56,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 18:50:56,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:56,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:50:56,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:56,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 18:50:57,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:57,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-28 18:50:57,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:50:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:50:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:50:57,052 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-28 18:50:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:57,477 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-28 18:50:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:50:57,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-28 18:50:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:57,482 INFO L225 Difference]: With dead ends: 71 [2018-11-28 18:50:57,482 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:50:57,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:50:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:50:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-28 18:50:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 18:50:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-28 18:50:57,505 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-28 18:50:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:57,505 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-28 18:50:57,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:50:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-28 18:50:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 18:50:57,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:57,509 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:57,509 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:57,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-28 18:50:57,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:57,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:57,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:57,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:57,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 18:50:57,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:57,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:50:57,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:50:57,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:50:57,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:50:57,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-28 18:50:58,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:58,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-28 18:50:58,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:50:58,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:50:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:50:58,034 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 14 states. [2018-11-28 18:50:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:58,644 INFO L93 Difference]: Finished difference Result 127 states and 238 transitions. [2018-11-28 18:50:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 18:50:58,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-28 18:50:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:58,650 INFO L225 Difference]: With dead ends: 127 [2018-11-28 18:50:58,650 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 18:50:58,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-11-28 18:50:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 18:50:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2018-11-28 18:50:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 18:50:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2018-11-28 18:50:58,668 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 80 [2018-11-28 18:50:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:58,668 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2018-11-28 18:50:58,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:50:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2018-11-28 18:50:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 18:50:58,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:58,675 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:58,675 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:58,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1162571493, now seen corresponding path program 1 times [2018-11-28 18:50:58,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:58,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:58,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:58,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:50:58,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-28 18:50:58,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:58,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:50:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:59,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 30 proven. 41 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-28 18:50:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-28 18:50:59,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 18:50:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 18:50:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:50:59,217 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand 15 states. [2018-11-28 18:51:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:00,295 INFO L93 Difference]: Finished difference Result 180 states and 349 transitions. [2018-11-28 18:51:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 18:51:00,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2018-11-28 18:51:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:00,301 INFO L225 Difference]: With dead ends: 180 [2018-11-28 18:51:00,301 INFO L226 Difference]: Without dead ends: 115 [2018-11-28 18:51:00,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-11-28 18:51:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-28 18:51:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-11-28 18:51:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 18:51:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2018-11-28 18:51:00,325 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 95 [2018-11-28 18:51:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:00,326 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2018-11-28 18:51:00,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 18:51:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2018-11-28 18:51:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 18:51:00,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:00,329 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:00,329 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:00,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash 367128822, now seen corresponding path program 2 times [2018-11-28 18:51:00,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 18:51:00,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:00,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:00,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:00,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:00,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:00,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 18:51:01,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:01,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2018-11-28 18:51:01,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 18:51:01,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 18:51:01,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:51:01,232 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand 15 states. [2018-11-28 18:51:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:02,213 INFO L93 Difference]: Finished difference Result 253 states and 504 transitions. [2018-11-28 18:51:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 18:51:02,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-11-28 18:51:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:02,222 INFO L225 Difference]: With dead ends: 253 [2018-11-28 18:51:02,222 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 18:51:02,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-11-28 18:51:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 18:51:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2018-11-28 18:51:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-28 18:51:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 275 transitions. [2018-11-28 18:51:02,269 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 275 transitions. Word has length 83 [2018-11-28 18:51:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:02,270 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 275 transitions. [2018-11-28 18:51:02,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 18:51:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 275 transitions. [2018-11-28 18:51:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-28 18:51:02,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:02,274 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:02,275 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:02,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1643058009, now seen corresponding path program 1 times [2018-11-28 18:51:02,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 69 proven. 74 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-11-28 18:51:02,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:02,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:02,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 67 proven. 75 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-28 18:51:02,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:02,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2018-11-28 18:51:02,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:51:02,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:51:02,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:51:02,854 INFO L87 Difference]: Start difference. First operand 154 states and 275 transitions. Second operand 13 states. [2018-11-28 18:51:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:03,251 INFO L93 Difference]: Finished difference Result 188 states and 385 transitions. [2018-11-28 18:51:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:03,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-11-28 18:51:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:03,255 INFO L225 Difference]: With dead ends: 188 [2018-11-28 18:51:03,255 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 18:51:03,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:51:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 18:51:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-11-28 18:51:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-28 18:51:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 200 transitions. [2018-11-28 18:51:03,275 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 200 transitions. Word has length 123 [2018-11-28 18:51:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:03,276 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 200 transitions. [2018-11-28 18:51:03,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:51:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2018-11-28 18:51:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 18:51:03,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:03,278 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:03,279 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:03,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1677699577, now seen corresponding path program 2 times [2018-11-28 18:51:03,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:03,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:03,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-28 18:51:03,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:03,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:03,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:03,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:03,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:03,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-28 18:51:03,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:03,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-11-28 18:51:03,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:51:03,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:51:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:51:03,826 INFO L87 Difference]: Start difference. First operand 129 states and 200 transitions. Second operand 11 states. [2018-11-28 18:51:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:04,185 INFO L93 Difference]: Finished difference Result 274 states and 457 transitions. [2018-11-28 18:51:04,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:51:04,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-28 18:51:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:04,190 INFO L225 Difference]: With dead ends: 274 [2018-11-28 18:51:04,190 INFO L226 Difference]: Without dead ends: 157 [2018-11-28 18:51:04,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:51:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-28 18:51:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2018-11-28 18:51:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-28 18:51:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2018-11-28 18:51:04,208 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 96 [2018-11-28 18:51:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:04,209 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2018-11-28 18:51:04,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:51:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2018-11-28 18:51:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-28 18:51:04,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:04,212 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:04,212 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:04,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash 235412830, now seen corresponding path program 3 times [2018-11-28 18:51:04,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:04,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-28 18:51:04,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:04,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:04,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:51:04,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 18:51:04,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:04,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-28 18:51:04,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:04,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 18:51:04,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:51:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:51:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:51:04,671 INFO L87 Difference]: Start difference. First operand 145 states and 230 transitions. Second operand 11 states. [2018-11-28 18:51:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:05,007 INFO L93 Difference]: Finished difference Result 262 states and 428 transitions. [2018-11-28 18:51:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:51:05,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-11-28 18:51:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:05,013 INFO L225 Difference]: With dead ends: 262 [2018-11-28 18:51:05,013 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 18:51:05,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:51:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 18:51:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-28 18:51:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 18:51:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2018-11-28 18:51:05,031 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 108 [2018-11-28 18:51:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:05,032 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2018-11-28 18:51:05,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:51:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2018-11-28 18:51:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 18:51:05,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:05,036 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:05,036 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:05,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash -878903457, now seen corresponding path program 4 times [2018-11-28 18:51:05,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:05,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:05,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:05,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 89 proven. 22 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-11-28 18:51:05,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:05,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:51:05,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:51:05,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:51:05,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:05,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 87 proven. 23 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-28 18:51:05,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:05,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2018-11-28 18:51:05,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:51:05,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:51:05,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:51:05,550 INFO L87 Difference]: Start difference. First operand 130 states and 197 transitions. Second operand 12 states. [2018-11-28 18:51:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:05,729 INFO L93 Difference]: Finished difference Result 148 states and 218 transitions. [2018-11-28 18:51:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:51:05,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2018-11-28 18:51:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:05,732 INFO L225 Difference]: With dead ends: 148 [2018-11-28 18:51:05,733 INFO L226 Difference]: Without dead ends: 144 [2018-11-28 18:51:05,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:51:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-28 18:51:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2018-11-28 18:51:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-28 18:51:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2018-11-28 18:51:05,746 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 122 [2018-11-28 18:51:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:05,747 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2018-11-28 18:51:05,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:51:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2018-11-28 18:51:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-28 18:51:05,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:05,749 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:05,749 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:05,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 5 times [2018-11-28 18:51:05,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:05,793 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:51:05,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:51:05 BoogieIcfgContainer [2018-11-28 18:51:05,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:51:05,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:51:05,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:51:05,837 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:51:05,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:52" (3/4) ... [2018-11-28 18:51:05,840 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:51:05,936 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:51:05,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:51:05,937 INFO L168 Benchmark]: Toolchain (without parser) took 14117.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 951.3 MB in the beginning and 937.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 308.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:05,939 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:05,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:05,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:05,941 INFO L168 Benchmark]: Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:05,941 INFO L168 Benchmark]: RCFGBuilder took 583.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:05,942 INFO L168 Benchmark]: TraceAbstraction took 13092.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 946.8 MB in the end (delta: 141.3 MB). Peak memory consumption was 323.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:05,942 INFO L168 Benchmark]: Witness Printer took 100.20 ms. Allocated memory is still 1.3 GB. Free memory is still 937.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:05,945 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.64 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 583.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13092.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 946.8 MB in the end (delta: 141.3 MB). Peak memory consumption was 323.7 MB. Max. memory is 11.5 GB. * Witness Printer took 100.20 ms. Allocated memory is still 1.3 GB. Free memory is still 937.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 13.0s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 454 SDslu, 1980 SDs, 0 SdLazy, 2463 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 890 SyntacticMatches, 5 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=10, 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, 14 MinimizatonAttempts, 115 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1844 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1787 ConstructedInterpolants, 0 QuantifiedInterpolants, 245481 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1820 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 2918/3400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...