./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_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_6_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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:50:55,062 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:50:55,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:50:55,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:50:55,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:50:55,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:50:55,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:50:55,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:50:55,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:50:55,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:50:55,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:50:55,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:50:55,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:50:55,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:50:55,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:50:55,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:50:55,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:50:55,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:50:55,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:50:55,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:50:55,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:50:55,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:50:55,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:50:55,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:50:55,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:50:55,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:50:55,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:50:55,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:50:55,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:50:55,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:50:55,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:50:55,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:50:55,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:50:55,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:50:55,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:50:55,141 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:55,161 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:50:55,162 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:50:55,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:50:55,163 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:50:55,164 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:50:55,164 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:50:55,164 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:50:55,164 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:50:55,164 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:50:55,165 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:50:55,165 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:50:55,165 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:50:55,165 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:50:55,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:50:55,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:50:55,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:50:55,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:50:55,167 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:50:55,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:50:55,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:50:55,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:50:55,168 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:50:55,168 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:50:55,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:50:55,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:50:55,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:50:55,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:50:55,170 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:50:55,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:50:55,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:50:55,171 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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-11-28 18:50:55,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:50:55,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:50:55,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:50:55,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:50:55,236 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:50:55,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-28 18:50:55,298 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3cac82c/7824800bcf37461e9f3e18c29769ab83/FLAGc5b804553 [2018-11-28 18:50:55,712 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:50:55,715 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-28 18:50:55,721 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3cac82c/7824800bcf37461e9f3e18c29769ab83/FLAGc5b804553 [2018-11-28 18:50:56,108 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3cac82c/7824800bcf37461e9f3e18c29769ab83 [2018-11-28 18:50:56,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:50:56,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:50:56,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:56,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:50:56,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:50:56,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:56" (1/1) ... [2018-11-28 18:50:56,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1abf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:56, skipping insertion in model container [2018-11-28 18:50:56,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:50:56" (1/1) ... [2018-11-28 18:50:56,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:50:56,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:50:56,400 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:56,406 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:50:56,427 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:50:56,446 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:50:56,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:56 WrapperNode [2018-11-28 18:50:56,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:50:56,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:56,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:50:56,448 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:50:56,459 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:56" (1/1) ... [2018-11-28 18:50:56,464 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:56" (1/1) ... [2018-11-28 18:50:56,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:50:56,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:50:56,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:50:56,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:50:56,486 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:56" (1/1) ... [2018-11-28 18:50:56,486 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:56" (1/1) ... [2018-11-28 18:50:56,487 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:56" (1/1) ... [2018-11-28 18:50:56,487 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:56" (1/1) ... [2018-11-28 18:50:56,492 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:56" (1/1) ... [2018-11-28 18:50:56,495 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:56" (1/1) ... [2018-11-28 18:50:56,496 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:56" (1/1) ... [2018-11-28 18:50:56,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:50:56,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:50:56,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:50:56,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:50:56,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:56" (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:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:50:56,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:50:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:50:56,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:50:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:50:56,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:50:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-28 18:50:56,654 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-28 18:50:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-28 18:50:56,654 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-28 18:50:57,001 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:50:57,001 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:50:57,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:57 BoogieIcfgContainer [2018-11-28 18:50:57,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:50:57,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:50:57,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:50:57,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:50:57,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:50:56" (1/3) ... [2018-11-28 18:50:57,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e18a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:50:57, skipping insertion in model container [2018-11-28 18:50:57,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:50:56" (2/3) ... [2018-11-28 18:50:57,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e18a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:50:57, skipping insertion in model container [2018-11-28 18:50:57,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:50:57" (3/3) ... [2018-11-28 18:50:57,015 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-28 18:50:57,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:50:57,038 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:50:57,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:50:57,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:50:57,081 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:50:57,081 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:50:57,082 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:50:57,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:50:57,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:50:57,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:50:57,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:50:57,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:50:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 18:50:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:50:57,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:57,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:57,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:57,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-28 18:50:57,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:57,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:57,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:57,358 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:57,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:50:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:50:57,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:50:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:50:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:50:57,381 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-28 18:50:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:57,569 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-28 18:50:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:50:57,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:50:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:57,581 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:50:57,582 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:50:57,585 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:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:50:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 18:50:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:50:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 18:50:57,629 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-28 18:50:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:57,629 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 18:50:57,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:50:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 18:50:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:50:57,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:57,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:50:57,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:57,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-28 18:50:57,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:57,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:57,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:57,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:57,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:57,720 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:57,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:50:57,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:50:57,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:50:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:50:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:50:57,724 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-28 18:50:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:58,055 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 18:50:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:50:58,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:50:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:58,057 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:50:58,057 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:50:58,059 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:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:50:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:50:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:50:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 18:50:58,071 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-28 18:50:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 18:50:58,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:50:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 18:50:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:50:58,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:58,076 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:58,076 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:58,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-28 18:50:58,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:58,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:58,238 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:58,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:58,238 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:58,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:58,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:58,421 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:58,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:58,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-28 18:50:58,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:50:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:50:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:50:58,452 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-28 18:50:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:59,151 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-28 18:50:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:50:59,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 18:50:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:59,153 INFO L225 Difference]: With dead ends: 58 [2018-11-28 18:50:59,153 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 18:50:59,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:50:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 18:50:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 18:50:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 18:50:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-28 18:50:59,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-28 18:50:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 18:50:59,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:50:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-28 18:50:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:50:59,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:59,184 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:59,184 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:59,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-28 18:50:59,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:59,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:59,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:59,345 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:59,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:59,345 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:59,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:59,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:50:59,403 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:59,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:50:59,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 18:50:59,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:50:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:50:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:50:59,425 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-28 18:50:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:50:59,708 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-28 18:50:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:50:59,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 18:50:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:50:59,712 INFO L225 Difference]: With dead ends: 43 [2018-11-28 18:50:59,712 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:50:59,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:50:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:50:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-28 18:50:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:50:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-28 18:50:59,722 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-28 18:50:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:50:59,723 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-28 18:50:59,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:50:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-28 18:50:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 18:50:59,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:50:59,725 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:59,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:50:59,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:50:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-28 18:50:59,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:50:59,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:50:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:59,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:50:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:59,858 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:59,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:50:59,858 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:59,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:50:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:50:59,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:00,011 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:51:00,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:00,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-28 18:51:00,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:00,040 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-28 18:51:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:00,485 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-28 18:51:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:51:00,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-28 18:51:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:00,489 INFO L225 Difference]: With dead ends: 70 [2018-11-28 18:51:00,489 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:51:00,490 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:51:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:51:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 18:51:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:51:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-28 18:51:00,501 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-28 18:51:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:00,501 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 18:51:00,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-28 18:51:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:51:00,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:00,503 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:51:00,504 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:00,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-28 18:51:00,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:00,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:00,617 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:51:00,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:00,618 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:51:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:00,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:00,780 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:51:00,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:00,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-28 18:51:00,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:00,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:00,802 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-28 18:51:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:01,019 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-28 18:51:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:01,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-28 18:51:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:01,024 INFO L225 Difference]: With dead ends: 61 [2018-11-28 18:51:01,024 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 18:51:01,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:51:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 18:51:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-28 18:51:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 18:51:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-28 18:51:01,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-28 18:51:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:01,038 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-28 18:51:01,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-28 18:51:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 18:51:01,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:01,041 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:51:01,042 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:01,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-28 18:51:01,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:01,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:01,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:01,298 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:51:01,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:01,299 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:51:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:01,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:01,415 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:51:01,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:01,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-28 18:51:01,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:01,436 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-28 18:51:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:01,833 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-28 18:51:01,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:01,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-28 18:51:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:01,837 INFO L225 Difference]: With dead ends: 71 [2018-11-28 18:51:01,838 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:51:01,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:51:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:51:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-28 18:51:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 18:51:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-28 18:51:01,856 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-28 18:51:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:01,856 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-28 18:51:01,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-28 18:51:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 18:51:01,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:01,862 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:51:01,862 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-28 18:51:01,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:01,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,081 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:51:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:02,082 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:51:02,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:02,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:02,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:02,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-28 18:51:02,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 18:51:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:51:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:51:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:51:02,349 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-11-28 18:51:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:03,241 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-11-28 18:51:03,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:51:03,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-28 18:51:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:03,247 INFO L225 Difference]: With dead ends: 146 [2018-11-28 18:51:03,247 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 18:51:03,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-11-28 18:51:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 18:51:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-28 18:51:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 18:51:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-11-28 18:51:03,282 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-11-28 18:51:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:03,283 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-11-28 18:51:03,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:51:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-11-28 18:51:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-28 18:51:03,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:03,291 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:03,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:03,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2012686571, now seen corresponding path program 2 times [2018-11-28 18:51:03,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 78 proven. 181 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-28 18:51:03,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:03,595 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:51:03,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:03,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:03,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:03,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 196 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-28 18:51:04,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-28 18:51:04,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 18:51:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 18:51:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:51:04,072 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-11-28 18:51:04,800 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 18:51:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:05,314 INFO L93 Difference]: Finished difference Result 239 states and 535 transitions. [2018-11-28 18:51:05,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 18:51:05,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 175 [2018-11-28 18:51:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:05,321 INFO L225 Difference]: With dead ends: 239 [2018-11-28 18:51:05,321 INFO L226 Difference]: Without dead ends: 158 [2018-11-28 18:51:05,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 18:51:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-28 18:51:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2018-11-28 18:51:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-28 18:51:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 243 transitions. [2018-11-28 18:51:05,353 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 243 transitions. Word has length 175 [2018-11-28 18:51:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:05,354 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 243 transitions. [2018-11-28 18:51:05,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 18:51:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 243 transitions. [2018-11-28 18:51:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-28 18:51:05,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:05,359 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 10, 10, 9, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:05,360 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:05,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash -805716237, now seen corresponding path program 1 times [2018-11-28 18:51:05,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 214 proven. 21 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-11-28 18:51:05,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:05,646 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:05,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:05,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 216 proven. 61 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-11-28 18:51:06,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:06,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-28 18:51:06,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 18:51:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 18:51:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:51:06,105 INFO L87 Difference]: Start difference. First operand 139 states and 243 transitions. Second operand 18 states. [2018-11-28 18:51:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:07,134 INFO L93 Difference]: Finished difference Result 334 states and 683 transitions. [2018-11-28 18:51:07,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 18:51:07,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 178 [2018-11-28 18:51:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:07,141 INFO L225 Difference]: With dead ends: 334 [2018-11-28 18:51:07,142 INFO L226 Difference]: Without dead ends: 204 [2018-11-28 18:51:07,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2018-11-28 18:51:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-28 18:51:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 172. [2018-11-28 18:51:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 18:51:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 303 transitions. [2018-11-28 18:51:07,178 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 303 transitions. Word has length 178 [2018-11-28 18:51:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:07,179 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 303 transitions. [2018-11-28 18:51:07,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 18:51:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 303 transitions. [2018-11-28 18:51:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-28 18:51:07,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:07,185 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:07,187 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:07,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 2 times [2018-11-28 18:51:07,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:07,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:07,266 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:51:07,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:51:07 BoogieIcfgContainer [2018-11-28 18:51:07,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:51:07,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:51:07,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:51:07,335 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:51:07,336 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:57" (3/4) ... [2018-11-28 18:51:07,340 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:51:07,467 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:51:07,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:51:07,469 INFO L168 Benchmark]: Toolchain (without parser) took 11355.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 147.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:07,469 INFO L168 Benchmark]: CDTParser took 0.17 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:07,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.98 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:07,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.17 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:07,470 INFO L168 Benchmark]: Boogie Preprocessor took 24.68 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:07,471 INFO L168 Benchmark]: RCFGBuilder took 504.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:07,474 INFO L168 Benchmark]: TraceAbstraction took 10330.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.3 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:07,474 INFO L168 Benchmark]: Witness Printer took 133.01 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:07,477 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.17 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 331.98 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.17 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 24.68 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 504.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10330.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.3 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. * Witness Printer took 133.01 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 10.2s OverallTime, 11 OverallIterations, 15 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 280 SDtfs, 366 SDslu, 1542 SDs, 0 SdLazy, 1940 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 614 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred 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, 10 MinimizatonAttempts, 104 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1247 ConstructedInterpolants, 0 QuantifiedInterpolants, 220799 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1392 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 3044/3656 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...