./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:51:11,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:51:11,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:51:11,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:51:11,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:51:11,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:51:11,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:51:11,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:51:11,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:51:11,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:51:11,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:51:11,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:51:11,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:51:11,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:51:11,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:51:11,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:51:11,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:51:11,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:51:11,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:51:11,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:51:11,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:51:11,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:51:11,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:51:11,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:51:11,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:51:11,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:51:11,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:51:11,499 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:51:11,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:51:11,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:51:11,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:51:11,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:51:11,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:51:11,501 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:51:11,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:51:11,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:51:11,503 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 05:51:11,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:51:11,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:51:11,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:51:11,513 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:51:11,514 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:51:11,514 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:51:11,514 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:51:11,514 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:51:11,514 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:51:11,514 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:51:11,514 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:51:11,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:51:11,515 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:51:11,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:51:11,515 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:51:11,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:51:11,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:51:11,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:51:11,516 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:51:11,516 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:51:11,516 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:51:11,516 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:51:11,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:51:11,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:51:11,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:51:11,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:51:11,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:51:11,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:51:11,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:51:11,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:51:11,518 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:51:11,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:51:11,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:51:11,518 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:51:11,518 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe571d33601eb001defa960d70b02ea99b59263c [2018-11-10 05:51:11,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:51:11,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:51:11,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:51:11,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:51:11,551 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:51:11,552 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-10 05:51:11,595 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/data/0273d2228/09cb197f760845699769988243411ebe/FLAGfe061ff4d [2018-11-10 05:51:11,942 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:51:11,942 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-10 05:51:11,949 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/data/0273d2228/09cb197f760845699769988243411ebe/FLAGfe061ff4d [2018-11-10 05:51:11,958 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/data/0273d2228/09cb197f760845699769988243411ebe [2018-11-10 05:51:11,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:51:11,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:51:11,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:51:11,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:51:11,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:51:11,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:51:11" (1/1) ... [2018-11-10 05:51:11,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34beab61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:11, skipping insertion in model container [2018-11-10 05:51:11,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:51:11" (1/1) ... [2018-11-10 05:51:11,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:51:11,986 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:51:12,085 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:51:12,087 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:51:12,098 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:51:12,106 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:51:12,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12 WrapperNode [2018-11-10 05:51:12,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:51:12,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:51:12,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:51:12,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:51:12,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:51:12,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:51:12,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:51:12,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:51:12,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... [2018-11-10 05:51:12,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:51:12,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:51:12,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:51:12,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:51:12,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/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-10 05:51:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:51:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:51:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:51:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:51:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:51:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:51:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 05:51:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 05:51:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 05:51:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 05:51:12,329 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:51:12,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:51:12 BoogieIcfgContainer [2018-11-10 05:51:12,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:51:12,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:51:12,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:51:12,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:51:12,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:51:11" (1/3) ... [2018-11-10 05:51:12,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681683c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:51:12, skipping insertion in model container [2018-11-10 05:51:12,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:12" (2/3) ... [2018-11-10 05:51:12,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681683c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:51:12, skipping insertion in model container [2018-11-10 05:51:12,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:51:12" (3/3) ... [2018-11-10 05:51:12,336 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-10 05:51:12,342 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:51:12,347 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:51:12,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:51:12,381 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:51:12,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:51:12,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:51:12,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:51:12,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:51:12,381 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:51:12,381 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:51:12,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:51:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 05:51:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 05:51:12,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:12,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:12,406 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:12,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-10 05:51:12,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:12,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:12,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:12,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:12,520 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-10 05:51:12,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:12,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:51:12,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:12,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:51:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:51:12,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:51:12,533 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-10 05:51:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:12,605 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-10 05:51:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:51:12,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 05:51:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:12,614 INFO L225 Difference]: With dead ends: 44 [2018-11-10 05:51:12,614 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 05:51:12,616 INFO L605 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-10 05:51:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 05:51:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 05:51:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 05:51:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 05:51:12,647 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-10 05:51:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:12,647 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 05:51:12,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:51:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 05:51:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 05:51:12,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:12,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:12,649 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:12,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-10 05:51:12,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:12,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:12,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:12,697 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-10 05:51:12,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:12,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:51:12,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:12,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:51:12,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:51:12,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:51:12,698 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-10 05:51:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:12,769 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-10 05:51:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:51:12,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 05:51:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:12,771 INFO L225 Difference]: With dead ends: 36 [2018-11-10 05:51:12,771 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 05:51:12,772 INFO L605 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-10 05:51:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 05:51:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 05:51:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 05:51:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 05:51:12,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-10 05:51:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:12,778 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 05:51:12,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:51:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 05:51:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 05:51:12,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:12,779 INFO L375 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-10 05:51:12,779 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:12,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-10 05:51:12,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:12,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:12,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:12,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:12,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:12,852 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-10 05:51:12,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:12,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:12,853 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-10 05:51:12,854 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-10 05:51:12,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:51:12,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:51:12,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:51:12,953 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 05:51:12,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:12,957 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:51:12,993 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 05:51:12,993 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:51:13,022 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-10 05:51:13,023 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:51:13,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:51:13,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-10 05:51:13,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:13,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:51:13,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:51:13,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:51:13,024 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-10 05:51:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:13,196 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-10 05:51:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:51:13,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-10 05:51:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:13,198 INFO L225 Difference]: With dead ends: 72 [2018-11-10 05:51:13,198 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 05:51:13,199 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 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-10 05:51:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 05:51:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-10 05:51:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 05:51:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-10 05:51:13,208 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-10 05:51:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:13,208 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-10 05:51:13,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:51:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-10 05:51:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 05:51:13,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:13,210 INFO L375 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-10 05:51:13,210 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:13,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-10 05:51:13,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:13,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:13,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:13,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:13,262 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-10 05:51:13,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:13,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:13,263 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-10 05:51:13,263 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 05:51:13,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:51:13,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:51:13,279 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:51:13,279 INFO L272 AbstractInterpreter]: Visited 16 different actions 30 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 05:51:13,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:13,280 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:51:13,300 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 05:51:13,300 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:51:13,347 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-10 05:51:13,347 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:51:13,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:51:13,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-10 05:51:13,347 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:13,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:51:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:51:13,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:51:13,348 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-10 05:51:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:13,648 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-10 05:51:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:51:13,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-10 05:51:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:13,649 INFO L225 Difference]: With dead ends: 87 [2018-11-10 05:51:13,649 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 05:51:13,650 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:51:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 05:51:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 05:51:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 05:51:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-10 05:51:13,656 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-10 05:51:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:13,656 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-10 05:51:13,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:51:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-10 05:51:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 05:51:13,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:13,658 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-10 05:51:13,658 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:13,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-10 05:51:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:13,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 05:51:13,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:13,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:13,726 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:51:13,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:51:13,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:13,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/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-10 05:51:13,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:51:13,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:51:13,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 05:51:13,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:51:13,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 05:51:13,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:51:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:51:14,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:51:14,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-10 05:51:14,092 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:51:14,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:51:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:51:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:51:14,093 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-10 05:51:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:14,261 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-10 05:51:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:51:14,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-10 05:51:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:14,264 INFO L225 Difference]: With dead ends: 121 [2018-11-10 05:51:14,265 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 05:51:14,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-10 05:51:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 05:51:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-10 05:51:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 05:51:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-10 05:51:14,276 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-10 05:51:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:14,276 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-10 05:51:14,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:51:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-10 05:51:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 05:51:14,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:14,278 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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-10 05:51:14,278 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:14,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-10 05:51:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:14,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:14,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:14,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 05:51:14,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:14,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:14,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 05:51:14,331 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 05:51:14,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:51:14,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:51:14,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:51:14,350 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 05:51:14,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:14,357 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:51:14,381 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 05:51:14,381 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:51:14,444 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 05:51:14,444 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:51:14,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:51:14,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-10 05:51:14,445 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:14,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:51:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:51:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:51:14,446 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-11-10 05:51:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:14,851 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-10 05:51:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:51:14,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-10 05:51:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:14,852 INFO L225 Difference]: With dead ends: 109 [2018-11-10 05:51:14,852 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 05:51:14,852 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:51:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 05:51:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 05:51:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 05:51:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-10 05:51:14,859 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-11-10 05:51:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:14,859 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-10 05:51:14,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:51:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-10 05:51:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 05:51:14,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:14,861 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:14,861 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:14,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-11-10 05:51:14,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:14,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:14,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 05:51:14,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:14,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:14,912 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-11-10 05:51:14,913 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 05:51:14,914 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:51:14,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:51:14,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:51:14,975 INFO L272 AbstractInterpreter]: Visited 34 different actions 136 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 05:51:15,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:15,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:51:15,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:15,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/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-10 05:51:15,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:15,008 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:51:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:15,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:51:15,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:51:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 05:51:15,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:51:15,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 7 [2018-11-10 05:51:15,226 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:15,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:51:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:51:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:51:15,227 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2018-11-10 05:51:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:15,322 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-11-10 05:51:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:51:15,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-10 05:51:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:15,324 INFO L225 Difference]: With dead ends: 116 [2018-11-10 05:51:15,324 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 05:51:15,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:51:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 05:51:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-10 05:51:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 05:51:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-11-10 05:51:15,333 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 67 [2018-11-10 05:51:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:15,333 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-10 05:51:15,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:51:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2018-11-10 05:51:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 05:51:15,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:15,335 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:15,335 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:15,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:15,335 INFO L82 PathProgramCache]: Analyzing trace with hash -306833031, now seen corresponding path program 2 times [2018-11-10 05:51:15,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:15,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:15,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:15,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:15,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:51:15,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:15,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:15,387 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:51:15,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:51:15,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:15,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/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-10 05:51:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 05:51:15,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 05:51:15,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 05:51:15,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:51:15,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:51:15,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:51:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:51:15,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:51:15,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-10 05:51:15,570 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:51:15,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:51:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:51:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:51:15,571 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 7 states. [2018-11-10 05:51:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:15,615 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-10 05:51:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:51:15,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-10 05:51:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:15,616 INFO L225 Difference]: With dead ends: 85 [2018-11-10 05:51:15,616 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 05:51:15,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:51:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 05:51:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-11-10 05:51:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 05:51:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-11-10 05:51:15,626 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 68 [2018-11-10 05:51:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:15,626 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-11-10 05:51:15,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:51:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-10 05:51:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 05:51:15,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:15,628 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 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-10 05:51:15,628 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:15,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-11-10 05:51:15,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:15,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:15,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 05:51:15,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:15,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:15,709 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-10 05:51:15,709 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 05:51:15,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:51:15,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:51:15,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:51:15,727 INFO L272 AbstractInterpreter]: Visited 27 different actions 51 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 05:51:15,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:15,730 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:51:15,765 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 48.77% of their original sizes. [2018-11-10 05:51:15,765 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:51:15,956 INFO L415 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-11-10 05:51:15,956 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:51:15,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:51:15,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [11] total 32 [2018-11-10 05:51:15,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:15,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 05:51:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 05:51:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:51:15,957 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 23 states. [2018-11-10 05:51:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:17,057 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2018-11-10 05:51:17,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 05:51:17,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-11-10 05:51:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:17,058 INFO L225 Difference]: With dead ends: 134 [2018-11-10 05:51:17,058 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 05:51:17,059 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 05:51:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 05:51:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-10 05:51:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 05:51:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-11-10 05:51:17,071 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 81 [2018-11-10 05:51:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:17,071 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-11-10 05:51:17,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 05:51:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-11-10 05:51:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 05:51:17,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:17,072 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 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-10 05:51:17,072 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:17,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2018-11-10 05:51:17,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:17,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:17,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:17,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 05:51:17,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:17,158 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:17,158 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-10 05:51:17,158 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 05:51:17,160 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:51:17,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:51:17,178 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:51:17,178 INFO L272 AbstractInterpreter]: Visited 29 different actions 74 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 05:51:17,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:17,182 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:51:17,208 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 48.2% of their original sizes. [2018-11-10 05:51:17,208 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:51:17,503 INFO L415 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2018-11-10 05:51:17,503 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:51:17,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:51:17,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [11] total 38 [2018-11-10 05:51:17,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:51:17,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-10 05:51:17,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 05:51:17,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2018-11-10 05:51:17,505 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 29 states. [2018-11-10 05:51:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:19,166 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2018-11-10 05:51:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 05:51:19,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-11-10 05:51:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:19,167 INFO L225 Difference]: With dead ends: 136 [2018-11-10 05:51:19,168 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 05:51:19,168 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=2093, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 05:51:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 05:51:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-10 05:51:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 05:51:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-10 05:51:19,177 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 82 [2018-11-10 05:51:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:19,177 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-10 05:51:19,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-10 05:51:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-10 05:51:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 05:51:19,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:19,178 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:19,178 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:19,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash -46122593, now seen corresponding path program 3 times [2018-11-10 05:51:19,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:19,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-10 05:51:19,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:19,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:19,255 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:51:19,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:51:19,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:19,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/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-10 05:51:19,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 05:51:19,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 05:51:19,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 05:51:19,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:51:19,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-10 05:51:19,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:51:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-10 05:51:19,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:51:19,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2018-11-10 05:51:19,615 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:51:19,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:51:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:51:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:51:19,616 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 8 states. [2018-11-10 05:51:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:19,694 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2018-11-10 05:51:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:51:19,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-11-10 05:51:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:19,696 INFO L225 Difference]: With dead ends: 117 [2018-11-10 05:51:19,696 INFO L226 Difference]: Without dead ends: 110 [2018-11-10 05:51:19,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:51:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-10 05:51:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-11-10 05:51:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 05:51:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-11-10 05:51:19,704 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 95 [2018-11-10 05:51:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:19,705 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-11-10 05:51:19,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:51:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-11-10 05:51:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 05:51:19,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:19,706 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:19,706 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:19,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash 235412830, now seen corresponding path program 4 times [2018-11-10 05:51:19,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:19,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:19,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-10 05:51:19,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:19,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:51:19,819 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 05:51:19,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 05:51:19,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:51:19,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/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-10 05:51:19,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:19,825 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:51:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:19,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:51:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-10 05:51:19,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:51:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 20 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-11-10 05:51:20,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:51:20,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2018-11-10 05:51:20,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:51:20,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:51:20,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:51:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:51:20,138 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 13 states. [2018-11-10 05:51:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:20,361 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2018-11-10 05:51:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 05:51:20,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-11-10 05:51:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:51:20,363 INFO L225 Difference]: With dead ends: 172 [2018-11-10 05:51:20,363 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 05:51:20,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 203 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-11-10 05:51:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 05:51:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2018-11-10 05:51:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 05:51:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2018-11-10 05:51:20,372 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 108 [2018-11-10 05:51:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:51:20,373 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2018-11-10 05:51:20,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:51:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2018-11-10 05:51:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 05:51:20,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:51:20,374 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:20,374 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:51:20,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 5 times [2018-11-10 05:51:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:51:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:20,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:51:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:20,399 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 05:51:20,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:51:20 BoogieIcfgContainer [2018-11-10 05:51:20,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:51:20,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:51:20,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:51:20,422 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:51:20,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:51:12" (3/4) ... [2018-11-10 05:51:20,424 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:51:20,470 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3228a89-1637-4675-b5fa-6b559a06b9c3/bin-2019/utaipan/witness.graphml [2018-11-10 05:51:20,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:51:20,471 INFO L168 Benchmark]: Toolchain (without parser) took 8509.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 389.0 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -382.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,472 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:51:20,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 947.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,472 INFO L168 Benchmark]: Boogie Preprocessor took 10.16 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,473 INFO L168 Benchmark]: RCFGBuilder took 201.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,473 INFO L168 Benchmark]: TraceAbstraction took 8091.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -214.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,473 INFO L168 Benchmark]: Witness Printer took 48.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:51:20,475 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 11.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 947.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.16 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 201.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8091.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.0 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -214.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Witness Printer took 48.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 8.0s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 379 SDslu, 2966 SDs, 0 SdLazy, 1355 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1173 GetRequests, 950 SyntacticMatches, 31 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9470023980815365 AbsIntWeakeningRatio, 0.5683453237410072 AbsIntAvgWeakeningVarsNumRemoved, 2.9964028776978417 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 51 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1199 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1458 ConstructedInterpolants, 0 QuantifiedInterpolants, 176654 SizeOfPredicates, 18 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 2012/2278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...