./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:10:19,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:10:19,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:10:19,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:10:19,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:10:19,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:10:19,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:10:19,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:10:19,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:10:19,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:10:19,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:10:19,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:10:19,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:10:19,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:10:19,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:10:19,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:10:19,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:10:19,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:10:19,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:10:19,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:10:19,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:10:19,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:10:19,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:10:19,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:10:19,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:10:19,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:10:19,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:10:19,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:10:19,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:10:19,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:10:19,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:10:19,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:10:19,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:10:19,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:10:19,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:10:19,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:10:19,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:10:19,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:10:19,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:10:19,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:10:19,429 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:10:19,429 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:10:19,430 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:10:19,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:10:19,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:10:19,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:10:19,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:10:19,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:10:19,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:10:19,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:10:19,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:10:19,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:10:19,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:10:19,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:10:19,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:10:19,433 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_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe571d33601eb001defa960d70b02ea99b59263c [2018-11-18 15:10:19,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:10:19,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:10:19,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:10:19,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:10:19,467 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:10:19,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-18 15:10:19,504 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/data/79ab9041a/6deb0d2d655a4c149daadaecc44d6d21/FLAG3045e8646 [2018-11-18 15:10:19,805 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:10:19,805 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/sv-benchmarks/c/recursive-simple/fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-18 15:10:19,810 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/data/79ab9041a/6deb0d2d655a4c149daadaecc44d6d21/FLAG3045e8646 [2018-11-18 15:10:19,820 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/data/79ab9041a/6deb0d2d655a4c149daadaecc44d6d21 [2018-11-18 15:10:19,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:10:19,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:10:19,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:10:19,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:10:19,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:10:19,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300c35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19, skipping insertion in model container [2018-11-18 15:10:19,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:10:19,846 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:10:19,956 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:10:19,958 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:10:19,969 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:10:19,977 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:10:19,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19 WrapperNode [2018-11-18 15:10:19,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:10:19,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:10:19,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:10:19,978 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:10:19,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:10:19,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:10:19,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:10:19,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:10:19,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:19,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:20,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... [2018-11-18 15:10:20,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:10:20,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:10:20,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:10:20,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:10:20,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:10:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:10:20,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:10:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:10:20,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:10:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:10:20,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:10:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-18 15:10:20,070 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-18 15:10:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-18 15:10:20,070 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-18 15:10:20,176 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:10:20,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:10:20 BoogieIcfgContainer [2018-11-18 15:10:20,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:10:20,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:10:20,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:10:20,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:10:20,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:10:19" (1/3) ... [2018-11-18 15:10:20,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e620e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:10:20, skipping insertion in model container [2018-11-18 15:10:20,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:10:19" (2/3) ... [2018-11-18 15:10:20,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e620e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:10:20, skipping insertion in model container [2018-11-18 15:10:20,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:10:20" (3/3) ... [2018-11-18 15:10:20,182 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5_false-unreach-call_true-termination.c [2018-11-18 15:10:20,188 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:10:20,193 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:10:20,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:10:20,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:10:20,231 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:10:20,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:10:20,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:10:20,232 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:10:20,232 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:10:20,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:10:20,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:10:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 15:10:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 15:10:20,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:20,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:20,252 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:20,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-18 15:10:20,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:20,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:20,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:10:20,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:10:20,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:10:20,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:20,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:10:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:10:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:10:20,385 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-18 15:10:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:20,451 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 15:10:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:10:20,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 15:10:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:20,458 INFO L225 Difference]: With dead ends: 44 [2018-11-18 15:10:20,459 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 15:10:20,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:10:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 15:10:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 15:10:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:10:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 15:10:20,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-18 15:10:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:20,487 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 15:10:20,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:10:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 15:10:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 15:10:20,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:20,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:20,489 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:20,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-18 15:10:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:10:20,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:10:20,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:10:20,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:20,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:10:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:10:20,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:10:20,527 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-18 15:10:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:20,592 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-18 15:10:20,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:10:20,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 15:10:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:20,594 INFO L225 Difference]: With dead ends: 36 [2018-11-18 15:10:20,594 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 15:10:20,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:10:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 15:10:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 15:10:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:10:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 15:10:20,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-18 15:10:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:20,601 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 15:10:20,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:10:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 15:10:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 15:10:20,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:20,602 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:20,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-18 15:10:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:10:20,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:20,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:20,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 15:10:20,689 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-18 15:10:20,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:10:20,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:10:20,776 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:10:20,776 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-11-18 15:10:20,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:20,781 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:10:20,817 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 15:10:20,817 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:10:20,836 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-18 15:10:20,836 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:10:20,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:10:20,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-18 15:10:20,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:20,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:10:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:10:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:10:20,838 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-18 15:10:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:20,984 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-18 15:10:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:10:20,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 15:10:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:20,986 INFO L225 Difference]: With dead ends: 72 [2018-11-18 15:10:20,986 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 15:10:20,986 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:10:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 15:10:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 15:10:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 15:10:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 15:10:20,992 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-18 15:10:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:20,992 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 15:10:20,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:10:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 15:10:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 15:10:20,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:20,993 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:20,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:20,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-18 15:10:20,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:20,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:20,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:20,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 15:10:21,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:21,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:21,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 15:10:21,048 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 15:10:21,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:10:21,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:10:21,064 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:10:21,064 INFO L272 AbstractInterpreter]: Visited 16 different actions 30 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 15:10:21,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:21,066 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:10:21,081 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 15:10:21,081 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:10:21,118 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-18 15:10:21,118 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:10:21,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:10:21,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 15:10:21,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:21,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:10:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:10:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:10:21,119 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-18 15:10:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:21,364 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-18 15:10:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:10:21,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-18 15:10:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:21,365 INFO L225 Difference]: With dead ends: 87 [2018-11-18 15:10:21,366 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 15:10:21,366 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:10:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 15:10:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 15:10:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 15:10:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-18 15:10:21,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-18 15:10:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:21,373 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-18 15:10:21,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:10:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-18 15:10:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 15:10:21,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:21,375 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:21,375 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:21,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-18 15:10:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:21,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 15:10:21,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:21,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:21,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:10:21,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:10:21,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:21,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:10:21,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:10:21,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:10:21,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 15:10:21,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:10:21,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:10:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 15:10:21,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:10:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:10:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:10:21,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-18 15:10:21,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:10:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:10:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:10:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:10:21,809 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-18 15:10:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:21,975 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-18 15:10:21,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:10:21,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-18 15:10:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:21,978 INFO L225 Difference]: With dead ends: 121 [2018-11-18 15:10:21,978 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 15:10:21,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:10:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 15:10:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-18 15:10:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 15:10:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-18 15:10:21,990 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-18 15:10:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:21,990 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-18 15:10:21,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:10:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-18 15:10:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 15:10:21,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:21,992 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:21,992 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:21,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:21,992 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-18 15:10:21,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:21,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:10:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:21,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:10:22,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:22,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:22,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 15:10:22,038 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 15:10:22,039 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:10:22,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:10:22,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:10:22,050 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 15:10:22,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:22,056 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:10:22,072 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 15:10:22,072 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:10:22,099 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 15:10:22,099 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:10:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:10:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-18 15:10:22,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:10:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:10:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:10:22,103 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-11-18 15:10:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:22,352 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-18 15:10:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:10:22,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-18 15:10:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:22,353 INFO L225 Difference]: With dead ends: 109 [2018-11-18 15:10:22,353 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 15:10:22,353 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:10:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 15:10:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-18 15:10:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 15:10:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-18 15:10:22,359 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-11-18 15:10:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:22,360 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-18 15:10:22,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:10:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-18 15:10:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 15:10:22,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:22,362 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:22,362 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-11-18 15:10:22,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:22,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:22,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:22,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:22,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 15:10:22,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:22,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:22,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-11-18 15:10:22,421 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 15:10:22,422 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:10:22,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:10:22,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:10:22,460 INFO L272 AbstractInterpreter]: Visited 34 different actions 136 times. Never merged. Never widened. Performed 279 root evaluator evaluations with a maximum evaluation depth of 4. Performed 279 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 15:10:22,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:22,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:10:22,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:22,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:10:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:22,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:10:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:22,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:10:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 15:10:22,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:10:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 15:10:22,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:10:22,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 7 [2018-11-18 15:10:22,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:22,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:10:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:10:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:10:22,615 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2018-11-18 15:10:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:22,667 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-11-18 15:10:22,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:10:22,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-18 15:10:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:22,669 INFO L225 Difference]: With dead ends: 116 [2018-11-18 15:10:22,669 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 15:10:22,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:10:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 15:10:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-18 15:10:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 15:10:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-11-18 15:10:22,675 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 67 [2018-11-18 15:10:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:22,676 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-18 15:10:22,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:10:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2018-11-18 15:10:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 15:10:22,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:22,677 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:22,677 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:22,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash -306833031, now seen corresponding path program 2 times [2018-11-18 15:10:22,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:22,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:22,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 15:10:22,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:22,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:22,737 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:10:22,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:10:22,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:22,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:10:22,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:10:22,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:10:22,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 15:10:22,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:10:22,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:10:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 15:10:22,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:10:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 15:10:22,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:10:22,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-18 15:10:22,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:10:22,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:10:22,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:10:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:10:22,940 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 7 states. [2018-11-18 15:10:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:22,997 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2018-11-18 15:10:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:10:22,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-18 15:10:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:22,998 INFO L225 Difference]: With dead ends: 85 [2018-11-18 15:10:22,998 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 15:10:22,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:10:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 15:10:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-11-18 15:10:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 15:10:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-11-18 15:10:23,007 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 68 [2018-11-18 15:10:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:23,008 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-11-18 15:10:23,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:10:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-18 15:10:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:10:23,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:23,009 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:23,009 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:23,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-11-18 15:10:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:23,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:10:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:23,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 15:10:23,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:23,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:23,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-18 15:10:23,141 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 15:10:23,142 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:10:23,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:10:23,158 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:10:23,158 INFO L272 AbstractInterpreter]: Visited 27 different actions 51 times. Never merged. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 4. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 15:10:23,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:23,160 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:10:23,184 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 48.77% of their original sizes. [2018-11-18 15:10:23,184 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:10:23,331 INFO L415 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-11-18 15:10:23,331 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:10:23,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:10:23,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [11] total 32 [2018-11-18 15:10:23,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 15:10:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 15:10:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2018-11-18 15:10:23,332 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 23 states. [2018-11-18 15:10:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:24,230 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2018-11-18 15:10:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 15:10:24,230 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-11-18 15:10:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:24,231 INFO L225 Difference]: With dead ends: 134 [2018-11-18 15:10:24,231 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 15:10:24,232 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 15:10:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 15:10:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-18 15:10:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 15:10:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-11-18 15:10:24,240 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 81 [2018-11-18 15:10:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:24,240 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-11-18 15:10:24,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 15:10:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-11-18 15:10:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 15:10:24,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:24,241 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:24,244 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:24,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2018-11-18 15:10:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:24,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 40 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 15:10:24,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:24,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:24,341 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-18 15:10:24,341 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 15:10:24,343 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:10:24,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:10:24,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:10:24,358 INFO L272 AbstractInterpreter]: Visited 29 different actions 74 times. Never merged. Never widened. Performed 146 root evaluator evaluations with a maximum evaluation depth of 4. Performed 146 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 15:10:24,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:24,360 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:10:24,380 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 48.2% of their original sizes. [2018-11-18 15:10:24,380 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:10:24,592 INFO L415 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2018-11-18 15:10:24,593 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:10:24,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:10:24,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [11] total 38 [2018-11-18 15:10:24,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:10:24,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 15:10:24,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 15:10:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2018-11-18 15:10:24,594 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 29 states. [2018-11-18 15:10:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:25,687 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2018-11-18 15:10:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 15:10:25,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-11-18 15:10:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:25,688 INFO L225 Difference]: With dead ends: 136 [2018-11-18 15:10:25,688 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 15:10:25,689 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=2093, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 15:10:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 15:10:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-18 15:10:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 15:10:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-18 15:10:25,701 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 82 [2018-11-18 15:10:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:25,701 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-18 15:10:25,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 15:10:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-18 15:10:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 15:10:25,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:25,702 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:25,703 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:25,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash -46122593, now seen corresponding path program 3 times [2018-11-18 15:10:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:25,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:25,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-18 15:10:25,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:25,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:25,753 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:10:25,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:10:25,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:25,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:10:25,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:10:25,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 15:10:25,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:10:25,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:10:25,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:10:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-18 15:10:25,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:10:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-18 15:10:26,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:10:26,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2018-11-18 15:10:26,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:10:26,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:10:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:10:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:10:26,042 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 8 states. [2018-11-18 15:10:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:26,116 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2018-11-18 15:10:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:10:26,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-11-18 15:10:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:26,117 INFO L225 Difference]: With dead ends: 117 [2018-11-18 15:10:26,117 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 15:10:26,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:10:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 15:10:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-11-18 15:10:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 15:10:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-11-18 15:10:26,124 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 95 [2018-11-18 15:10:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:26,125 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-11-18 15:10:26,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:10:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-11-18 15:10:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 15:10:26,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:26,126 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:26,126 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:26,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash 235412830, now seen corresponding path program 4 times [2018-11-18 15:10:26,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:26,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:10:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:26,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-18 15:10:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:26,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:10:26,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:10:26,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:10:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:10:26,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:10:26,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:26,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:10:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:10:26,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:10:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-18 15:10:26,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:10:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 20 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-11-18 15:10:26,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:10:26,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2018-11-18 15:10:26,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:10:26,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 15:10:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:10:26,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:10:26,544 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 13 states. [2018-11-18 15:10:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:10:26,741 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2018-11-18 15:10:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:10:26,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-11-18 15:10:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:10:26,743 INFO L225 Difference]: With dead ends: 172 [2018-11-18 15:10:26,743 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 15:10:26,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 203 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-11-18 15:10:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 15:10:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2018-11-18 15:10:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 15:10:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2018-11-18 15:10:26,752 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 108 [2018-11-18 15:10:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:10:26,752 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2018-11-18 15:10:26,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 15:10:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2018-11-18 15:10:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 15:10:26,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:10:26,754 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:10:26,754 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:10:26,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:10:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 5 times [2018-11-18 15:10:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:10:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:10:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:10:26,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:10:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:10:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:10:26,787 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 15:10:26,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:10:26 BoogieIcfgContainer [2018-11-18 15:10:26,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:10:26,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:10:26,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:10:26,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:10:26,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:10:20" (3/4) ... [2018-11-18 15:10:26,815 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 15:10:26,863 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_22de70c0-14db-4348-bebf-410a7db76d21/bin-2019/utaipan/witness.graphml [2018-11-18 15:10:26,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:10:26,864 INFO L168 Benchmark]: Toolchain (without parser) took 7041.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:10:26,865 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:10:26,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.43 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:10:26,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:10:26,866 INFO L168 Benchmark]: Boogie Preprocessor took 10.17 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:10:26,866 INFO L168 Benchmark]: RCFGBuilder took 176.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:10:26,866 INFO L168 Benchmark]: TraceAbstraction took 6633.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.8 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:10:26,867 INFO L168 Benchmark]: Witness Printer took 51.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:10:26,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.43 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.12 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.17 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6633.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.8 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * Witness Printer took 51.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 6.5s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 379 SDslu, 2966 SDs, 0 SdLazy, 1338 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1173 GetRequests, 950 SyntacticMatches, 31 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.8342326139088725 AbsIntWeakeningRatio, 0.5683453237410072 AbsIntAvgWeakeningVarsNumRemoved, 0.35611510791366907 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 51 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1199 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1458 ConstructedInterpolants, 0 QuantifiedInterpolants, 176654 SizeOfPredicates, 18 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 2012/2278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...