./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:38:45,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:38:45,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:38:45,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:38:45,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:38:45,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:38:45,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:38:45,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:38:45,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:38:45,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:38:45,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:38:45,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:38:45,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:38:45,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:38:45,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:38:45,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:38:45,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:38:45,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:38:45,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:38:45,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:38:45,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:38:45,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:38:45,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:38:45,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:38:45,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:38:45,228 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:38:45,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:38:45,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:38:45,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:38:45,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:38:45,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:38:45,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:38:45,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:38:45,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:38:45,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:38:45,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:38:45,231 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 18:38:45,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:38:45,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:38:45,239 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:38:45,239 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:38:45,239 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:38:45,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:38:45,239 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:38:45,240 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:38:45,240 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:38:45,240 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:38:45,240 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:38:45,240 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:38:45,240 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:38:45,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:38:45,241 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:38:45,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:38:45,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:38:45,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:38:45,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:38:45,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:38:45,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:38:45,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:38:45,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:38:45,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:38:45,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:38:45,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:38:45,244 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:38:45,244 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:38:45,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:38:45,244 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 18:38:45,244 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_6aee1001-eb84-4219-90c0-21f00bf99c11/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-12-09 18:38:45,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:38:45,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:38:45,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:38:45,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:38:45,278 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:38:45,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-09 18:38:45,316 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/data/b32db59ad/e72614db723349a1a2191416e769d908/FLAGb630bbe79 [2018-12-09 18:38:45,631 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:38:45,631 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-09 18:38:45,634 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/data/b32db59ad/e72614db723349a1a2191416e769d908/FLAGb630bbe79 [2018-12-09 18:38:45,642 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/data/b32db59ad/e72614db723349a1a2191416e769d908 [2018-12-09 18:38:45,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:38:45,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:38:45,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:38:45,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:38:45,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:38:45,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59facd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45, skipping insertion in model container [2018-12-09 18:38:45,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:38:45,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:38:45,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:38:45,758 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:38:45,767 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:38:45,774 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:38:45,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45 WrapperNode [2018-12-09 18:38:45,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:38:45,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:38:45,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:38:45,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:38:45,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:38:45,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:38:45,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:38:45,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:38:45,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... [2018-12-09 18:38:45,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:38:45,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:38:45,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:38:45,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:38:45,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-09 18:38:45,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 18:38:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 18:38:45,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:38:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 18:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 18:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-09 18:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-09 18:38:45,868 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-09 18:38:45,868 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-09 18:38:45,970 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:38:45,970 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 18:38:45,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:38:45 BoogieIcfgContainer [2018-12-09 18:38:45,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:38:45,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:38:45,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:38:45,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:38:45,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:38:45" (1/3) ... [2018-12-09 18:38:45,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c19f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:38:45, skipping insertion in model container [2018-12-09 18:38:45,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:38:45" (2/3) ... [2018-12-09 18:38:45,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c19f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:38:45, skipping insertion in model container [2018-12-09 18:38:45,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:38:45" (3/3) ... [2018-12-09 18:38:45,975 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-09 18:38:45,980 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:38:45,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 18:38:45,999 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 18:38:46,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:38:46,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 18:38:46,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:38:46,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:38:46,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:38:46,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:38:46,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:38:46,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:38:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 18:38:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 18:38:46,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:46,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:46,045 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:46,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-09 18:38:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:46,152 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-09 18:38:46,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:38:46,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:38:46,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:38:46,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:38:46,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:38:46,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:38:46,165 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-09 18:38:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:46,216 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 18:38:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:38:46,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 18:38:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:46,223 INFO L225 Difference]: With dead ends: 44 [2018-12-09 18:38:46,223 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 18:38:46,225 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-09 18:38:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 18:38:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 18:38:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 18:38:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 18:38:46,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-09 18:38:46,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:46,250 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 18:38:46,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:38:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 18:38:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:38:46,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:46,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:46,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:46,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-09 18:38:46,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:46,280 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-09 18:38:46,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:38:46,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:38:46,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:38:46,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:38:46,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:38:46,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:38:46,281 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-09 18:38:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:46,316 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 18:38:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:38:46,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 18:38:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:46,318 INFO L225 Difference]: With dead ends: 36 [2018-12-09 18:38:46,318 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 18:38:46,319 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-09 18:38:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 18:38:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 18:38:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 18:38:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 18:38:46,325 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-09 18:38:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:46,325 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 18:38:46,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:38:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 18:38:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 18:38:46,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:46,326 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-09 18:38:46,326 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:46,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-09 18:38:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:46,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:46,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:46,378 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-09 18:38:46,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:46,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:46,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 18:38:46,380 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-09 18:38:46,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:38:46,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:38:46,462 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 18:38:46,462 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-09 18:38:46,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:46,468 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 18:38:46,495 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 18:38:46,495 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 18:38:46,513 INFO L418 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-12-09 18:38:46,513 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 18:38:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:38:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-12-09 18:38:46,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:38:46,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:38:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:38:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:38:46,514 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-12-09 18:38:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:46,616 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-12-09 18:38:46,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:38:46,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 18:38:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:46,616 INFO L225 Difference]: With dead ends: 72 [2018-12-09 18:38:46,616 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 18:38:46,617 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-09 18:38:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 18:38:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-09 18:38:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:38:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 18:38:46,622 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-12-09 18:38:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:46,622 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 18:38:46,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:38:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 18:38:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 18:38:46,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:46,623 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-09 18:38:46,623 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:46,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-09 18:38:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:46,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:46,675 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-09 18:38:46,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:46,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:46,676 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-09 18:38:46,676 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-09 18:38:46,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:38:46,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:38:46,801 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 18:38:46,802 INFO L272 AbstractInterpreter]: Visited 28 different actions 313 times. Never merged. Widened at 2 different actions 18 times. Performed 647 root evaluator evaluations with a maximum evaluation depth of 4. Performed 647 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 29 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-09 18:38:46,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:46,804 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 18:38:46,814 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 18:38:46,814 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 18:38:46,840 INFO L418 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-12-09 18:38:46,840 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 18:38:46,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:38:46,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 18:38:46,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:38:46,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:38:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:38:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:38:46,841 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-12-09 18:38:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:46,999 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-09 18:38:46,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:38:46,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-12-09 18:38:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:47,000 INFO L225 Difference]: With dead ends: 87 [2018-12-09 18:38:47,000 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 18:38:47,001 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-09 18:38:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 18:38:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-09 18:38:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 18:38:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-12-09 18:38:47,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-12-09 18:38:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:47,008 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-12-09 18:38:47,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:38:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-12-09 18:38:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 18:38:47,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:47,010 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-09 18:38:47,010 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-12-09 18:38:47,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:47,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:47,053 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-09 18:38:47,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:47,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:47,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:38:47,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:38:47,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:47,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-09 18:38:47,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:38:47,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:38:47,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:38:47,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:38:47,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:38:47,142 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-09 18:38:47,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:38:47,384 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-09 18:38:47,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:38:47,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-12-09 18:38:47,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:38:47,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 18:38:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 18:38:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 18:38:47,399 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-12-09 18:38:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:47,553 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-09 18:38:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:38:47,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-12-09 18:38:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:47,554 INFO L225 Difference]: With dead ends: 121 [2018-12-09 18:38:47,554 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 18:38:47,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-12-09 18:38:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 18:38:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-12-09 18:38:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 18:38:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-12-09 18:38:47,561 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-12-09 18:38:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:47,561 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-12-09 18:38:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 18:38:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-12-09 18:38:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 18:38:47,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:47,563 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-09 18:38:47,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:47,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-12-09 18:38:47,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:47,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:47,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:38:47,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:47,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:47,616 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-09 18:38:47,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:47,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:47,616 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-09 18:38:47,616 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-09 18:38:47,617 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:38:47,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:38:48,298 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 18:38:48,299 INFO L272 AbstractInterpreter]: Visited 29 different actions 4700 times. Merged at 11 different actions 1218 times. Widened at 2 different actions 234 times. Performed 10886 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10886 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 580 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-09 18:38:48,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:48,300 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 18:38:48,309 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-12-09 18:38:48,309 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 18:38:48,364 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-09 18:38:48,365 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 18:38:48,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:38:48,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-12-09 18:38:48,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:38:48,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 18:38:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 18:38:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:38:48,366 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-12-09 18:38:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:48,575 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-12-09 18:38:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:38:48,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-09 18:38:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:48,577 INFO L225 Difference]: With dead ends: 109 [2018-12-09 18:38:48,577 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 18:38:48,578 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 18:38:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 18:38:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 18:38:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 18:38:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-09 18:38:48,585 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-12-09 18:38:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:48,586 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-09 18:38:48,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 18:38:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-09 18:38:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 18:38:48,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:48,588 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:48,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:48,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-12-09 18:38:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:48,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-09 18:38:48,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:48,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:48,643 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-12-09 18:38:48,643 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-09 18:38:48,645 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:38:48,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:38:54,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:38:54,092 INFO L272 AbstractInterpreter]: Visited 34 different actions 66808 times. Merged at 14 different actions 20936 times. Widened at 4 different actions 2001 times. Performed 164394 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9083 fixpoints after 10 different actions. Largest state had 5 variables. [2018-12-09 18:38:54,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:54,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:38:54,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:54,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:38:54,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:54,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:38:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:54,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:38:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 18:38:54,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:38:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 18:38:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:38:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 18 [2018-12-09 18:38:54,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:38:54,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 18:38:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 18:38:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-09 18:38:54,618 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 12 states. [2018-12-09 18:38:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:54,767 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2018-12-09 18:38:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 18:38:54,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-09 18:38:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:54,769 INFO L225 Difference]: With dead ends: 144 [2018-12-09 18:38:54,769 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 18:38:54,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-12-09 18:38:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 18:38:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-12-09 18:38:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 18:38:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-12-09 18:38:54,777 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 67 [2018-12-09 18:38:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:54,777 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-12-09 18:38:54,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 18:38:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-12-09 18:38:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:38:54,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:54,778 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:54,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:54,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-12-09 18:38:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:54,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-09 18:38:54,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:54,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:54,919 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-12-09 18:38:54,920 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-12-09 18:38:54,921 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:38:54,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:38:55,127 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 18:38:55,127 INFO L272 AbstractInterpreter]: Visited 29 different actions 3221 times. Merged at 11 different actions 850 times. Widened at 2 different actions 130 times. Performed 7908 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7908 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 384 fixpoints after 9 different actions. Largest state had 5 variables. [2018-12-09 18:38:55,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:55,129 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 18:38:55,142 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 55.26% of their original sizes. [2018-12-09 18:38:55,143 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 18:38:55,210 INFO L418 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-12-09 18:38:55,210 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 18:38:55,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:38:55,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-12-09 18:38:55,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:38:55,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 18:38:55,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 18:38:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-09 18:38:55,211 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2018-12-09 18:38:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:55,502 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-12-09 18:38:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 18:38:55,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-12-09 18:38:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:55,502 INFO L225 Difference]: With dead ends: 136 [2018-12-09 18:38:55,502 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 18:38:55,503 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-09 18:38:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 18:38:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-09 18:38:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 18:38:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-12-09 18:38:55,512 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-12-09 18:38:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:55,512 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-12-09 18:38:55,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 18:38:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-12-09 18:38:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 18:38:55,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:55,514 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:55,514 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:55,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1708632044, now seen corresponding path program 2 times [2018-12-09 18:38:55,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:55,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:55,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 68 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-09 18:38:55,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:55,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:55,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:38:55,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:38:55,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:55,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:38:55,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:38:55,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:38:55,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:38:55,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:38:55,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:38:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 15 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-12-09 18:38:55,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:38:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-12-09 18:38:55,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:38:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 20 [2018-12-09 18:38:55,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:38:55,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 18:38:55,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 18:38:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-12-09 18:38:55,890 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 16 states. [2018-12-09 18:38:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:56,167 INFO L93 Difference]: Finished difference Result 218 states and 340 transitions. [2018-12-09 18:38:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 18:38:56,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-12-09 18:38:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:56,169 INFO L225 Difference]: With dead ends: 218 [2018-12-09 18:38:56,169 INFO L226 Difference]: Without dead ends: 147 [2018-12-09 18:38:56,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 202 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 18:38:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-09 18:38:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2018-12-09 18:38:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-09 18:38:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2018-12-09 18:38:56,178 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 108 [2018-12-09 18:38:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:56,178 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-12-09 18:38:56,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 18:38:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2018-12-09 18:38:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-09 18:38:56,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:56,180 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:56,180 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:56,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1764149606, now seen corresponding path program 3 times [2018-12-09 18:38:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:56,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:38:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:56,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 21 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2018-12-09 18:38:56,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:56,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:56,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:38:56,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:38:56,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:56,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-12-09 18:38:56,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:38:56,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:38:56,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:38:56,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:38:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:38:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 55 proven. 281 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2018-12-09 18:38:56,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:38:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 55 proven. 297 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2018-12-09 18:38:57,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:38:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 15] total 24 [2018-12-09 18:38:57,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:38:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 18:38:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 18:38:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-12-09 18:38:57,083 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand 17 states. [2018-12-09 18:38:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:57,466 INFO L93 Difference]: Finished difference Result 319 states and 576 transitions. [2018-12-09 18:38:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 18:38:57,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 188 [2018-12-09 18:38:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:57,468 INFO L225 Difference]: With dead ends: 319 [2018-12-09 18:38:57,468 INFO L226 Difference]: Without dead ends: 194 [2018-12-09 18:38:57,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 350 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 18:38:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-09 18:38:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2018-12-09 18:38:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 18:38:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2018-12-09 18:38:57,480 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 188 [2018-12-09 18:38:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:57,480 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2018-12-09 18:38:57,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 18:38:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2018-12-09 18:38:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-09 18:38:57,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:57,482 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 17, 17, 16, 14, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:57,483 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:57,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:57,483 INFO L82 PathProgramCache]: Analyzing trace with hash -321275333, now seen corresponding path program 4 times [2018-12-09 18:38:57,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:57,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:57,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:38:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:57,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 205 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-09 18:38:57,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:57,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:57,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:38:57,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:38:57,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:57,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-12-09 18:38:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:57,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:38:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:57,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:38:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 99 proven. 469 refuted. 0 times theorem prover too weak. 1239 trivial. 0 not checked. [2018-12-09 18:38:57,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:38:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 99 proven. 493 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2018-12-09 18:38:58,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:38:58,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 23 [2018-12-09 18:38:58,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:38:58,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 18:38:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 18:38:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-09 18:38:58,679 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand 16 states. [2018-12-09 18:38:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:38:58,970 INFO L93 Difference]: Finished difference Result 356 states and 720 transitions. [2018-12-09 18:38:58,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 18:38:58,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 259 [2018-12-09 18:38:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:38:58,972 INFO L225 Difference]: With dead ends: 356 [2018-12-09 18:38:58,972 INFO L226 Difference]: Without dead ends: 210 [2018-12-09 18:38:58,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 488 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 18:38:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-09 18:38:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 149. [2018-12-09 18:38:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-09 18:38:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2018-12-09 18:38:58,984 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 259 [2018-12-09 18:38:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:38:58,985 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2018-12-09 18:38:58,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 18:38:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2018-12-09 18:38:58,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-12-09 18:38:58,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:38:58,988 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 20, 20, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 8, 7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:38:58,988 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:38:58,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:38:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1869550042, now seen corresponding path program 5 times [2018-12-09 18:38:58,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:38:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:58,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:38:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:38:58,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:38:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:38:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 286 proven. 418 refuted. 0 times theorem prover too weak. 2752 trivial. 0 not checked. [2018-12-09 18:38:59,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:59,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:38:59,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:38:59,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:38:59,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:38:59,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-12-09 18:38:59,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:38:59,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:38:59,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-09 18:38:59,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:38:59,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:38:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 524 proven. 87 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2018-12-09 18:38:59,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:38:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 528 proven. 93 refuted. 0 times theorem prover too weak. 2835 trivial. 0 not checked. [2018-12-09 18:38:59,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:38:59,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2018-12-09 18:38:59,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:38:59,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 18:38:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 18:38:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-09 18:38:59,944 INFO L87 Difference]: Start difference. First operand 149 states and 223 transitions. Second operand 18 states. [2018-12-09 18:39:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:00,363 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2018-12-09 18:39:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 18:39:00,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 353 [2018-12-09 18:39:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:00,365 INFO L225 Difference]: With dead ends: 333 [2018-12-09 18:39:00,365 INFO L226 Difference]: Without dead ends: 209 [2018-12-09 18:39:00,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 684 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 18:39:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-09 18:39:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2018-12-09 18:39:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-09 18:39:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2018-12-09 18:39:00,375 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 353 [2018-12-09 18:39:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:00,376 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2018-12-09 18:39:00,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 18:39:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2018-12-09 18:39:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-09 18:39:00,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:00,377 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 19, 18, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 9, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:00,377 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:00,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash 995876244, now seen corresponding path program 6 times [2018-12-09 18:39:00,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:00,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:39:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:00,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 172 proven. 466 refuted. 0 times theorem prover too weak. 2770 trivial. 0 not checked. [2018-12-09 18:39:00,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:00,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:00,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:00,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:00,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:00,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-12-09 18:39:00,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:39:00,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:39:00,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:39:00,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:39:00,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 153 proven. 669 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2018-12-09 18:39:00,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 153 proven. 690 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2018-12-09 18:39:01,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:01,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 24 [2018-12-09 18:39:01,735 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:01,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 18:39:01,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 18:39:01,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-12-09 18:39:01,736 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand 17 states. [2018-12-09 18:39:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:02,070 INFO L93 Difference]: Finished difference Result 396 states and 709 transitions. [2018-12-09 18:39:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 18:39:02,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 350 [2018-12-09 18:39:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:02,072 INFO L225 Difference]: With dead ends: 396 [2018-12-09 18:39:02,072 INFO L226 Difference]: Without dead ends: 241 [2018-12-09 18:39:02,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 671 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 18:39:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-09 18:39:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 172. [2018-12-09 18:39:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 18:39:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2018-12-09 18:39:02,083 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 350 [2018-12-09 18:39:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:02,084 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2018-12-09 18:39:02,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 18:39:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2018-12-09 18:39:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-12-09 18:39:02,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:02,086 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 40, 40, 34, 32, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 11, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:02,086 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:02,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:02,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1215212336, now seen corresponding path program 7 times [2018-12-09 18:39:02,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:02,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:39:02,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:02,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9389 backedges. 615 proven. 1017 refuted. 0 times theorem prover too weak. 7757 trivial. 0 not checked. [2018-12-09 18:39:02,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:02,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:02,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:02,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:02,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:02,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-12-09 18:39:02,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:02,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:39:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:02,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9389 backedges. 498 proven. 1033 refuted. 0 times theorem prover too weak. 7858 trivial. 0 not checked. [2018-12-09 18:39:02,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9389 backedges. 497 proven. 1055 refuted. 0 times theorem prover too weak. 7837 trivial. 0 not checked. [2018-12-09 18:39:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:04,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 32 [2018-12-09 18:39:04,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:04,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 18:39:04,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 18:39:04,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2018-12-09 18:39:04,057 INFO L87 Difference]: Start difference. First operand 172 states and 242 transitions. Second operand 24 states. [2018-12-09 18:39:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:04,662 INFO L93 Difference]: Finished difference Result 468 states and 861 transitions. [2018-12-09 18:39:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 18:39:04,662 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 571 [2018-12-09 18:39:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:04,664 INFO L225 Difference]: With dead ends: 468 [2018-12-09 18:39:04,664 INFO L226 Difference]: Without dead ends: 229 [2018-12-09 18:39:04,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1111 SyntacticMatches, 15 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=427, Invalid=2225, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 18:39:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-09 18:39:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 214. [2018-12-09 18:39:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-09 18:39:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 300 transitions. [2018-12-09 18:39:04,676 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 300 transitions. Word has length 571 [2018-12-09 18:39:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:04,677 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 300 transitions. [2018-12-09 18:39:04,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 18:39:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 300 transitions. [2018-12-09 18:39:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-12-09 18:39:04,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:04,679 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 32, 32, 28, 27, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 16, 16, 16, 16, 12, 9, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:04,679 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:04,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash -579888235, now seen corresponding path program 8 times [2018-12-09 18:39:04,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:04,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:04,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6469 backedges. 799 proven. 167 refuted. 0 times theorem prover too weak. 5503 trivial. 0 not checked. [2018-12-09 18:39:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:04,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:04,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:04,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:04,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:04,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/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-12-09 18:39:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:39:04,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:39:04,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-09 18:39:04,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:39:04,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6469 backedges. 2840 proven. 17 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2018-12-09 18:39:04,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6469 backedges. 878 proven. 187 refuted. 0 times theorem prover too weak. 5404 trivial. 0 not checked. [2018-12-09 18:39:05,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:05,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2018-12-09 18:39:05,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:05,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 18:39:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 18:39:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-12-09 18:39:05,777 INFO L87 Difference]: Start difference. First operand 214 states and 300 transitions. Second operand 15 states. [2018-12-09 18:39:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:06,010 INFO L93 Difference]: Finished difference Result 391 states and 571 transitions. [2018-12-09 18:39:06,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 18:39:06,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 476 [2018-12-09 18:39:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:06,012 INFO L225 Difference]: With dead ends: 391 [2018-12-09 18:39:06,012 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 18:39:06,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 936 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2018-12-09 18:39:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 18:39:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-09 18:39:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-09 18:39:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 269 transitions. [2018-12-09 18:39:06,032 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 269 transitions. Word has length 476 [2018-12-09 18:39:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:06,033 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 269 transitions. [2018-12-09 18:39:06,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 18:39:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 269 transitions. [2018-12-09 18:39:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-12-09 18:39:06,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:06,038 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 39, 39, 35, 31, 22, 22, 22, 22, 22, 22, 22, 19, 19, 19, 19, 19, 19, 19, 16, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:06,039 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:06,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash 929131238, now seen corresponding path program 9 times [2018-12-09 18:39:06,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:06,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:06,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:39:06,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:06,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9416 backedges. 771 proven. 322 refuted. 0 times theorem prover too weak. 8323 trivial. 0 not checked. [2018-12-09 18:39:06,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:06,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:06,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:06,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:06,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:06,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:39:06,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:39:06,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:39:06,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:39:06,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:39:06,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9416 backedges. 587 proven. 740 refuted. 0 times theorem prover too weak. 8089 trivial. 0 not checked. [2018-12-09 18:39:06,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9416 backedges. 587 proven. 754 refuted. 0 times theorem prover too weak. 8075 trivial. 0 not checked. [2018-12-09 18:39:07,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:07,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 28 [2018-12-09 18:39:07,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:07,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 18:39:07,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 18:39:07,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-12-09 18:39:07,696 INFO L87 Difference]: Start difference. First operand 196 states and 269 transitions. Second operand 21 states. [2018-12-09 18:39:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:08,193 INFO L93 Difference]: Finished difference Result 456 states and 722 transitions. [2018-12-09 18:39:08,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 18:39:08,194 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 571 [2018-12-09 18:39:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:08,195 INFO L225 Difference]: With dead ends: 456 [2018-12-09 18:39:08,196 INFO L226 Difference]: Without dead ends: 199 [2018-12-09 18:39:08,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 1113 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1655, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 18:39:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-09 18:39:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 192. [2018-12-09 18:39:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-09 18:39:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2018-12-09 18:39:08,210 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 571 [2018-12-09 18:39:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:08,210 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2018-12-09 18:39:08,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 18:39:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2018-12-09 18:39:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-12-09 18:39:08,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:08,213 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 28, 28, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 11, 11, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:08,213 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:08,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:08,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1058491813, now seen corresponding path program 10 times [2018-12-09 18:39:08,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:08,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:39:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:08,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 950 proven. 96 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2018-12-09 18:39:08,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:08,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:08,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:08,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:08,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:08,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:39:08,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:08,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:39:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:08,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 407 proven. 622 refuted. 0 times theorem prover too weak. 5439 trivial. 0 not checked. [2018-12-09 18:39:08,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6468 backedges. 409 proven. 636 refuted. 0 times theorem prover too weak. 5423 trivial. 0 not checked. [2018-12-09 18:39:09,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:09,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 25 [2018-12-09 18:39:09,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:09,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 18:39:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 18:39:09,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-12-09 18:39:09,550 INFO L87 Difference]: Start difference. First operand 192 states and 258 transitions. Second operand 19 states. [2018-12-09 18:39:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:09,976 INFO L93 Difference]: Finished difference Result 423 states and 637 transitions. [2018-12-09 18:39:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 18:39:09,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 477 [2018-12-09 18:39:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:09,978 INFO L225 Difference]: With dead ends: 423 [2018-12-09 18:39:09,978 INFO L226 Difference]: Without dead ends: 251 [2018-12-09 18:39:09,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 930 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=1639, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 18:39:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-09 18:39:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2018-12-09 18:39:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-09 18:39:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 289 transitions. [2018-12-09 18:39:09,997 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 289 transitions. Word has length 477 [2018-12-09 18:39:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:09,998 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 289 transitions. [2018-12-09 18:39:09,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 18:39:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 289 transitions. [2018-12-09 18:39:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-12-09 18:39:10,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:10,002 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 35, 34, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 14, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:10,002 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:10,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:10,003 INFO L82 PathProgramCache]: Analyzing trace with hash -136328003, now seen corresponding path program 11 times [2018-12-09 18:39:10,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:10,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:39:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:10,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 343 proven. 1551 refuted. 0 times theorem prover too weak. 7998 trivial. 0 not checked. [2018-12-09 18:39:10,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:10,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:10,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:10,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:10,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:10,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:39:10,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:39:10,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:39:10,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-09 18:39:10,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:39:10,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1468 proven. 78 refuted. 0 times theorem prover too weak. 8346 trivial. 0 not checked. [2018-12-09 18:39:10,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1468 proven. 83 refuted. 0 times theorem prover too weak. 8341 trivial. 0 not checked. [2018-12-09 18:39:11,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 27 [2018-12-09 18:39:11,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:11,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 18:39:11,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 18:39:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-12-09 18:39:11,629 INFO L87 Difference]: Start difference. First operand 214 states and 289 transitions. Second operand 21 states. [2018-12-09 18:39:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:11,993 INFO L93 Difference]: Finished difference Result 416 states and 595 transitions. [2018-12-09 18:39:11,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 18:39:11,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 586 [2018-12-09 18:39:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:11,994 INFO L225 Difference]: With dead ends: 416 [2018-12-09 18:39:11,994 INFO L226 Difference]: Without dead ends: 235 [2018-12-09 18:39:11,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 1152 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=1586, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 18:39:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-09 18:39:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2018-12-09 18:39:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-09 18:39:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2018-12-09 18:39:12,006 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 586 [2018-12-09 18:39:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:12,006 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2018-12-09 18:39:12,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 18:39:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2018-12-09 18:39:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-12-09 18:39:12,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:12,008 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 29, 28, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 12, 10, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:12,008 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:12,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash 944348834, now seen corresponding path program 12 times [2018-12-09 18:39:12,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:12,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:39:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:12,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:39:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 1065 proven. 290 refuted. 0 times theorem prover too weak. 5485 trivial. 0 not checked. [2018-12-09 18:39:12,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:12,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:39:12,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:39:12,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:39:12,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:39:12,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:39:12,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:39:12,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:39:12,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:39:12,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:39:12,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:39:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 857 proven. 261 refuted. 0 times theorem prover too weak. 5722 trivial. 0 not checked. [2018-12-09 18:39:12,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:39:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 855 proven. 279 refuted. 0 times theorem prover too weak. 5706 trivial. 0 not checked. [2018-12-09 18:39:13,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:39:13,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16] total 28 [2018-12-09 18:39:13,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:39:13,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 18:39:13,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 18:39:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-12-09 18:39:13,541 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand 21 states. [2018-12-09 18:39:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:39:13,977 INFO L93 Difference]: Finished difference Result 500 states and 694 transitions. [2018-12-09 18:39:13,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 18:39:13,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 490 [2018-12-09 18:39:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:39:13,979 INFO L225 Difference]: With dead ends: 500 [2018-12-09 18:39:13,979 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 18:39:13,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 956 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 18:39:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 18:39:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 285. [2018-12-09 18:39:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-09 18:39:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 371 transitions. [2018-12-09 18:39:13,996 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 371 transitions. Word has length 490 [2018-12-09 18:39:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:39:13,996 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 371 transitions. [2018-12-09 18:39:13,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 18:39:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 371 transitions. [2018-12-09 18:39:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-09 18:39:13,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:39:13,998 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:39:13,999 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:39:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:39:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 13 times [2018-12-09 18:39:13,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:39:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:13,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:39:13,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:39:13,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:39:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:39:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:39:14,051 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 18:39:14,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:39:14 BoogieIcfgContainer [2018-12-09 18:39:14,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:39:14,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:39:14,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:39:14,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:39:14,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:38:45" (3/4) ... [2018-12-09 18:39:14,099 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 18:39:14,162 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6aee1001-eb84-4219-90c0-21f00bf99c11/bin-2019/utaipan/witness.graphml [2018-12-09 18:39:14,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:39:14,163 INFO L168 Benchmark]: Toolchain (without parser) took 28518.84 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 950.8 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 550.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:39:14,164 INFO L168 Benchmark]: CDTParser took 0.12 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-09 18:39:14,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:39:14,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.04 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:39:14,165 INFO L168 Benchmark]: Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:39:14,165 INFO L168 Benchmark]: RCFGBuilder took 163.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:39:14,165 INFO L168 Benchmark]: TraceAbstraction took 28126.08 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 583.6 MB. Max. memory is 11.5 GB. [2018-12-09 18:39:14,165 INFO L168 Benchmark]: Witness Printer took 65.80 ms. Allocated memory is still 3.4 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:39:14,166 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.12 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 129.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 939.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.04 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 163.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28126.08 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 583.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.80 ms. Allocated memory is still 3.4 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 28.0s OverallTime, 20 OverallIterations, 44 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 695 SDtfs, 1182 SDslu, 5547 SDs, 0 SdLazy, 6880 SolverSat, 1198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 9654 GetRequests, 8973 SyntacticMatches, 154 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3849 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.5s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8604060913705583 AbsIntWeakeningRatio, 0.5685279187817259 AbsIntAvgWeakeningVarsNumRemoved, 0.20812182741116753 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 387 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 9787 NumberOfCodeBlocks, 8523 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 13827 ConstructedInterpolants, 0 QuantifiedInterpolants, 7689424 SizeOfPredicates, 86 NumberOfNonLiveVariables, 7137 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 45 InterpolantComputations, 2 PerfectInterpolantSequences, 161932/175565 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...