./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7_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_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/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 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-10-26 22:40:10,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:40:10,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:40:10,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:40:10,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:40:10,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:40:10,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:40:10,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:40:10,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:40:10,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:40:10,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:40:10,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:40:10,776 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:40:10,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:40:10,778 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:40:10,779 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:40:10,780 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:40:10,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:40:10,783 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:40:10,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:40:10,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:40:10,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:40:10,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:40:10,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:40:10,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:40:10,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:40:10,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:40:10,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:40:10,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:40:10,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:40:10,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:40:10,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:40:10,795 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:40:10,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:40:10,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:40:10,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:40:10,797 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:40:10,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:40:10,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:40:10,809 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:40:10,809 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:40:10,809 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:40:10,810 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:40:10,810 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:40:10,810 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:40:10,810 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:40:10,811 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:40:10,811 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:40:10,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:40:10,812 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:40:10,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:40:10,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:40:10,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:40:10,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:40:10,813 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:40:10,813 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:40:10,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:40:10,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:40:10,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:40:10,816 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:40:10,816 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:40:10,816 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:40:10,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:40:10,817 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:40:10,817 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_15608c94-805f-4bb2-8f0a-64cb2492f9e8/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 -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-10-26 22:40:10,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:40:10,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:40:10,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:40:10,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:40:10,860 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:40:10,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-10-26 22:40:10,918 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/data/fe8815859/71ba125ebc1f4f2d84574f0e120bb2f0/FLAG6507b0fd1 [2018-10-26 22:40:11,260 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:40:11,261 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/sv-benchmarks/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-10-26 22:40:11,267 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/data/fe8815859/71ba125ebc1f4f2d84574f0e120bb2f0/FLAG6507b0fd1 [2018-10-26 22:40:11,277 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/data/fe8815859/71ba125ebc1f4f2d84574f0e120bb2f0 [2018-10-26 22:40:11,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:40:11,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:40:11,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:40:11,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:40:11,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:40:11,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8743a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11, skipping insertion in model container [2018-10-26 22:40:11,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:40:11,308 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:40:11,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:40:11,426 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:40:11,437 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:40:11,445 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:40:11,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11 WrapperNode [2018-10-26 22:40:11,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:40:11,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:40:11,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:40:11,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:40:11,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:40:11,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:40:11,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:40:11,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:40:11,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... [2018-10-26 22:40:11,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:40:11,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:40:11,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:40:11,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:40:11,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/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-10-26 22:40:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:40:11,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:40:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:40:11,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:40:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:40:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:40:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-10-26 22:40:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-10-26 22:40:11,802 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:40:11,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:40:11 BoogieIcfgContainer [2018-10-26 22:40:11,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:40:11,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:40:11,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:40:11,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:40:11,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:40:11" (1/3) ... [2018-10-26 22:40:11,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393d30f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:40:11, skipping insertion in model container [2018-10-26 22:40:11,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:40:11" (2/3) ... [2018-10-26 22:40:11,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393d30f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:40:11, skipping insertion in model container [2018-10-26 22:40:11,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:40:11" (3/3) ... [2018-10-26 22:40:11,808 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-10-26 22:40:11,817 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:40:11,823 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:40:11,833 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:40:11,857 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:40:11,857 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:40:11,858 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:40:11,858 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:40:11,858 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:40:11,858 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:40:11,858 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:40:11,858 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:40:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-26 22:40:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 22:40:11,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:11,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:11,882 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:11,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-10-26 22:40:11,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:11,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:11,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:11,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:11,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:40:12,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:40:12,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:40:12,199 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:40:12,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:40:12,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:40:12,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:40:12,212 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-10-26 22:40:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:12,345 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-26 22:40:12,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:40:12,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 22:40:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:12,354 INFO L225 Difference]: With dead ends: 35 [2018-10-26 22:40:12,354 INFO L226 Difference]: Without dead ends: 21 [2018-10-26 22:40:12,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:40:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-26 22:40:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-26 22:40:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 22:40:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 22:40:12,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-10-26 22:40:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:12,392 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 22:40:12,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:40:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 22:40:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 22:40:12,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:12,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:12,394 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:12,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-10-26 22:40:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:12,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:12,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:40:12,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:40:12,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:40:12,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:40:12,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:40:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:40:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:40:12,442 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-10-26 22:40:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:12,678 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-26 22:40:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:40:12,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-26 22:40:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:12,681 INFO L225 Difference]: With dead ends: 27 [2018-10-26 22:40:12,681 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 22:40:12,682 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-10-26 22:40:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 22:40:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-26 22:40:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 22:40:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 22:40:12,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-10-26 22:40:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:12,693 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 22:40:12,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:40:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 22:40:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 22:40:12,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:12,696 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:12,697 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:12,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:12,697 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-10-26 22:40:12,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:12,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:12,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:12,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:12,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:40:12,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:12,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:12,836 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-26 22:40:12,838 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [33], [34], [36], [37], [38], [39], [40], [41] [2018-10-26 22:40:12,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:40:12,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:40:13,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:40:13,006 INFO L272 AbstractInterpreter]: Visited 11 different actions 36 times. Never merged. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-26 22:40:13,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:13,018 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:40:13,069 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-10-26 22:40:13,070 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:40:13,143 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-10-26 22:40:13,144 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:40:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:40:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-10-26 22:40:13,145 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:40:13,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:40:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:40:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:40:13,146 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2018-10-26 22:40:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:13,657 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2018-10-26 22:40:13,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:40:13,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-26 22:40:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:13,658 INFO L225 Difference]: With dead ends: 54 [2018-10-26 22:40:13,658 INFO L226 Difference]: Without dead ends: 39 [2018-10-26 22:40:13,659 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-10-26 22:40:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-26 22:40:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-26 22:40:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-26 22:40:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-10-26 22:40:13,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2018-10-26 22:40:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:13,669 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-10-26 22:40:13,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:40:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-10-26 22:40:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 22:40:13,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:13,671 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:13,671 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:13,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2018-10-26 22:40:13,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:13,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:13,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:13,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:13,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 22:40:13,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:13,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:13,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:13,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:13,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:13,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/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-10-26 22:40:13,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:40:13,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:40:13,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 22:40:13,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:13,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:40:13,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:40:14,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:14,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2018-10-26 22:40:14,492 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:14,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:40:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:40:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:40:14,493 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2018-10-26 22:40:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:14,663 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2018-10-26 22:40:14,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:40:14,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-10-26 22:40:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:14,665 INFO L225 Difference]: With dead ends: 73 [2018-10-26 22:40:14,666 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 22:40:14,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:40:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 22:40:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-10-26 22:40:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-26 22:40:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-10-26 22:40:14,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 39 [2018-10-26 22:40:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:14,676 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-10-26 22:40:14,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:40:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-10-26 22:40:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 22:40:14,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:14,678 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:14,678 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:14,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 1 times [2018-10-26 22:40:14,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:14,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:40:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:14,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:40:14,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:14,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:14,744 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-10-26 22:40:14,744 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [33], [34], [36], [37], [38], [39], [40], [41] [2018-10-26 22:40:14,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:40:14,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:40:15,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:40:15,908 INFO L272 AbstractInterpreter]: Visited 22 different actions 1994 times. Merged at 8 different actions 192 times. Widened at 1 different actions 46 times. Found 36 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-26 22:40:15,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:15,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:40:15,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:15,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:40:15,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:15,962 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:40:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:16,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:40:16,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:16,459 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 22:40:16,634 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 22:40:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:40:16,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 11 [2018-10-26 22:40:16,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:16,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:40:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:40:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:40:16,782 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 7 states. [2018-10-26 22:40:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:16,871 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2018-10-26 22:40:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:40:16,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-26 22:40:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:16,874 INFO L225 Difference]: With dead ends: 70 [2018-10-26 22:40:16,874 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 22:40:16,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:40:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 22:40:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-10-26 22:40:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 22:40:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-10-26 22:40:16,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 41 [2018-10-26 22:40:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:16,885 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-10-26 22:40:16,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:40:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-10-26 22:40:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 22:40:16,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:16,886 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:16,887 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:16,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1437629917, now seen corresponding path program 2 times [2018-10-26 22:40:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:16,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 47 proven. 43 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-26 22:40:17,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:17,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:17,076 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:17,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:17,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:17,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:40:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:40:17,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:40:17,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:40:17,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:17,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 64 proven. 24 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 22:40:17,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-26 22:40:17,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:17,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 17 [2018-10-26 22:40:17,639 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:17,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:40:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:40:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:40:17,640 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 13 states. [2018-10-26 22:40:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:18,003 INFO L93 Difference]: Finished difference Result 98 states and 144 transitions. [2018-10-26 22:40:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:40:18,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-10-26 22:40:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:18,005 INFO L225 Difference]: With dead ends: 98 [2018-10-26 22:40:18,005 INFO L226 Difference]: Without dead ends: 68 [2018-10-26 22:40:18,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:40:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-26 22:40:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-10-26 22:40:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 22:40:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2018-10-26 22:40:18,018 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 67 [2018-10-26 22:40:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:18,019 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2018-10-26 22:40:18,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:40:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2018-10-26 22:40:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 22:40:18,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:18,022 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:18,022 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:18,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 3 times [2018-10-26 22:40:18,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:18,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:40:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:18,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-26 22:40:18,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:18,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:18,200 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:18,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:18,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:18,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/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-10-26 22:40:18,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:40:18,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 22:40:18,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:40:18,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:18,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-26 22:40:18,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-26 22:40:19,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 11] total 24 [2018-10-26 22:40:19,275 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:19,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 22:40:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 22:40:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-10-26 22:40:19,277 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand 19 states. [2018-10-26 22:40:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:19,692 INFO L93 Difference]: Finished difference Result 126 states and 223 transitions. [2018-10-26 22:40:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:40:19,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-10-26 22:40:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:19,695 INFO L225 Difference]: With dead ends: 126 [2018-10-26 22:40:19,696 INFO L226 Difference]: Without dead ends: 97 [2018-10-26 22:40:19,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1421, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:40:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-26 22:40:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2018-10-26 22:40:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 22:40:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2018-10-26 22:40:19,712 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 82 [2018-10-26 22:40:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:19,712 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2018-10-26 22:40:19,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 22:40:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2018-10-26 22:40:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 22:40:19,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:19,714 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:19,715 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:19,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:19,715 INFO L82 PathProgramCache]: Analyzing trace with hash -19418837, now seen corresponding path program 4 times [2018-10-26 22:40:19,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:19,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:40:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:19,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 261 proven. 28 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-10-26 22:40:19,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:19,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:19,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:19,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:19,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:19,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/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-10-26 22:40:19,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:19,846 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:40:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:19,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-26 22:40:20,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 306 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-10-26 22:40:20,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:20,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 22 [2018-10-26 22:40:20,623 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:20,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:40:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:40:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:40:20,624 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand 16 states. [2018-10-26 22:40:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:21,179 INFO L93 Difference]: Finished difference Result 145 states and 227 transitions. [2018-10-26 22:40:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:40:21,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-10-26 22:40:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:21,181 INFO L225 Difference]: With dead ends: 145 [2018-10-26 22:40:21,181 INFO L226 Difference]: Without dead ends: 88 [2018-10-26 22:40:21,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 226 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 22:40:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-26 22:40:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-10-26 22:40:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-26 22:40:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2018-10-26 22:40:21,193 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 123 [2018-10-26 22:40:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:21,193 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2018-10-26 22:40:21,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:40:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2018-10-26 22:40:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 22:40:21,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:21,196 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:21,196 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:21,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 5 times [2018-10-26 22:40:21,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:21,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:21,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:21,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:21,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-10-26 22:40:21,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:21,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:21,345 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:21,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:21,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:21,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:40:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:40:21,352 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:40:21,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-26 22:40:21,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:21,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 358 proven. 85 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-10-26 22:40:21,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 362 proven. 98 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2018-10-26 22:40:22,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:22,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2018-10-26 22:40:22,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:22,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:40:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:40:22,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:40:22,060 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand 9 states. [2018-10-26 22:40:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:22,126 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-10-26 22:40:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:40:22,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2018-10-26 22:40:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:22,128 INFO L225 Difference]: With dead ends: 92 [2018-10-26 22:40:22,128 INFO L226 Difference]: Without dead ends: 85 [2018-10-26 22:40:22,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 344 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-10-26 22:40:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-26 22:40:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-10-26 22:40:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-26 22:40:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-10-26 22:40:22,139 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 177 [2018-10-26 22:40:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:22,139 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-10-26 22:40:22,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:40:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-10-26 22:40:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 22:40:22,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:22,144 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:22,144 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:22,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 6 times [2018-10-26 22:40:22,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:22,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:40:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:22,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-10-26 22:40:22,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:22,305 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:22,306 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:22,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:22,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:22,306 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:40:22,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:40:22,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 22:40:22,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:40:22,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:22,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-10-26 22:40:22,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2018-10-26 22:40:23,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:23,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 15] total 16 [2018-10-26 22:40:23,418 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:23,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:40:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:40:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:40:23,419 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 10 states. [2018-10-26 22:40:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:23,524 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2018-10-26 22:40:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:40:23,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-10-26 22:40:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:23,526 INFO L225 Difference]: With dead ends: 104 [2018-10-26 22:40:23,526 INFO L226 Difference]: Without dead ends: 90 [2018-10-26 22:40:23,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 421 SyntacticMatches, 13 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:40:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-26 22:40:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2018-10-26 22:40:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-26 22:40:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-10-26 22:40:23,538 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 218 [2018-10-26 22:40:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:23,539 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-10-26 22:40:23,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:40:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-10-26 22:40:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-26 22:40:23,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:23,544 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:23,544 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:23,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash 96725317, now seen corresponding path program 7 times [2018-10-26 22:40:23,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:23,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:40:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:23,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 814 proven. 621 refuted. 0 times theorem prover too weak. 4079 trivial. 0 not checked. [2018-10-26 22:40:23,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:23,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:23,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:23,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:23,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:23,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:40:23,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:23,744 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:40:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:23,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 638 proven. 713 refuted. 0 times theorem prover too weak. 4163 trivial. 0 not checked. [2018-10-26 22:40:23,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:25,142 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:40:25,354 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:40:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 635 proven. 751 refuted. 0 times theorem prover too weak. 4128 trivial. 0 not checked. [2018-10-26 22:40:25,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:25,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 16] total 25 [2018-10-26 22:40:25,840 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:25,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 22:40:25,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 22:40:25,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:40:25,841 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 18 states. [2018-10-26 22:40:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:26,203 INFO L93 Difference]: Finished difference Result 176 states and 278 transitions. [2018-10-26 22:40:26,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:40:26,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 313 [2018-10-26 22:40:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:26,205 INFO L225 Difference]: With dead ends: 176 [2018-10-26 22:40:26,205 INFO L226 Difference]: Without dead ends: 81 [2018-10-26 22:40:26,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 603 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=906, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:40:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-26 22:40:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-10-26 22:40:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-26 22:40:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-10-26 22:40:26,215 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 313 [2018-10-26 22:40:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:26,216 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-10-26 22:40:26,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 22:40:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-10-26 22:40:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-26 22:40:26,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:26,217 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:26,220 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:26,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 8 times [2018-10-26 22:40:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:26,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:40:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:26,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:40:26,832 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 22:40:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 995 proven. 433 refuted. 0 times theorem prover too weak. 4611 trivial. 0 not checked. [2018-10-26 22:40:26,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:26,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:40:26,895 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:40:26,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:40:26,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:40:26,895 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:40:26,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:40:26,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:40:26,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-26 22:40:26,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:40:26,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:40:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 123 refuted. 0 times theorem prover too weak. 4729 trivial. 0 not checked. [2018-10-26 22:40:27,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:40:27,615 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:40:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 134 refuted. 0 times theorem prover too weak. 4718 trivial. 0 not checked. [2018-10-26 22:40:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:40:28,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 23 [2018-10-26 22:40:28,201 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:40:28,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 22:40:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 22:40:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:40:28,203 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 18 states. [2018-10-26 22:40:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:40:28,947 INFO L93 Difference]: Finished difference Result 152 states and 199 transitions. [2018-10-26 22:40:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 22:40:28,947 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 327 [2018-10-26 22:40:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:40:28,950 INFO L225 Difference]: With dead ends: 152 [2018-10-26 22:40:28,950 INFO L226 Difference]: Without dead ends: 85 [2018-10-26 22:40:28,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 638 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 22:40:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-26 22:40:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-26 22:40:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-26 22:40:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-10-26 22:40:28,956 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 327 [2018-10-26 22:40:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:40:28,957 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-10-26 22:40:28,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 22:40:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-10-26 22:40:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 22:40:28,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:40:28,959 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:40:28,959 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:40:28,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:40:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 9 times [2018-10-26 22:40:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:40:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:28,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:40:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:40:28,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:40:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:40:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:40:29,020 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:40:29,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:40:29 BoogieIcfgContainer [2018-10-26 22:40:29,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:40:29,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:40:29,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:40:29,059 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:40:29,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:40:11" (3/4) ... [2018-10-26 22:40:29,061 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:40:29,156 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_15608c94-805f-4bb2-8f0a-64cb2492f9e8/bin-2019/utaipan/witness.graphml [2018-10-26 22:40:29,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:40:29,159 INFO L168 Benchmark]: Toolchain (without parser) took 17879.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 443.0 MB). Free memory was 963.4 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:40:29,161 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:40:29,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.69 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:40:29,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.27 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:40:29,162 INFO L168 Benchmark]: Boogie Preprocessor took 16.83 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:40:29,163 INFO L168 Benchmark]: RCFGBuilder took 321.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:40:29,163 INFO L168 Benchmark]: TraceAbstraction took 17254.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 245.9 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:40:29,163 INFO L168 Benchmark]: Witness Printer took 99.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:40:29,164 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.69 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 952.7 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 17.27 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.83 ms. Allocated memory is still 1.0 GB. Free memory is still 952.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 321.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17254.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 245.9 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. * Witness Printer took 99.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L25] EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 17.2s OverallTime, 13 OverallIterations, 47 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 257 SDtfs, 444 SDslu, 1032 SDs, 0 SdLazy, 1554 SolverSat, 468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3009 GetRequests, 2679 SyntacticMatches, 82 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9546666666666668 AbsIntWeakeningRatio, 0.56 AbsIntAvgWeakeningVarsNumRemoved, 1.12 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 105 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 2788 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 4184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1344746 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2336 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 45087/51336 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...