./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-0cd3be1 [2018-11-28 10:48:25,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:48:25,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:48:25,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:48:25,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:48:25,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:48:25,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:48:25,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:48:25,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:48:25,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:48:25,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:48:25,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:48:25,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:48:25,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:48:25,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:48:25,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:48:25,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:48:25,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:48:25,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:48:25,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:48:25,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:48:25,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:48:25,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:48:25,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:48:25,344 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:48:25,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:48:25,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:48:25,346 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:48:25,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:48:25,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:48:25,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:48:25,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:48:25,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:48:25,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:48:25,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:48:25,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:48:25,352 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 10:48:25,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:48:25,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:48:25,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:48:25,362 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:48:25,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:48:25,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:48:25,363 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:48:25,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:48:25,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:48:25,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:48:25,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:48:25,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:48:25,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 10:48:25,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:48:25,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 10:48:25,366 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:48:25,366 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:48:25,367 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:48:25,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 10:48:25,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:48:25,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:48:25,367 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:48:25,367 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:48:25,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:48:25,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:48:25,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:48:25,368 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 10:48:25,368 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:48:25,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:48:25,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 10:48:25,369 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-11-28 10:48:25,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:48:25,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:48:25,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:48:25,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:48:25,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:48:25,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-28 10:48:25,469 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/data/720c14d63/792dc504550f4a25a2354dc253408b09/FLAG31d53c3f2 [2018-11-28 10:48:25,825 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:48:25,826 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-28 10:48:25,831 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/data/720c14d63/792dc504550f4a25a2354dc253408b09/FLAG31d53c3f2 [2018-11-28 10:48:26,243 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/data/720c14d63/792dc504550f4a25a2354dc253408b09 [2018-11-28 10:48:26,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:48:26,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:48:26,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:26,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:48:26,250 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:48:26,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e63e29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26, skipping insertion in model container [2018-11-28 10:48:26,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:48:26,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:48:26,398 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:26,401 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:48:26,415 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:26,426 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:48:26,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26 WrapperNode [2018-11-28 10:48:26,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:26,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:48:26,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:48:26,427 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:48:26,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:48:26,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:48:26,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:48:26,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:48:26,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... [2018-11-28 10:48:26,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:48:26,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:48:26,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:48:26,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:48:26,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/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 [2018-11-28 10:48:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:48:26,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:48:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:48:26,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:48:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:48:26,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:48:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-28 10:48:26,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-28 10:48:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-28 10:48:26,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-28 10:48:26,739 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:48:26,740 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 10:48:26,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:26 BoogieIcfgContainer [2018-11-28 10:48:26,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:48:26,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:48:26,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:48:26,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:48:26,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:48:26" (1/3) ... [2018-11-28 10:48:26,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9041c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:48:26, skipping insertion in model container [2018-11-28 10:48:26,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:26" (2/3) ... [2018-11-28 10:48:26,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9041c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:48:26, skipping insertion in model container [2018-11-28 10:48:26,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:26" (3/3) ... [2018-11-28 10:48:26,748 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-28 10:48:26,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:48:26,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 10:48:26,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 10:48:26,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:48:26,812 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:48:26,812 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 10:48:26,813 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:48:26,813 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:48:26,813 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:48:26,813 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:48:26,813 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:48:26,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:48:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-28 10:48:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 10:48:26,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:26,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:26,838 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:26,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-28 10:48:26,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:26,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:26,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:48:26,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:48:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:48:26,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:48:26,993 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-28 10:48:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:27,123 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-28 10:48:27,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:27,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 10:48:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:27,132 INFO L225 Difference]: With dead ends: 44 [2018-11-28 10:48:27,132 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 10:48:27,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 10:48:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 10:48:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 10:48:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 10:48:27,169 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-28 10:48:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:27,170 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 10:48:27,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:48:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 10:48:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 10:48:27,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:27,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:27,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:27,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-28 10:48:27,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:27,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:27,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:27,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:27,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:48:27,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:48:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:48:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:48:27,223 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-28 10:48:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:27,333 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 10:48:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:27,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 10:48:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:27,336 INFO L225 Difference]: With dead ends: 36 [2018-11-28 10:48:27,336 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 10:48:27,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 10:48:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 10:48:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 10:48:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 10:48:27,344 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-28 10:48:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:27,345 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 10:48:27,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:48:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-28 10:48:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 10:48:27,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:27,346 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:27,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:27,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-28 10:48:27,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 10:48:27,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:27,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:27,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:27,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 10:48:27,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:27,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-28 10:48:27,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 10:48:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 10:48:27,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:48:27,571 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-11-28 10:48:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:27,746 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-11-28 10:48:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:48:27,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 10:48:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:27,748 INFO L225 Difference]: With dead ends: 58 [2018-11-28 10:48:27,748 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 10:48:27,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-28 10:48:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 10:48:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-28 10:48:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 10:48:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-28 10:48:27,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-11-28 10:48:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:27,757 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 10:48:27,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 10:48:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-28 10:48:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:48:27,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:27,759 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:27,759 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:27,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-11-28 10:48:27,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:27,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:27,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 10:48:27,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:27,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:27,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:27,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 10:48:27,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:27,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 10:48:27,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:48:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:27,895 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-11-28 10:48:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:27,997 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-28 10:48:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:27,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 10:48:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:28,000 INFO L225 Difference]: With dead ends: 43 [2018-11-28 10:48:28,000 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 10:48:28,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:48:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 10:48:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-28 10:48:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 10:48:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-11-28 10:48:28,007 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-11-28 10:48:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:28,007 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-11-28 10:48:28,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:48:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-28 10:48:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 10:48:28,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:28,009 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:28,009 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:28,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-28 10:48:28,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 10:48:28,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:28,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:28,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:28,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 10:48:28,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-11-28 10:48:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 10:48:28,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 10:48:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:48:28,192 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-11-28 10:48:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:28,373 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-11-28 10:48:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:48:28,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-28 10:48:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:28,374 INFO L225 Difference]: With dead ends: 70 [2018-11-28 10:48:28,374 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 10:48:28,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-28 10:48:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 10:48:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 10:48:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 10:48:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-11-28 10:48:28,380 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-11-28 10:48:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:28,381 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-11-28 10:48:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 10:48:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-11-28 10:48:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 10:48:28,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:28,383 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:28,383 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:28,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-11-28 10:48:28,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 10:48:28,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:28,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:28,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:28,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 10:48:28,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-11-28 10:48:28,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 10:48:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 10:48:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:48:28,526 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-11-28 10:48:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:28,669 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-11-28 10:48:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:48:28,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-28 10:48:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:28,672 INFO L225 Difference]: With dead ends: 61 [2018-11-28 10:48:28,672 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 10:48:28,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 10:48:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 10:48:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-28 10:48:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 10:48:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-11-28 10:48:28,685 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-11-28 10:48:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:28,686 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-11-28 10:48:28,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 10:48:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-11-28 10:48:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 10:48:28,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:28,688 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:28,688 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:28,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-11-28 10:48:28,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:28,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:28,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 10:48:28,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:28,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:28,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:28,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 10:48:28,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:28,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-11-28 10:48:28,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 10:48:28,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 10:48:28,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:48:28,899 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-11-28 10:48:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:29,028 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-11-28 10:48:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:48:29,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-28 10:48:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:29,031 INFO L225 Difference]: With dead ends: 71 [2018-11-28 10:48:29,031 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 10:48:29,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 10:48:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 10:48:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-11-28 10:48:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 10:48:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-11-28 10:48:29,046 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-11-28 10:48:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:29,046 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-11-28 10:48:29,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 10:48:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-11-28 10:48:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 10:48:29,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:29,049 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:29,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:29,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-11-28 10:48:29,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:29,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:29,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 10:48:29,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:29,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:29,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:48:29,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:48:29,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:29,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-28 10:48:29,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 10:48:29,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 10:48:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 10:48:29,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 10:48:29,294 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-11-28 10:48:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:29,738 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-11-28 10:48:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 10:48:29,738 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-28 10:48:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:29,741 INFO L225 Difference]: With dead ends: 146 [2018-11-28 10:48:29,742 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 10:48:29,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-11-28 10:48:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 10:48:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-11-28 10:48:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 10:48:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-11-28 10:48:29,764 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-11-28 10:48:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:29,765 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-11-28 10:48:29,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 10:48:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-11-28 10:48:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-28 10:48:29,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:29,770 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 14, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:29,770 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:29,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash -894767938, now seen corresponding path program 2 times [2018-11-28 10:48:29,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:29,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:29,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:29,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:29,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 84 proven. 256 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2018-11-28 10:48:29,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:29,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:29,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:48:30,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:48:30,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:30,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 47 proven. 357 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2018-11-28 10:48:30,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:30,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-28 10:48:30,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 10:48:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 10:48:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 10:48:30,222 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-11-28 10:48:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:30,889 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-11-28 10:48:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 10:48:30,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 216 [2018-11-28 10:48:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:30,892 INFO L225 Difference]: With dead ends: 232 [2018-11-28 10:48:30,892 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 10:48:30,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 10:48:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 10:48:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-11-28 10:48:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 10:48:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-11-28 10:48:30,912 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 216 [2018-11-28 10:48:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:30,913 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-11-28 10:48:30,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 10:48:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-11-28 10:48:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-28 10:48:30,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:30,919 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 22, 22, 22, 19, 16, 16, 16, 16, 16, 16, 16, 14, 11, 11, 11, 11, 11, 11, 11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:30,919 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:30,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:30,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1497005454, now seen corresponding path program 1 times [2018-11-28 10:48:30,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:30,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:30,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:30,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 153 proven. 558 refuted. 0 times theorem prover too weak. 3427 trivial. 0 not checked. [2018-11-28 10:48:31,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:31,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 107 proven. 817 refuted. 0 times theorem prover too weak. 3214 trivial. 0 not checked. [2018-11-28 10:48:31,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:31,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-11-28 10:48:31,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 10:48:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 10:48:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-28 10:48:31,489 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-11-28 10:48:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:32,127 INFO L93 Difference]: Finished difference Result 290 states and 587 transitions. [2018-11-28 10:48:32,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 10:48:32,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 378 [2018-11-28 10:48:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:32,131 INFO L225 Difference]: With dead ends: 290 [2018-11-28 10:48:32,131 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 10:48:32,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 10:48:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 10:48:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2018-11-28 10:48:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-28 10:48:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 252 transitions. [2018-11-28 10:48:32,155 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 252 transitions. Word has length 378 [2018-11-28 10:48:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:32,155 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 252 transitions. [2018-11-28 10:48:32,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 10:48:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 252 transitions. [2018-11-28 10:48:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-11-28 10:48:32,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:32,169 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 32, 29, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 13, 10, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:32,169 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:32,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:32,169 INFO L82 PathProgramCache]: Analyzing trace with hash 580068913, now seen corresponding path program 1 times [2018-11-28 10:48:32,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:32,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8046 backedges. 704 proven. 519 refuted. 0 times theorem prover too weak. 6823 trivial. 0 not checked. [2018-11-28 10:48:32,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:32,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8046 backedges. 283 proven. 873 refuted. 0 times theorem prover too weak. 6890 trivial. 0 not checked. [2018-11-28 10:48:32,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-28 10:48:32,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 10:48:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 10:48:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-11-28 10:48:32,769 INFO L87 Difference]: Start difference. First operand 154 states and 252 transitions. Second operand 19 states. [2018-11-28 10:48:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,532 INFO L93 Difference]: Finished difference Result 415 states and 873 transitions. [2018-11-28 10:48:33,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 10:48:33,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 530 [2018-11-28 10:48:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:33,537 INFO L225 Difference]: With dead ends: 415 [2018-11-28 10:48:33,537 INFO L226 Difference]: Without dead ends: 260 [2018-11-28 10:48:33,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 10:48:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-28 10:48:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 201. [2018-11-28 10:48:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-28 10:48:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 378 transitions. [2018-11-28 10:48:33,562 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 378 transitions. Word has length 530 [2018-11-28 10:48:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:33,563 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 378 transitions. [2018-11-28 10:48:33,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 10:48:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 378 transitions. [2018-11-28 10:48:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-28 10:48:33,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:33,568 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 32, 32, 30, 29, 20, 20, 20, 20, 20, 20, 20, 16, 16, 16, 16, 16, 16, 16, 13, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,569 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:33,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1373787663, now seen corresponding path program 2 times [2018-11-28 10:48:33,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7345 backedges. 460 proven. 678 refuted. 0 times theorem prover too weak. 6207 trivial. 0 not checked. [2018-11-28 10:48:33,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:33,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:33,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:48:33,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 10:48:33,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:33,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7345 backedges. 396 proven. 760 refuted. 0 times theorem prover too weak. 6189 trivial. 0 not checked. [2018-11-28 10:48:34,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-11-28 10:48:34,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 10:48:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 10:48:34,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-11-28 10:48:34,207 INFO L87 Difference]: Start difference. First operand 201 states and 378 transitions. Second operand 20 states. [2018-11-28 10:48:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:34,777 INFO L93 Difference]: Finished difference Result 515 states and 1226 transitions. [2018-11-28 10:48:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 10:48:34,777 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 504 [2018-11-28 10:48:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:34,782 INFO L225 Difference]: With dead ends: 515 [2018-11-28 10:48:34,782 INFO L226 Difference]: Without dead ends: 234 [2018-11-28 10:48:34,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 10:48:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-28 10:48:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2018-11-28 10:48:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-28 10:48:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 420 transitions. [2018-11-28 10:48:34,804 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 420 transitions. Word has length 504 [2018-11-28 10:48:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:34,805 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 420 transitions. [2018-11-28 10:48:34,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 10:48:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 420 transitions. [2018-11-28 10:48:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-11-28 10:48:34,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:34,809 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 44, 44, 38, 36, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 16, 12, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:34,810 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:34,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -266769245, now seen corresponding path program 3 times [2018-11-28 10:48:34,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:34,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11849 backedges. 1256 proven. 482 refuted. 0 times theorem prover too weak. 10111 trivial. 0 not checked. [2018-11-28 10:48:35,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:35,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:35,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 10:48:35,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 10:48:35,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:35,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11849 backedges. 2665 proven. 34 refuted. 0 times theorem prover too weak. 9150 trivial. 0 not checked. [2018-11-28 10:48:35,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:35,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2018-11-28 10:48:35,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 10:48:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 10:48:35,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-11-28 10:48:35,505 INFO L87 Difference]: Start difference. First operand 221 states and 420 transitions. Second operand 22 states. [2018-11-28 10:48:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:35,987 INFO L93 Difference]: Finished difference Result 435 states and 887 transitions. [2018-11-28 10:48:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 10:48:35,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 639 [2018-11-28 10:48:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:35,990 INFO L225 Difference]: With dead ends: 435 [2018-11-28 10:48:35,990 INFO L226 Difference]: Without dead ends: 219 [2018-11-28 10:48:35,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 10:48:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-28 10:48:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-11-28 10:48:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-28 10:48:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 325 transitions. [2018-11-28 10:48:36,006 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 325 transitions. Word has length 639 [2018-11-28 10:48:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:36,006 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 325 transitions. [2018-11-28 10:48:36,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 10:48:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 325 transitions. [2018-11-28 10:48:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-11-28 10:48:36,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:36,009 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 28, 28, 28, 25, 18, 18, 18, 18, 18, 18, 18, 14, 14, 14, 14, 14, 14, 14, 14, 9, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,010 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:36,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1091072277, now seen corresponding path program 4 times [2018-11-28 10:48:36,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5830 backedges. 357 proven. 442 refuted. 0 times theorem prover too weak. 5031 trivial. 0 not checked. [2018-11-28 10:48:36,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:36,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:36,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 10:48:36,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 10:48:36,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:36,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5830 backedges. 285 proven. 733 refuted. 0 times theorem prover too weak. 4812 trivial. 0 not checked. [2018-11-28 10:48:36,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:36,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-28 10:48:36,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:48:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:48:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:48:36,446 INFO L87 Difference]: Start difference. First operand 216 states and 325 transitions. Second operand 17 states. [2018-11-28 10:48:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:36,823 INFO L93 Difference]: Finished difference Result 515 states and 897 transitions. [2018-11-28 10:48:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 10:48:36,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 450 [2018-11-28 10:48:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:36,826 INFO L225 Difference]: With dead ends: 515 [2018-11-28 10:48:36,826 INFO L226 Difference]: Without dead ends: 201 [2018-11-28 10:48:36,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-11-28 10:48:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-28 10:48:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2018-11-28 10:48:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-28 10:48:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2018-11-28 10:48:36,840 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 450 [2018-11-28 10:48:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:36,840 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2018-11-28 10:48:36,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:48:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2018-11-28 10:48:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-28 10:48:36,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:36,843 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 22, 22, 21, 18, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 10, 6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,843 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:36,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 939767747, now seen corresponding path program 5 times [2018-11-28 10:48:36,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:36,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 510 proven. 18 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-11-28 10:48:37,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:37,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 10:48:37,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-28 10:48:37,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:37,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1809 proven. 63 refuted. 0 times theorem prover too weak. 1351 trivial. 0 not checked. [2018-11-28 10:48:37,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:37,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-11-28 10:48:37,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 10:48:37,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 10:48:37,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-11-28 10:48:37,250 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand 18 states. [2018-11-28 10:48:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:37,693 INFO L93 Difference]: Finished difference Result 365 states and 518 transitions. [2018-11-28 10:48:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 10:48:37,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 340 [2018-11-28 10:48:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:37,696 INFO L225 Difference]: With dead ends: 365 [2018-11-28 10:48:37,696 INFO L226 Difference]: Without dead ends: 178 [2018-11-28 10:48:37,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 10:48:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-28 10:48:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-11-28 10:48:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-28 10:48:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2018-11-28 10:48:37,709 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 340 [2018-11-28 10:48:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:37,710 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2018-11-28 10:48:37,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 10:48:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2018-11-28 10:48:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-28 10:48:37,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:37,713 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:37,713 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:37,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1329598340, now seen corresponding path program 6 times [2018-11-28 10:48:37,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:37,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:37,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:37,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 673 proven. 163 refuted. 0 times theorem prover too weak. 5254 trivial. 0 not checked. [2018-11-28 10:48:37,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:37,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 10:48:37,957 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-28 10:48:37,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:48:37,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 729 proven. 107 refuted. 0 times theorem prover too weak. 5254 trivial. 0 not checked. [2018-11-28 10:48:38,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:38,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-28 10:48:38,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 10:48:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:48:38,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:48:38,080 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 12 states. [2018-11-28 10:48:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:38,255 INFO L93 Difference]: Finished difference Result 192 states and 258 transitions. [2018-11-28 10:48:38,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 10:48:38,256 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 463 [2018-11-28 10:48:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:38,259 INFO L225 Difference]: With dead ends: 192 [2018-11-28 10:48:38,259 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 10:48:38,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-28 10:48:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 10:48:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-28 10:48:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-28 10:48:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2018-11-28 10:48:38,274 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 463 [2018-11-28 10:48:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:38,275 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2018-11-28 10:48:38,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 10:48:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2018-11-28 10:48:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-28 10:48:38,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:38,278 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:38,278 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:38,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 7 times [2018-11-28 10:48:38,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:38,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:38,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 385 proven. 976 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-11-28 10:48:38,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:38,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:38,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-11-28 10:48:38,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:38,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 23 [2018-11-28 10:48:38,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 10:48:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 10:48:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-11-28 10:48:38,893 INFO L87 Difference]: Start difference. First operand 182 states and 244 transitions. Second operand 23 states. [2018-11-28 10:48:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:39,738 INFO L93 Difference]: Finished difference Result 415 states and 596 transitions. [2018-11-28 10:48:39,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 10:48:39,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 422 [2018-11-28 10:48:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:39,741 INFO L225 Difference]: With dead ends: 415 [2018-11-28 10:48:39,742 INFO L226 Difference]: Without dead ends: 230 [2018-11-28 10:48:39,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2018-11-28 10:48:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-28 10:48:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2018-11-28 10:48:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-28 10:48:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 244 transitions. [2018-11-28 10:48:39,754 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 244 transitions. Word has length 422 [2018-11-28 10:48:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 244 transitions. [2018-11-28 10:48:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 10:48:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 244 transitions. [2018-11-28 10:48:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-28 10:48:39,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:39,757 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:39,757 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 10:48:39,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 8 times [2018-11-28 10:48:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:39,834 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:48:39,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:48:39 BoogieIcfgContainer [2018-11-28 10:48:39,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:48:39,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:48:39,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:48:39,901 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:48:39,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:26" (3/4) ... [2018-11-28 10:48:39,904 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 10:48:40,000 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_34e5e9a1-fff8-46d0-920e-d62a4e3869e3/bin-2019/uautomizer/witness.graphml [2018-11-28 10:48:40,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:48:40,001 INFO L168 Benchmark]: Toolchain (without parser) took 13755.43 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 827.9 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -58.3 MB). Peak memory consumption was 769.5 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:40,003 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:48:40,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.66 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:40,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.33 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:48:40,003 INFO L168 Benchmark]: Boogie Preprocessor took 19.11 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:48:40,004 INFO L168 Benchmark]: RCFGBuilder took 272.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:40,004 INFO L168 Benchmark]: TraceAbstraction took 13159.07 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 673.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.2 MB). Peak memory consumption was 794.9 MB. Max. memory is 11.5 GB. [2018-11-28 10:48:40,004 INFO L168 Benchmark]: Witness Printer took 100.09 ms. Allocated memory is still 1.9 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:48:40,010 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.66 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.33 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.11 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 272.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13159.07 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 673.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.2 MB). Peak memory consumption was 794.9 MB. Max. memory is 11.5 GB. * Witness Printer took 100.09 ms. Allocated memory is still 1.9 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) 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); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 13.0s OverallTime, 18 OverallIterations, 49 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 995 SDslu, 3926 SDs, 0 SdLazy, 6232 SolverSat, 1096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4572 GetRequests, 4173 SyntacticMatches, 3 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 214 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 8906 NumberOfCodeBlocks, 7954 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 8411 ConstructedInterpolants, 0 QuantifiedInterpolants, 4393979 SizeOfPredicates, 86 NumberOfNonLiveVariables, 7215 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 97532/106020 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...