./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/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 ffdaeeffc8c5fdb555812137dbba1199bd1a626d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 21:25:36,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 21:25:36,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 21:25:36,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 21:25:36,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 21:25:36,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 21:25:36,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 21:25:36,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 21:25:36,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 21:25:36,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 21:25:36,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 21:25:36,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 21:25:36,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 21:25:36,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 21:25:36,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 21:25:36,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 21:25:36,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 21:25:36,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 21:25:36,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 21:25:36,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 21:25:36,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 21:25:36,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 21:25:36,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 21:25:36,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 21:25:36,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 21:25:36,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 21:25:36,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 21:25:36,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 21:25:36,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 21:25:36,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 21:25:36,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 21:25:36,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 21:25:36,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 21:25:36,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 21:25:36,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 21:25:36,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 21:25:36,225 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 21:25:36,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 21:25:36,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 21:25:36,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 21:25:36,235 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 21:25:36,235 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 21:25:36,235 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 21:25:36,236 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 21:25:36,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 21:25:36,236 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 21:25:36,236 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 21:25:36,236 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 21:25:36,236 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 21:25:36,237 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 21:25:36,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 21:25:36,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 21:25:36,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 21:25:36,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 21:25:36,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 21:25:36,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 21:25:36,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 21:25:36,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 21:25:36,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 21:25:36,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 21:25:36,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 21:25:36,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 21:25:36,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 21:25:36,240 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 21:25:36,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 21:25:36,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 21:25:36,240 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 21:25:36,240 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_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/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 -> ffdaeeffc8c5fdb555812137dbba1199bd1a626d [2018-12-08 21:25:36,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 21:25:36,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 21:25:36,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 21:25:36,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 21:25:36,272 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 21:25:36,273 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c [2018-12-08 21:25:36,308 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/data/0f2970fb5/79f014726f854f3a869ff4d3bd991a20/FLAGf5fe097c9 [2018-12-08 21:25:36,719 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 21:25:36,719 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/sv-benchmarks/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c [2018-12-08 21:25:36,723 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/data/0f2970fb5/79f014726f854f3a869ff4d3bd991a20/FLAGf5fe097c9 [2018-12-08 21:25:36,733 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/data/0f2970fb5/79f014726f854f3a869ff4d3bd991a20 [2018-12-08 21:25:36,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 21:25:36,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 21:25:36,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 21:25:36,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 21:25:36,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 21:25:36,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9bdcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36, skipping insertion in model container [2018-12-08 21:25:36,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 21:25:36,756 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 21:25:36,854 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 21:25:36,857 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 21:25:36,868 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 21:25:36,877 INFO L195 MainTranslator]: Completed translation [2018-12-08 21:25:36,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36 WrapperNode [2018-12-08 21:25:36,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 21:25:36,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 21:25:36,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 21:25:36,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 21:25:36,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 21:25:36,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 21:25:36,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 21:25:36,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 21:25:36,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... [2018-12-08 21:25:36,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 21:25:36,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 21:25:36,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 21:25:36,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 21:25:36,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/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-12-08 21:25:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 21:25:36,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 21:25:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 21:25:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 21:25:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 21:25:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 21:25:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-08 21:25:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-08 21:25:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-08 21:25:36,965 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-08 21:25:37,049 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 21:25:37,049 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 21:25:37,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:25:37 BoogieIcfgContainer [2018-12-08 21:25:37,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 21:25:37,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 21:25:37,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 21:25:37,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 21:25:37,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:25:36" (1/3) ... [2018-12-08 21:25:37,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f074ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:25:37, skipping insertion in model container [2018-12-08 21:25:37,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:25:36" (2/3) ... [2018-12-08 21:25:37,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f074ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:25:37, skipping insertion in model container [2018-12-08 21:25:37,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:25:37" (3/3) ... [2018-12-08 21:25:37,054 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4_true-unreach-call_true-termination.c [2018-12-08 21:25:37,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 21:25:37,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 21:25:37,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 21:25:37,090 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 21:25:37,090 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 21:25:37,090 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 21:25:37,090 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 21:25:37,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 21:25:37,091 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 21:25:37,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 21:25:37,091 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 21:25:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-08 21:25:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 21:25:37,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:37,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:37,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:37,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-08 21:25:37,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 21:25:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 21:25:37,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 21:25:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 21:25:37,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 21:25:37,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 21:25:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 21:25:37,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 21:25:37,220 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-08 21:25:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:37,273 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-08 21:25:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 21:25:37,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-08 21:25:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:37,280 INFO L225 Difference]: With dead ends: 44 [2018-12-08 21:25:37,280 INFO L226 Difference]: Without dead ends: 30 [2018-12-08 21:25:37,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 21:25:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-08 21:25:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-08 21:25:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 21:25:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-08 21:25:37,306 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-08 21:25:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:37,306 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-08 21:25:37,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 21:25:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-08 21:25:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 21:25:37,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:37,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:37,308 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:37,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-08 21:25:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:37,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 21:25:37,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 21:25:37,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 21:25:37,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 21:25:37,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 21:25:37,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 21:25:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 21:25:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 21:25:37,335 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-08 21:25:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:37,372 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-08 21:25:37,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 21:25:37,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-08 21:25:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:37,373 INFO L225 Difference]: With dead ends: 36 [2018-12-08 21:25:37,374 INFO L226 Difference]: Without dead ends: 32 [2018-12-08 21:25:37,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 21:25:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-08 21:25:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-08 21:25:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 21:25:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-08 21:25:37,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-08 21:25:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:37,378 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-08 21:25:37,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 21:25:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-08 21:25:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 21:25:37,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:37,379 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:37,380 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:37,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-08 21:25:37,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 21:25:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 21:25:37,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 21:25:37,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 21:25:37,420 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-08 21:25:37,421 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-12-08 21:25:37,441 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 21:25:37,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 21:25:37,502 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 21:25:37,503 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-08 21:25:37,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,507 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 21:25:37,534 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-08 21:25:37,534 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 21:25:37,550 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-08 21:25:37,550 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 21:25:37,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 21:25:37,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-08 21:25:37,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 21:25:37,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 21:25:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 21:25:37,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 21:25:37,552 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-08 21:25:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:37,663 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-08 21:25:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 21:25:37,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-08 21:25:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:37,664 INFO L225 Difference]: With dead ends: 72 [2018-12-08 21:25:37,664 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 21:25:37,664 INFO L631 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-12-08 21:25:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 21:25:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-08 21:25:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-08 21:25:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-08 21:25:37,670 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-08 21:25:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:37,670 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-08 21:25:37,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 21:25:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-08 21:25:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 21:25:37,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:37,671 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:37,671 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:37,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-08 21:25:37,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:37,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 21:25:37,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 21:25:37,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 21:25:37,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 21:25:37,720 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-08 21:25:37,721 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-08 21:25:37,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 21:25:37,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 21:25:37,731 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 21:25:37,731 INFO L272 AbstractInterpreter]: Visited 16 different actions 25 times. Never merged. Never widened. Performed 41 root evaluator evaluations with a maximum evaluation depth of 3. Performed 41 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-08 21:25:37,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,732 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 21:25:37,744 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-08 21:25:37,745 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 21:25:37,767 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-08 21:25:37,767 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 21:25:37,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 21:25:37,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-08 21:25:37,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 21:25:37,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 21:25:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 21:25:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 21:25:37,768 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-08 21:25:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:37,939 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-08 21:25:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 21:25:37,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-08 21:25:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:37,940 INFO L225 Difference]: With dead ends: 87 [2018-12-08 21:25:37,940 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 21:25:37,940 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-08 21:25:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 21:25:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-08 21:25:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 21:25:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-08 21:25:37,946 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-08 21:25:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:37,946 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-08 21:25:37,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 21:25:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-08 21:25:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 21:25:37,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:37,947 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:37,948 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:37,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-08 21:25:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 21:25:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:37,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 21:25:37,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 21:25:37,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 21:25:37,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 21:25:37,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 21:25:37,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 21:25:37,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/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-12-08 21:25:38,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 21:25:38,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 21:25:38,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 21:25:38,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 21:25:38,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 21:25:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 21:25:38,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 21:25:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 21:25:38,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 21:25:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2018-12-08 21:25:38,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 21:25:38,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 21:25:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 21:25:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-08 21:25:38,327 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-08 21:25:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:38,477 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-08 21:25:38,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 21:25:38,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-08 21:25:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:38,479 INFO L225 Difference]: With dead ends: 121 [2018-12-08 21:25:38,479 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 21:25:38,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-12-08 21:25:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 21:25:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-08 21:25:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 21:25:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-08 21:25:38,486 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-08 21:25:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:38,486 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-08 21:25:38,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 21:25:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-08 21:25:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 21:25:38,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:38,487 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:38,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:38,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-08 21:25:38,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:38,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 21:25:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:38,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 21:25:38,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 21:25:38,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 21:25:38,529 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-08 21:25:38,529 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-08 21:25:38,530 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 21:25:38,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 21:25:38,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 21:25:38,557 INFO L272 AbstractInterpreter]: Visited 29 different actions 68 times. Never merged. Never widened. Performed 128 root evaluator evaluations with a maximum evaluation depth of 4. Performed 128 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-12-08 21:25:38,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:38,561 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 21:25:38,588 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 48.04% of their original sizes. [2018-12-08 21:25:38,589 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 21:25:38,783 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-08 21:25:38,783 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 21:25:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 21:25:38,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [7] total 32 [2018-12-08 21:25:38,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 21:25:38,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-08 21:25:38,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-08 21:25:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-12-08 21:25:38,784 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 27 states. [2018-12-08 21:25:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:39,786 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-12-08 21:25:39,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 21:25:39,786 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-12-08 21:25:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:39,787 INFO L225 Difference]: With dead ends: 127 [2018-12-08 21:25:39,787 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 21:25:39,788 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2018-12-08 21:25:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 21:25:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2018-12-08 21:25:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 21:25:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-12-08 21:25:39,795 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 55 [2018-12-08 21:25:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:39,795 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-12-08 21:25:39,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-08 21:25:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-12-08 21:25:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 21:25:39,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 21:25:39,796 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 21:25:39,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 21:25:39,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1156896337, now seen corresponding path program 1 times [2018-12-08 21:25:39,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 21:25:39,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:39,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 21:25:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 21:25:39,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 21:25:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 21:25:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 21:25:40,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 21:25:40,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 21:25:40,000 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-08 21:25:40,001 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-08 21:25:40,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 21:25:40,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 21:25:40,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 21:25:40,014 INFO L272 AbstractInterpreter]: Visited 33 different actions 83 times. Never merged. Never widened. Performed 169 root evaluator evaluations with a maximum evaluation depth of 4. Performed 169 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-12-08 21:25:40,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 21:25:40,015 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 21:25:40,038 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 50.64% of their original sizes. [2018-12-08 21:25:40,038 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 21:25:40,339 INFO L418 sIntCurrentIteration]: We unified 67 AI predicates to 67 [2018-12-08 21:25:40,339 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 21:25:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 21:25:40,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [17] total 51 [2018-12-08 21:25:40,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 21:25:40,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-08 21:25:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-08 21:25:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1184, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 21:25:40,340 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 36 states. [2018-12-08 21:25:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 21:25:41,588 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-12-08 21:25:41,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-08 21:25:41,588 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-12-08 21:25:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 21:25:41,589 INFO L225 Difference]: With dead ends: 92 [2018-12-08 21:25:41,589 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 21:25:41,590 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=3561, Unknown=0, NotChecked=0, Total=3782 [2018-12-08 21:25:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 21:25:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 21:25:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 21:25:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 21:25:41,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-12-08 21:25:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 21:25:41,590 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 21:25:41,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-08 21:25:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 21:25:41,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 21:25:41,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 21:25:41,727 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 21:25:41,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 21:25:41,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 21:25:41,727 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 21:25:41,727 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 21:25:41,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 21:25:41,727 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2018-12-08 21:25:41,727 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2018-12-08 21:25:41,727 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-12-08 21:25:41,728 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2018-12-08 21:25:41,728 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-08 21:25:41,728 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-08 21:25:41,728 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (= main_~x~0 4) [2018-12-08 21:25:41,728 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-08 21:25:41,728 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2018-12-08 21:25:41,728 INFO L451 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2018-12-08 21:25:41,728 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (not (= |fibo2_#in~n| 0)) (not (= |fibo2_#in~n| 1)) (or (not (= |fibo2_#in~n| 3)) (= fibo2_~n 3)) (<= |fibo2_#in~n| fibo2_~n) (or (not (= |fibo2_#in~n| 2)) (= fibo2_~n 2))) [2018-12-08 21:25:41,728 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-08 21:25:41,729 INFO L444 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= |fibo2_#t~ret2| 1))) (and (not (= |fibo2_#in~n| 0)) (not (= |fibo2_#in~n| 1)) (or (and (= fibo2_~n 2) .cse0) (not (= |fibo2_#in~n| 2))) (<= |fibo2_#in~n| fibo2_~n) (or (not (= |fibo2_#in~n| 3)) (and (= fibo2_~n 3) .cse0)))) [2018-12-08 21:25:41,729 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-12-08 21:25:41,729 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-12-08 21:25:41,729 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2018-12-08 21:25:41,729 INFO L448 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2018-12-08 21:25:41,729 INFO L448 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2018-12-08 21:25:41,729 INFO L451 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2018-12-08 21:25:41,729 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (or (= fibo1_~n 4) (not (= |fibo1_#in~n| 4))) (not (= |fibo1_#in~n| 1)) (or (not (= |fibo1_#in~n| 2)) (= fibo1_~n 2)) (not (= |fibo1_#in~n| 0))) [2018-12-08 21:25:41,729 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-12-08 21:25:41,730 INFO L444 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (not (= |fibo1_#in~n| 1)) (not (= |fibo1_#in~n| 0)) (or (and (= |fibo1_#t~ret0| 2) (= fibo1_~n 4)) (not (= |fibo1_#in~n| 4))) (or (not (= |fibo1_#in~n| 2)) (and (= |fibo1_#t~ret0| 1) (= fibo1_~n 2)))) [2018-12-08 21:25:41,730 INFO L448 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2018-12-08 21:25:41,730 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2018-12-08 21:25:41,730 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2018-12-08 21:25:41,730 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2018-12-08 21:25:41,730 INFO L448 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2018-12-08 21:25:41,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:25:41 BoogieIcfgContainer [2018-12-08 21:25:41,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 21:25:41,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 21:25:41,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 21:25:41,733 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 21:25:41,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:25:37" (3/4) ... [2018-12-08 21:25:41,736 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 21:25:41,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 21:25:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 21:25:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2018-12-08 21:25:41,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2018-12-08 21:25:41,743 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-08 21:25:41,743 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 21:25:41,743 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 21:25:41,773 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4ac54b37-06dd-4d3e-90b6-a8045321eaf4/bin-2019/utaipan/witness.graphml [2018-12-08 21:25:41,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 21:25:41,774 INFO L168 Benchmark]: Toolchain (without parser) took 5038.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-08 21:25:41,775 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 21:25:41,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.51 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-08 21:25:41,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.01 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 21:25:41,776 INFO L168 Benchmark]: Boogie Preprocessor took 11.78 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 21:25:41,776 INFO L168 Benchmark]: RCFGBuilder took 146.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-08 21:25:41,776 INFO L168 Benchmark]: TraceAbstraction took 4682.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.0 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2018-12-08 21:25:41,777 INFO L168 Benchmark]: Witness Printer took 40.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 21:25:41,779 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.51 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 937.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.01 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.78 ms. Allocated memory is still 1.0 GB. Free memory is still 937.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 146.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4682.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.0 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Witness Printer took 40.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 216 SDtfs, 216 SDslu, 1969 SDs, 0 SdLazy, 786 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 364 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.7581521739130439 AbsIntWeakeningRatio, 0.5652173913043478 AbsIntAvgWeakeningVarsNumRemoved, 0.6684782608695652 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 119 PreInvPairs, 126 NumberOfFragments, 131 HoareAnnotationTreeSize, 119 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 40212 SizeOfPredicates, 4 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 198/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...