./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer --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.25-f470102 [2019-12-07 17:37:15,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:37:15,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:37:15,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:37:15,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:37:15,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:37:15,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:37:15,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:37:15,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:37:15,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:37:15,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:37:15,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:37:15,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:37:15,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:37:15,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:37:15,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:37:15,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:37:15,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:37:15,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:37:15,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:37:15,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:37:15,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:37:15,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:37:15,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:37:15,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:37:15,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:37:15,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:37:15,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:37:15,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:37:15,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:37:15,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:37:15,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:37:15,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:37:15,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:37:15,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:37:15,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:37:15,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:37:15,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:37:15,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:37:15,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:37:15,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:37:15,349 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:37:15,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:37:15,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:37:15,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:37:15,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:37:15,360 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:37:15,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:37:15,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:37:15,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:37:15,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:37:15,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:37:15,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:37:15,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:37:15,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:37:15,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:37:15,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:37:15,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:37:15,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer 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 [2019-12-07 17:37:15,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:37:15,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:37:15,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:37:15,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:37:15,472 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:37:15,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-12-07 17:37:15,515 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/data/0f9917dfa/129815b5e1c7419f9cd507e0d1aceb1c/FLAG9493ea057 [2019-12-07 17:37:15,914 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:37:15,914 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-12-07 17:37:15,918 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/data/0f9917dfa/129815b5e1c7419f9cd507e0d1aceb1c/FLAG9493ea057 [2019-12-07 17:37:15,927 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/data/0f9917dfa/129815b5e1c7419f9cd507e0d1aceb1c [2019-12-07 17:37:15,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:37:15,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:37:15,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:37:15,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:37:15,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:37:15,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:37:15" (1/1) ... [2019-12-07 17:37:15,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be93b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:15, skipping insertion in model container [2019-12-07 17:37:15,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:37:15" (1/1) ... [2019-12-07 17:37:15,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:37:15,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:37:16,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:37:16,087 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:37:16,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:37:16,107 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:37:16,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16 WrapperNode [2019-12-07 17:37:16,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:37:16,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:37:16,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:37:16,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:37:16,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:37:16,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:37:16,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:37:16,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:37:16,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... [2019-12-07 17:37:16,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:37:16,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:37:16,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:37:16,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:37:16,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/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 [2019-12-07 17:37:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:37:16,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:37:16,180 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-12-07 17:37:16,180 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-12-07 17:37:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-12-07 17:37:16,181 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-12-07 17:37:16,285 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:37:16,285 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 17:37:16,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:37:16 BoogieIcfgContainer [2019-12-07 17:37:16,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:37:16,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:37:16,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:37:16,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:37:16,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:37:15" (1/3) ... [2019-12-07 17:37:16,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d094f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:37:16, skipping insertion in model container [2019-12-07 17:37:16,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:37:16" (2/3) ... [2019-12-07 17:37:16,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d094f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:37:16, skipping insertion in model container [2019-12-07 17:37:16,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:37:16" (3/3) ... [2019-12-07 17:37:16,291 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-12-07 17:37:16,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:37:16,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:37:16,308 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:37:16,323 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:37:16,323 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:37:16,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:37:16,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:37:16,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:37:16,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:37:16,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:37:16,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:37:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-12-07 17:37:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:37:16,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:16,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:16,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:16,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-12-07 17:37:16,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:16,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222919861] [2019-12-07 17:37:16,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:16,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222919861] [2019-12-07 17:37:16,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:16,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:37:16,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583736808] [2019-12-07 17:37:16,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:37:16,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:37:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:37:16,505 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-12-07 17:37:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:16,584 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-12-07 17:37:16,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:16,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 17:37:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:16,592 INFO L225 Difference]: With dead ends: 38 [2019-12-07 17:37:16,592 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 17:37:16,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:37:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 17:37:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 17:37:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 17:37:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 17:37:16,623 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-12-07 17:37:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:16,623 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 17:37:16,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:37:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 17:37:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:37:16,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:16,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:16,625 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-12-07 17:37:16,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:16,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507241754] [2019-12-07 17:37:16,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:37:16,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507241754] [2019-12-07 17:37:16,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:37:16,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:37:16,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936089174] [2019-12-07 17:37:16,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:37:16,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:16,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:37:16,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:37:16,674 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-12-07 17:37:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:16,720 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-12-07 17:37:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:37:16,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 17:37:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:16,721 INFO L225 Difference]: With dead ends: 32 [2019-12-07 17:37:16,721 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 17:37:16,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:37:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 17:37:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-12-07 17:37:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 17:37:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 17:37:16,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-12-07 17:37:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:16,728 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 17:37:16,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:37:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 17:37:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:37:16,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:16,729 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:16,729 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-12-07 17:37:16,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:16,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253415607] [2019-12-07 17:37:16,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:37:16,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253415607] [2019-12-07 17:37:16,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163007741] [2019-12-07 17:37:16,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:16,851 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:37:16,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:37:16,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:16,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-12-07 17:37:16,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844587129] [2019-12-07 17:37:16,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:37:16,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:37:16,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:37:16,901 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-12-07 17:37:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:16,999 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-12-07 17:37:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:37:16,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-07 17:37:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:17,001 INFO L225 Difference]: With dead ends: 59 [2019-12-07 17:37:17,001 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 17:37:17,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:37:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 17:37:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-12-07 17:37:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 17:37:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-12-07 17:37:17,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-12-07 17:37:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:17,008 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-12-07 17:37:17,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:37:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-12-07 17:37:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:37:17,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:17,009 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:17,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:17,210 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-12-07 17:37:17,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:17,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262193252] [2019-12-07 17:37:17,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:37:17,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262193252] [2019-12-07 17:37:17,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284691520] [2019-12-07 17:37:17,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:37:17,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:37:17,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:17,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-12-07 17:37:17,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741474411] [2019-12-07 17:37:17,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:37:17,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:37:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:37:17,376 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-12-07 17:37:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:17,507 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-12-07 17:37:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:37:17,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 17:37:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:17,511 INFO L225 Difference]: With dead ends: 55 [2019-12-07 17:37:17,511 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 17:37:17,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:37:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 17:37:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-12-07 17:37:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 17:37:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-12-07 17:37:17,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-12-07 17:37:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:17,522 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-12-07 17:37:17,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:37:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-12-07 17:37:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:37:17,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:17,524 INFO L410 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] [2019-12-07 17:37:17,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:17,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-12-07 17:37:17,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:17,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519104846] [2019-12-07 17:37:17,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:37:17,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519104846] [2019-12-07 17:37:17,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040044837] [2019-12-07 17:37:17,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:17,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:37:17,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:37:17,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:17,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-12-07 17:37:17,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381767890] [2019-12-07 17:37:17,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:37:17,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:37:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:37:17,920 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-12-07 17:37:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:18,165 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-12-07 17:37:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:37:18,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-12-07 17:37:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:18,167 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:37:18,168 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:37:18,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:37:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:37:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 17:37:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 17:37:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-12-07 17:37:18,179 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-12-07 17:37:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:18,179 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-12-07 17:37:18,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:37:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-12-07 17:37:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:37:18,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:18,181 INFO L410 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] [2019-12-07 17:37:18,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:18,382 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-12-07 17:37:18,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:18,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500535871] [2019-12-07 17:37:18,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:37:18,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500535871] [2019-12-07 17:37:18,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628172189] [2019-12-07 17:37:18,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:18,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:37:18,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:37:18,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:18,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-12-07 17:37:18,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376666208] [2019-12-07 17:37:18,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:37:18,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:37:18,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:37:18,649 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-12-07 17:37:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:18,798 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-12-07 17:37:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:37:18,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-12-07 17:37:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:18,801 INFO L225 Difference]: With dead ends: 147 [2019-12-07 17:37:18,801 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 17:37:18,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:37:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 17:37:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-12-07 17:37:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 17:37:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-12-07 17:37:18,815 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-12-07 17:37:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:18,815 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-12-07 17:37:18,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:37:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-12-07 17:37:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:37:18,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:18,818 INFO L410 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] [2019-12-07 17:37:19,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:19,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-12-07 17:37:19,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:19,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562086505] [2019-12-07 17:37:19,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:37:19,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562086505] [2019-12-07 17:37:19,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812769350] [2019-12-07 17:37:19,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:37:19,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 17:37:19,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:19,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-12-07 17:37:19,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634337550] [2019-12-07 17:37:19,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:37:19,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:37:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:37:19,257 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-12-07 17:37:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:19,556 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-12-07 17:37:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:37:19,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-12-07 17:37:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:19,559 INFO L225 Difference]: With dead ends: 164 [2019-12-07 17:37:19,559 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 17:37:19,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:37:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 17:37:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-12-07 17:37:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 17:37:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-12-07 17:37:19,576 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-12-07 17:37:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:19,577 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-12-07 17:37:19,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:37:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-12-07 17:37:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 17:37:19,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:19,581 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:19,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:19,782 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-12-07 17:37:19,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:19,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271134643] [2019-12-07 17:37:19,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 17:37:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271134643] [2019-12-07 17:37:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537372159] [2019-12-07 17:37:20,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:37:20,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:37:20,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:20,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-12-07 17:37:20,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491119240] [2019-12-07 17:37:20,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:37:20,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:20,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:37:20,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:37:20,182 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-12-07 17:37:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:20,539 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-12-07 17:37:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:37:20,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-12-07 17:37:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:20,540 INFO L225 Difference]: With dead ends: 207 [2019-12-07 17:37:20,541 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:37:20,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:37:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:37:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-12-07 17:37:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 17:37:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-12-07 17:37:20,552 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-12-07 17:37:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:20,552 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-12-07 17:37:20,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:37:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-12-07 17:37:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 17:37:20,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:20,554 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:20,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:20,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:20,756 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-12-07 17:37:20,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:20,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857322264] [2019-12-07 17:37:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 17:37:21,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857322264] [2019-12-07 17:37:21,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702541743] [2019-12-07 17:37:21,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:37:21,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-12-07 17:37:21,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:21,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2019-12-07 17:37:21,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39274509] [2019-12-07 17:37:21,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:37:21,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:21,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:37:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:37:21,093 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 20 states. [2019-12-07 17:37:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:21,403 INFO L93 Difference]: Finished difference Result 209 states and 348 transitions. [2019-12-07 17:37:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:37:21,404 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-12-07 17:37:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:21,405 INFO L225 Difference]: With dead ends: 209 [2019-12-07 17:37:21,405 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 17:37:21,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:37:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 17:37:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-12-07 17:37:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:37:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 175 transitions. [2019-12-07 17:37:21,415 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 175 transitions. Word has length 119 [2019-12-07 17:37:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:21,415 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 175 transitions. [2019-12-07 17:37:21,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:37:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 175 transitions. [2019-12-07 17:37:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 17:37:21,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:21,417 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:21,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:21,618 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash 332281067, now seen corresponding path program 2 times [2019-12-07 17:37:21,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:21,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669463773] [2019-12-07 17:37:21,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 311 proven. 245 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-12-07 17:37:22,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669463773] [2019-12-07 17:37:22,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004323917] [2019-12-07 17:37:22,038 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:22,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:37:22,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:37:22,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:37:22,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 89 proven. 154 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-12-07 17:37:22,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:22,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 29 [2019-12-07 17:37:22,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029134957] [2019-12-07 17:37:22,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 17:37:22,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 17:37:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:37:22,196 INFO L87 Difference]: Start difference. First operand 111 states and 175 transitions. Second operand 29 states. [2019-12-07 17:37:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:22,717 INFO L93 Difference]: Finished difference Result 233 states and 404 transitions. [2019-12-07 17:37:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:37:22,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 188 [2019-12-07 17:37:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:22,718 INFO L225 Difference]: With dead ends: 233 [2019-12-07 17:37:22,719 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 17:37:22,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:37:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 17:37:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-12-07 17:37:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 17:37:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2019-12-07 17:37:22,728 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 188 [2019-12-07 17:37:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:22,729 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2019-12-07 17:37:22,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 17:37:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2019-12-07 17:37:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 17:37:22,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:22,731 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:22,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:22,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 3 times [2019-12-07 17:37:22,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:22,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524027038] [2019-12-07 17:37:22,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 210 proven. 368 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-12-07 17:37:23,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524027038] [2019-12-07 17:37:23,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062934343] [2019-12-07 17:37:23,381 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:23,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 17:37:23,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:37:23,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:37:23,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 294 proven. 58 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2019-12-07 17:37:23,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:23,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 32 [2019-12-07 17:37:23,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751607846] [2019-12-07 17:37:23,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 17:37:23,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 17:37:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:37:23,540 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 32 states. [2019-12-07 17:37:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:24,313 INFO L93 Difference]: Finished difference Result 266 states and 449 transitions. [2019-12-07 17:37:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 17:37:24,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2019-12-07 17:37:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:24,316 INFO L225 Difference]: With dead ends: 266 [2019-12-07 17:37:24,316 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 17:37:24,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 17:37:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 17:37:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-12-07 17:37:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 17:37:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2019-12-07 17:37:24,331 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 214 [2019-12-07 17:37:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:24,331 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2019-12-07 17:37:24,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 17:37:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2019-12-07 17:37:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 17:37:24,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:24,334 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:24,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:24,534 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 4 times [2019-12-07 17:37:24,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:24,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101413271] [2019-12-07 17:37:24,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 145 proven. 138 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-12-07 17:37:24,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101413271] [2019-12-07 17:37:24,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686052141] [2019-12-07 17:37:24,833 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:24,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:37:24,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:37:24,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:37:24,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-12-07 17:37:24,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:24,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 25 [2019-12-07 17:37:24,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264415320] [2019-12-07 17:37:24,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 17:37:24,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:24,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 17:37:24,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:37:24,925 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand 25 states. [2019-12-07 17:37:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:25,243 INFO L93 Difference]: Finished difference Result 285 states and 429 transitions. [2019-12-07 17:37:25,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:37:25,243 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-12-07 17:37:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:25,245 INFO L225 Difference]: With dead ends: 285 [2019-12-07 17:37:25,245 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 17:37:25,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2019-12-07 17:37:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 17:37:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2019-12-07 17:37:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 17:37:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2019-12-07 17:37:25,256 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 146 [2019-12-07 17:37:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:25,257 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2019-12-07 17:37:25,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 17:37:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2019-12-07 17:37:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:37:25,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:25,259 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:37:25,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:25,460 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1338982035, now seen corresponding path program 5 times [2019-12-07 17:37:25,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:25,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607206717] [2019-12-07 17:37:25,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:37:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 202 proven. 153 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-12-07 17:37:25,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607206717] [2019-12-07 17:37:25,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137728989] [2019-12-07 17:37:25,830 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:25,885 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-12-07 17:37:25,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:37:25,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:37:25,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:37:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 135 proven. 196 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-12-07 17:37:25,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:37:25,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 28 [2019-12-07 17:37:25,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105600743] [2019-12-07 17:37:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:37:25,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:37:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:37:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:37:25,970 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand 28 states. [2019-12-07 17:37:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:37:26,314 INFO L93 Difference]: Finished difference Result 286 states and 417 transitions. [2019-12-07 17:37:26,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 17:37:26,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2019-12-07 17:37:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:37:26,316 INFO L225 Difference]: With dead ends: 286 [2019-12-07 17:37:26,316 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 17:37:26,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:37:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 17:37:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2019-12-07 17:37:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:37:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2019-12-07 17:37:26,323 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 160 [2019-12-07 17:37:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:37:26,324 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2019-12-07 17:37:26,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:37:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2019-12-07 17:37:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 17:37:26,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:37:26,325 INFO L410 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] [2019-12-07 17:37:26,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:37:26,526 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:37:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:37:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 6 times [2019-12-07 17:37:26,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:37:26,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218539886] [2019-12-07 17:37:26,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:37:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:37:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:37:26,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:37:26,561 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:37:26,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:37:26 BoogieIcfgContainer [2019-12-07 17:37:26,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:37:26,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:37:26,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:37:26,594 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:37:26,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:37:16" (3/4) ... [2019-12-07 17:37:26,596 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:37:26,649 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6f9695df-6eb6-42e5-af62-aa6bf610c872/bin/uautomizer/witness.graphml [2019-12-07 17:37:26,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:37:26,651 INFO L168 Benchmark]: Toolchain (without parser) took 10720.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.5 MB). Free memory was 944.7 MB in the beginning and 950.7 MB in the end (delta: -6.1 MB). Peak memory consumption was 242.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:26,651 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:26,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:26,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:26,651 INFO L168 Benchmark]: Boogie Preprocessor took 11.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:37:26,652 INFO L168 Benchmark]: RCFGBuilder took 145.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:26,652 INFO L168 Benchmark]: TraceAbstraction took 10306.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 962.1 MB in the end (delta: 119.4 MB). Peak memory consumption was 264.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:26,652 INFO L168 Benchmark]: Witness Printer took 55.42 ms. Allocated memory is still 1.3 GB. Free memory was 962.1 MB in the beginning and 950.7 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:37:26,653 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10306.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.1 GB in the beginning and 962.1 MB in the end (delta: 119.4 MB). Peak memory consumption was 264.6 MB. Max. memory is 11.5 GB. * Witness Printer took 55.42 ms. Allocated memory is still 1.3 GB. Free memory was 962.1 MB in the beginning and 950.7 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. 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; [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) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 10.2s, OverallIterations: 14, TraceHistogramMax: 17, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 807 SDslu, 3204 SDs, 0 SdLazy, 5689 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1685 GetRequests, 1376 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 147 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2360 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2163 ConstructedInterpolants, 0 QuantifiedInterpolants, 562203 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2164 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 6301/8076 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...