./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_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 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-2e94e6a [2018-12-31 09:53:45,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:53:45,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:53:45,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:53:45,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:53:45,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:53:45,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:53:45,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:53:45,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:53:45,136 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:53:45,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:53:45,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:53:45,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:53:45,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:53:45,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:53:45,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:53:45,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:53:45,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:53:45,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:53:45,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:53:45,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:53:45,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:53:45,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:53:45,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:53:45,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:53:45,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:53:45,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:53:45,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:53:45,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:53:45,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:53:45,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:53:45,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:53:45,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:53:45,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:53:45,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:53:45,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:53:45,194 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:53:45,216 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:53:45,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:53:45,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:53:45,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:53:45,227 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:53:45,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:53:45,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:53:45,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:53:45,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:53:45,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:53:45,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:53:45,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:53:45,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:53:45,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:53:45,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:53:45,232 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:53:45,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:53:45,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:53:45,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:53:45,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:53:45,233 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:53:45,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:53:45,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:53:45,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:53:45,235 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:53:45,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:53:45,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:53:45,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:53:45,235 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 -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2018-12-31 09:53:45,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:53:45,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:53:45,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:53:45,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:53:45,313 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:53:45,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2018-12-31 09:53:45,387 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb22b743/d3c091a96f314469a4bbe879df21f9ec/FLAG83c3f4cb6 [2018-12-31 09:53:45,923 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:53:45,924 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2018-12-31 09:53:45,930 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb22b743/d3c091a96f314469a4bbe879df21f9ec/FLAG83c3f4cb6 [2018-12-31 09:53:46,282 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb22b743/d3c091a96f314469a4bbe879df21f9ec [2018-12-31 09:53:46,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:53:46,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:53:46,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:53:46,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:53:46,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:53:46,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ae9851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46, skipping insertion in model container [2018-12-31 09:53:46,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:53:46,331 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:53:46,580 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:53:46,592 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:53:46,616 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:53:46,636 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:53:46,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46 WrapperNode [2018-12-31 09:53:46,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:53:46,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:53:46,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:53:46,639 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:53:46,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:53:46,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:53:46,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:53:46,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:53:46,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (1/1) ... [2018-12-31 09:53:46,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:53:46,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:53:46,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:53:46,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:53:46,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (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-12-31 09:53:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:53:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:53:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-12-31 09:53:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-12-31 09:53:47,090 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:53:47,091 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:53:47,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:47 BoogieIcfgContainer [2018-12-31 09:53:47,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:53:47,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:53:47,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:53:47,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:53:47,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:53:46" (1/3) ... [2018-12-31 09:53:47,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eeaa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:53:47, skipping insertion in model container [2018-12-31 09:53:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:53:46" (2/3) ... [2018-12-31 09:53:47,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eeaa67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:53:47, skipping insertion in model container [2018-12-31 09:53:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:47" (3/3) ... [2018-12-31 09:53:47,101 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5_false-unreach-call_true-termination.c [2018-12-31 09:53:47,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:53:47,146 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:53:47,203 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:53:47,269 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:53:47,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:53:47,270 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:53:47,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:53:47,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:53:47,271 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:53:47,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:53:47,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:53:47,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:53:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-31 09:53:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:53:47,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:47,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:47,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:47,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2018-12-31 09:53:47,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:47,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:53:47,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:53:47,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:53:47,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:53:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:53:47,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:53:47,573 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-12-31 09:53:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:47,734 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-12-31 09:53:47,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:53:47,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:53:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:47,747 INFO L225 Difference]: With dead ends: 29 [2018-12-31 09:53:47,747 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 09:53:47,751 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-12-31 09:53:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 09:53:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 09:53:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:53:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:53:47,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2018-12-31 09:53:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:47,800 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:53:47,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:53:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:53:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:53:47,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:47,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:47,804 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2018-12-31 09:53:47,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:47,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:53:47,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:53:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:53:47,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:53:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:53:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:53:47,876 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2018-12-31 09:53:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:48,129 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-31 09:53:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:53:48,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:53:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:48,132 INFO L225 Difference]: With dead ends: 23 [2018-12-31 09:53:48,132 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:53:48,134 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-12-31 09:53:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:53:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-31 09:53:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:53:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:53:48,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-12-31 09:53:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:48,142 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:53:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:53:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:53:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:53:48,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:48,144 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:48,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:48,146 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2018-12-31 09:53:48,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:48,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:48,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:48,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:53:48,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:48,355 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-12-31 09:53:48,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:48,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:53:48,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:48,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 09:53:48,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:53:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:53:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:53:48,532 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2018-12-31 09:53:48,768 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-12-31 09:53:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:48,941 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-12-31 09:53:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:53:48,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 09:53:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:48,944 INFO L225 Difference]: With dead ends: 34 [2018-12-31 09:53:48,945 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:53:48,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:53:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:53:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 09:53:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 09:53:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-31 09:53:48,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2018-12-31 09:53:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:48,954 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-31 09:53:48,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:53:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-31 09:53:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:53:48,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:48,956 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:48,956 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2018-12-31 09:53:48,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:48,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:48,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:53:49,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:49,096 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-12-31 09:53:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:49,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:53:49,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:49,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:53:49,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:53:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:53:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:53:49,193 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2018-12-31 09:53:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:49,502 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2018-12-31 09:53:49,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:53:49,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-31 09:53:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:49,504 INFO L225 Difference]: With dead ends: 28 [2018-12-31 09:53:49,505 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 09:53:49,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:53:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 09:53:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-31 09:53:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 09:53:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-31 09:53:49,515 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2018-12-31 09:53:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:49,515 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-31 09:53:49,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:53:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-12-31 09:53:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:53:49,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:49,518 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:49,518 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash 645818342, now seen corresponding path program 2 times [2018-12-31 09:53:49,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:49,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:49,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:49,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:49,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-31 09:53:49,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:49,732 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-12-31 09:53:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:53:49,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:53:49,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:49,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 09:53:49,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:49,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-12-31 09:53:49,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:53:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:53:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:53:49,869 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2018-12-31 09:53:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:50,162 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2018-12-31 09:53:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:53:50,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-31 09:53:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:50,167 INFO L225 Difference]: With dead ends: 36 [2018-12-31 09:53:50,167 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 09:53:50,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:53:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 09:53:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-12-31 09:53:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 09:53:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-12-31 09:53:50,179 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2018-12-31 09:53:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:50,180 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-12-31 09:53:50,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:53:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2018-12-31 09:53:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 09:53:50,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:50,183 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:50,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1193104726, now seen corresponding path program 3 times [2018-12-31 09:53:50,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:50,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:50,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-12-31 09:53:50,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:50,443 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-12-31 09:53:50,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:53:50,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 09:53:50,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:50,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 130 proven. 12 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-31 09:53:50,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:50,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-31 09:53:50,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 09:53:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 09:53:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:53:50,659 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 11 states. [2018-12-31 09:53:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:51,041 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2018-12-31 09:53:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:53:51,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-12-31 09:53:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:51,045 INFO L225 Difference]: With dead ends: 61 [2018-12-31 09:53:51,045 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:53:51,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:53:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:53:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-31 09:53:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 09:53:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-12-31 09:53:51,057 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 77 [2018-12-31 09:53:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:51,058 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-31 09:53:51,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 09:53:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2018-12-31 09:53:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 09:53:51,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:51,064 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:51,065 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2018-12-31 09:53:51,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:51,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-12-31 09:53:51,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:51,488 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-12-31 09:53:51,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:53:51,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:53:51,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:51,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-31 09:53:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:51,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-12-31 09:53:51,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 09:53:51,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 09:53:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:53:51,770 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 19 states. [2018-12-31 09:53:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:52,868 INFO L93 Difference]: Finished difference Result 68 states and 148 transitions. [2018-12-31 09:53:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 09:53:52,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-12-31 09:53:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:52,874 INFO L225 Difference]: With dead ends: 68 [2018-12-31 09:53:52,874 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 09:53:52,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-12-31 09:53:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 09:53:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2018-12-31 09:53:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:53:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-12-31 09:53:52,909 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 78 [2018-12-31 09:53:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:52,909 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2018-12-31 09:53:52,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 09:53:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2018-12-31 09:53:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-31 09:53:52,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:52,920 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:52,920 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash -481968661, now seen corresponding path program 5 times [2018-12-31 09:53:52,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:52,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:52,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 254 proven. 314 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2018-12-31 09:53:53,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:53,150 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-12-31 09:53:53,162 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:53:53,259 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-31 09:53:53,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:53,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1139 proven. 17 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2018-12-31 09:53:53,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:53,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-31 09:53:53,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 09:53:53,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 09:53:53,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:53:53,365 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 12 states. [2018-12-31 09:53:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:53,751 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2018-12-31 09:53:53,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:53:53,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2018-12-31 09:53:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:53,754 INFO L225 Difference]: With dead ends: 84 [2018-12-31 09:53:53,754 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 09:53:53,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:53:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 09:53:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-12-31 09:53:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 09:53:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-12-31 09:53:53,766 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 188 [2018-12-31 09:53:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:53,767 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2018-12-31 09:53:53,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 09:53:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2018-12-31 09:53:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-31 09:53:53,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:53,771 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 27, 15, 15, 15, 15, 15, 15, 15, 12, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:53,771 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash 938563531, now seen corresponding path program 6 times [2018-12-31 09:53:53,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:53,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:53,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 217 proven. 331 refuted. 0 times theorem prover too weak. 2083 trivial. 0 not checked. [2018-12-31 09:53:54,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:54,347 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-12-31 09:53:54,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 09:53:54,529 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-12-31 09:53:54,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:53:54,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 1174 proven. 4 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2018-12-31 09:53:54,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:54,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:53:54,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:53:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:53:54,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:53:54,655 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand 7 states. [2018-12-31 09:53:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:54,940 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2018-12-31 09:53:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:53:54,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2018-12-31 09:53:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:54,943 INFO L225 Difference]: With dead ends: 84 [2018-12-31 09:53:54,943 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:53:54,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:53:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:53:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 09:53:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 09:53:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2018-12-31 09:53:54,952 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 216 [2018-12-31 09:53:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:54,954 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2018-12-31 09:53:54,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:53:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2018-12-31 09:53:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-31 09:53:54,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:54,957 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:54,957 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 7 times [2018-12-31 09:53:54,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:54,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:53:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 241 proven. 102 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2018-12-31 09:53:55,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:55,270 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-12-31 09:53:55,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:55,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 243 proven. 97 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2018-12-31 09:53:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2018-12-31 09:53:55,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 09:53:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 09:53:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:53:55,705 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 12 states. [2018-12-31 09:53:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:56,018 INFO L93 Difference]: Finished difference Result 61 states and 104 transitions. [2018-12-31 09:53:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:53:56,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-12-31 09:53:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:56,021 INFO L225 Difference]: With dead ends: 61 [2018-12-31 09:53:56,022 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 09:53:56,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 09:53:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-31 09:53:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 09:53:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-31 09:53:56,032 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 132 [2018-12-31 09:53:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:56,035 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-31 09:53:56,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 09:53:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-31 09:53:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 09:53:56,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:56,037 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:56,038 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:56,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 548614988, now seen corresponding path program 8 times [2018-12-31 09:53:56,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:56,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:56,124 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:53:56,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:53:56 BoogieIcfgContainer [2018-12-31 09:53:56,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:53:56,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:53:56,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:53:56,204 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:53:56,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:53:47" (3/4) ... [2018-12-31 09:53:56,210 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:53:56,326 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:53:56,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:53:56,329 INFO L168 Benchmark]: Toolchain (without parser) took 10037.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -283.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:56,330 INFO L168 Benchmark]: CDTParser took 0.16 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-12-31 09:53:56,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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-12-31 09:53:56,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.35 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-12-31 09:53:56,331 INFO L168 Benchmark]: Boogie Preprocessor took 25.57 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-12-31 09:53:56,331 INFO L168 Benchmark]: RCFGBuilder took 382.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:56,332 INFO L168 Benchmark]: TraceAbstraction took 9109.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.4 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:56,333 INFO L168 Benchmark]: Witness Printer took 122.38 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 09:53:56,337 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.16 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 346.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 44.35 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 25.57 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 382.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9109.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -142.4 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Witness Printer took 122.38 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 5; [L25] CALL, EXPR fibo(x) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 5 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. UNSAFE Result, 8.9s OverallTime, 11 OverallIterations, 31 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 206 SDslu, 345 SDs, 0 SdLazy, 721 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 789 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=8, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1545 ConstructedInterpolants, 0 QuantifiedInterpolants, 295521 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1135 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 11247/12378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...