./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e21c3699338992ddad7e6d15f4351c8cc3315b0b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:58:00,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:58:00,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:58:00,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:58:00,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:58:00,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:58:00,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:58:00,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:58:00,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:58:00,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:58:00,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:58:00,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:58:00,255 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:58:00,256 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:58:00,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:58:00,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:58:00,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:58:00,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:58:00,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:58:00,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:58:00,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:58:00,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:58:00,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:58:00,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:58:00,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:58:00,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:58:00,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:58:00,265 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:58:00,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:58:00,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:58:00,267 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:58:00,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:58:00,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:58:00,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:58:00,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:58:00,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:58:00,269 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 06:58:00,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:58:00,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:58:00,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:58:00,279 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 06:58:00,279 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 06:58:00,280 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 06:58:00,280 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 06:58:00,280 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 06:58:00,280 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 06:58:00,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 06:58:00,280 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 06:58:00,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:58:00,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:58:00,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:58:00,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:58:00,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:58:00,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:58:00,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:58:00,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:58:00,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:58:00,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:58:00,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:58:00,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:58:00,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:58:00,282 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:58:00,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:58:00,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 06:58:00,284 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_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-11-10 06:58:00,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:58:00,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:58:00,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:58:00,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:58:00,317 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:58:00,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-10 06:58:00,353 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/data/dec7688db/3af2eab275c54fc1bfa9f293b544b3a1/FLAGae0302293 [2018-11-10 06:58:00,762 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:58:00,763 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-10 06:58:00,767 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/data/dec7688db/3af2eab275c54fc1bfa9f293b544b3a1/FLAGae0302293 [2018-11-10 06:58:00,776 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/data/dec7688db/3af2eab275c54fc1bfa9f293b544b3a1 [2018-11-10 06:58:00,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:58:00,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:58:00,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:58:00,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:58:00,783 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:58:00,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236dc686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00, skipping insertion in model container [2018-11-10 06:58:00,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:58:00,802 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:58:00,902 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:58:00,905 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:58:00,915 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:58:00,923 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:58:00,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00 WrapperNode [2018-11-10 06:58:00,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:58:00,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:58:00,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:58:00,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:58:00,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:58:00,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:58:00,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:58:00,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:58:00,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... [2018-11-10 06:58:00,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:58:00,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:58:00,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:58:00,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:58:00,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:58:01,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:58:01,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:58:01,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:58:01,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:58:01,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:58:01,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:58:01,015 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-10 06:58:01,015 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-10 06:58:01,015 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-10 06:58:01,015 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-10 06:58:01,108 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:58:01,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:58:01 BoogieIcfgContainer [2018-11-10 06:58:01,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:58:01,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:58:01,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:58:01,111 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:58:01,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:58:00" (1/3) ... [2018-11-10 06:58:01,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d10ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:58:01, skipping insertion in model container [2018-11-10 06:58:01,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:58:00" (2/3) ... [2018-11-10 06:58:01,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d10ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:58:01, skipping insertion in model container [2018-11-10 06:58:01,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:58:01" (3/3) ... [2018-11-10 06:58:01,113 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-10 06:58:01,120 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:58:01,125 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 06:58:01,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 06:58:01,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:58:01,158 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:58:01,158 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:58:01,158 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:58:01,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:58:01,159 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:58:01,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:58:01,159 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:58:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-10 06:58:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 06:58:01,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:01,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:01,175 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:01,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-10 06:58:01,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:01,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:58:01,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:58:01,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:58:01,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:58:01,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:58:01,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:58:01,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:58:01,305 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-10 06:58:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:01,383 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-10 06:58:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:58:01,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 06:58:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:01,390 INFO L225 Difference]: With dead ends: 44 [2018-11-10 06:58:01,390 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 06:58:01,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:58:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 06:58:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 06:58:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 06:58:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 06:58:01,419 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-10 06:58:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:01,420 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 06:58:01,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:58:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 06:58:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 06:58:01,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:01,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:01,422 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:01,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-10 06:58:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:01,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:58:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:58:01,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:58:01,453 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:58:01,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:58:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:58:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:58:01,454 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-10 06:58:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:01,525 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-10 06:58:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:58:01,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 06:58:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:01,527 INFO L225 Difference]: With dead ends: 36 [2018-11-10 06:58:01,527 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 06:58:01,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:58:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 06:58:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 06:58:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 06:58:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-10 06:58:01,534 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-10 06:58:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:01,535 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-10 06:58:01,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:58:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-10 06:58:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 06:58:01,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:01,537 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:01,537 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:01,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-10 06:58:01,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:01,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:01,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:58:01,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:01,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:01,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-10 06:58:01,612 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-10 06:58:01,643 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:58:01,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:58:01,718 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 06:58:01,719 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Never found a fixpoint. Largest state had 5 variables. [2018-11-10 06:58:01,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:01,724 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 06:58:01,765 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 06:58:01,766 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 06:58:01,796 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-10 06:58:01,797 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 06:58:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:58:01,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-10 06:58:01,798 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:58:01,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 06:58:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 06:58:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:58:01,799 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-10 06:58:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:01,999 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-10 06:58:01,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 06:58:01,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-10 06:58:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:02,001 INFO L225 Difference]: With dead ends: 72 [2018-11-10 06:58:02,001 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 06:58:02,001 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:58:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 06:58:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-10 06:58:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 06:58:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-10 06:58:02,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-10 06:58:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:02,011 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-10 06:58:02,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 06:58:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-10 06:58:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 06:58:02,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:02,013 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:02,013 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:02,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-10 06:58:02,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:02,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:58:02,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:02,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:02,075 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-10 06:58:02,075 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 06:58:02,077 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:58:02,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:58:02,103 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 06:58:02,104 INFO L272 AbstractInterpreter]: Visited 16 different actions 46 times. Never merged. Widened at 2 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-10 06:58:02,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:02,106 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 06:58:02,126 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 06:58:02,126 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 06:58:02,172 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-10 06:58:02,172 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 06:58:02,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:58:02,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-10 06:58:02,173 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:58:02,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 06:58:02,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 06:58:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:58:02,174 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-10 06:58:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:02,426 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-10 06:58:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:58:02,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-10 06:58:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:02,427 INFO L225 Difference]: With dead ends: 87 [2018-11-10 06:58:02,427 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 06:58:02,427 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 06:58:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 06:58:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-10 06:58:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 06:58:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-10 06:58:02,433 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-10 06:58:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:02,433 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-10 06:58:02,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 06:58:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-10 06:58:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 06:58:02,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:02,434 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:02,435 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:02,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:02,435 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-10 06:58:02,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:02,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:02,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:02,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:02,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 06:58:02,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:02,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:02,495 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:02,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:02,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:02,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:02,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:58:02,503 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:58:02,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 06:58:02,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:02,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 06:58:02,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 06:58:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:02,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-10 06:58:02,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:02,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:58:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:58:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-10 06:58:02,841 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-10 06:58:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:03,023 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-10 06:58:03,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 06:58:03,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-10 06:58:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:03,026 INFO L225 Difference]: With dead ends: 121 [2018-11-10 06:58:03,027 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 06:58:03,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-10 06:58:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 06:58:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-10 06:58:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 06:58:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-10 06:58:03,037 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-10 06:58:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:03,038 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-10 06:58:03,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:58:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-10 06:58:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 06:58:03,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:03,040 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:03,042 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-10 06:58:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:03,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:03,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 06:58:03,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:03,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:03,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 06:58:03,092 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 06:58:03,093 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:58:03,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:58:03,580 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 06:58:03,580 INFO L272 AbstractInterpreter]: Visited 29 different actions 1315 times. Merged at 11 different actions 372 times. Widened at 2 different actions 46 times. Found 49 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-10 06:58:03,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:03,599 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 06:58:03,615 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 06:58:03,616 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 06:58:03,667 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 06:58:03,667 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 06:58:03,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:58:03,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-10 06:58:03,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:58:03,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 06:58:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 06:58:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:58:03,668 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-11-10 06:58:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:03,934 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-10 06:58:03,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:58:03,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-10 06:58:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:03,936 INFO L225 Difference]: With dead ends: 109 [2018-11-10 06:58:03,936 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 06:58:03,936 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 06:58:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 06:58:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 06:58:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 06:58:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-10 06:58:03,947 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-11-10 06:58:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:03,947 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-10 06:58:03,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 06:58:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-10 06:58:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 06:58:03,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:03,949 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:03,949 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:03,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-11-10 06:58:03,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:03,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:03,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 06:58:04,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:04,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:04,006 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-11-10 06:58:04,007 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 06:58:04,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:58:04,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:58:07,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:58:07,686 INFO L272 AbstractInterpreter]: Visited 34 different actions 21823 times. Merged at 14 different actions 4043 times. Widened at 4 different actions 328 times. Found 440 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-10 06:58:07,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:07,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:58:07,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:07,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:07,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:07,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:58:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 06:58:07,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 06:58:08,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:08,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 18 [2018-11-10 06:58:08,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:08,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 06:58:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 06:58:08,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-10 06:58:08,267 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 12 states. [2018-11-10 06:58:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:08,439 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2018-11-10 06:58:08,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 06:58:08,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-10 06:58:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:08,441 INFO L225 Difference]: With dead ends: 144 [2018-11-10 06:58:08,441 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 06:58:08,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-11-10 06:58:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 06:58:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-11-10 06:58:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 06:58:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-11-10 06:58:08,453 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 67 [2018-11-10 06:58:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:08,454 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-11-10 06:58:08,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 06:58:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-10 06:58:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 06:58:08,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:08,457 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:08,457 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:08,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-11-10 06:58:08,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:08,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:08,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 06:58:08,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:08,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:08,553 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-10 06:58:08,554 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-10 06:58:08,555 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:58:08,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:58:08,902 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 06:58:08,902 INFO L272 AbstractInterpreter]: Visited 29 different actions 1407 times. Merged at 11 different actions 329 times. Widened at 2 different actions 37 times. Found 41 fixpoints after 5 different actions. Largest state had 5 variables. [2018-11-10 06:58:08,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:08,927 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 06:58:08,949 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 06:58:08,949 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 06:58:09,084 INFO L415 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-11-10 06:58:09,084 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 06:58:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:58:09,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [11] total 26 [2018-11-10 06:58:09,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:58:09,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 06:58:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 06:58:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-10 06:58:09,086 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 17 states. [2018-11-10 06:58:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:09,794 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-11-10 06:58:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 06:58:09,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-11-10 06:58:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:09,796 INFO L225 Difference]: With dead ends: 136 [2018-11-10 06:58:09,796 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 06:58:09,797 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-11-10 06:58:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 06:58:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-10 06:58:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 06:58:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-11-10 06:58:09,808 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-11-10 06:58:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:09,808 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-11-10 06:58:09,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 06:58:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-11-10 06:58:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 06:58:09,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:09,810 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:09,810 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:09,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:09,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1708632044, now seen corresponding path program 2 times [2018-11-10 06:58:09,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:09,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:09,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:09,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:09,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 68 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-10 06:58:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:09,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:09,928 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:09,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:09,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:09,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:58:09,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:58:09,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 06:58:09,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:09,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 15 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-10 06:58:10,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-11-10 06:58:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 20 [2018-11-10 06:58:10,265 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:10,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 06:58:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 06:58:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-10 06:58:10,266 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 16 states. [2018-11-10 06:58:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:10,592 INFO L93 Difference]: Finished difference Result 218 states and 340 transitions. [2018-11-10 06:58:10,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 06:58:10,592 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-11-10 06:58:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:10,594 INFO L225 Difference]: With dead ends: 218 [2018-11-10 06:58:10,594 INFO L226 Difference]: Without dead ends: 147 [2018-11-10 06:58:10,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 202 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 06:58:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-10 06:58:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2018-11-10 06:58:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-10 06:58:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2018-11-10 06:58:10,609 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 108 [2018-11-10 06:58:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:10,609 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-11-10 06:58:10,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 06:58:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2018-11-10 06:58:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 06:58:10,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:10,613 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:10,613 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:10,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -360884728, now seen corresponding path program 3 times [2018-11-10 06:58:10,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:10,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:10,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 125 proven. 89 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-11-10 06:58:10,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:10,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:10,695 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:10,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:10,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:10,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:10,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 06:58:10,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 06:58:10,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 06:58:10,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:10,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 52 proven. 283 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2018-11-10 06:58:10,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 52 proven. 299 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2018-11-10 06:58:11,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:11,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 15] total 21 [2018-11-10 06:58:11,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:11,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 06:58:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 06:58:11,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-11-10 06:58:11,806 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand 14 states. [2018-11-10 06:58:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:12,070 INFO L93 Difference]: Finished difference Result 308 states and 559 transitions. [2018-11-10 06:58:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 06:58:12,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-11-10 06:58:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:12,073 INFO L225 Difference]: With dead ends: 308 [2018-11-10 06:58:12,073 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 06:58:12,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 353 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2018-11-10 06:58:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 06:58:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-11-10 06:58:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 06:58:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 184 transitions. [2018-11-10 06:58:12,090 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 184 transitions. Word has length 189 [2018-11-10 06:58:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:12,090 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 184 transitions. [2018-11-10 06:58:12,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 06:58:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 184 transitions. [2018-11-10 06:58:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-10 06:58:12,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:12,094 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 16, 16, 13, 11, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:12,094 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:12,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1700355014, now seen corresponding path program 4 times [2018-11-10 06:58:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:12,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:12,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 109 proven. 249 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2018-11-10 06:58:12,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:12,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:12,191 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:12,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:12,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:12,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:12,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:58:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:12,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 81 proven. 444 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2018-11-10 06:58:12,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1553 backedges. 81 proven. 468 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2018-11-10 06:58:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 25 [2018-11-10 06:58:13,368 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:13,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 06:58:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 06:58:13,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-11-10 06:58:13,369 INFO L87 Difference]: Start difference. First operand 131 states and 184 transitions. Second operand 18 states. [2018-11-10 06:58:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:13,721 INFO L93 Difference]: Finished difference Result 345 states and 635 transitions. [2018-11-10 06:58:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 06:58:13,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 241 [2018-11-10 06:58:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:13,724 INFO L225 Difference]: With dead ends: 345 [2018-11-10 06:58:13,724 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 06:58:13,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 452 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 06:58:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 06:58:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 147. [2018-11-10 06:58:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-10 06:58:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2018-11-10 06:58:13,738 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 241 [2018-11-10 06:58:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:13,738 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2018-11-10 06:58:13,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 06:58:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2018-11-10 06:58:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-10 06:58:13,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:13,742 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 18, 17, 17, 13, 12, 12, 12, 12, 12, 12, 12, 10, 8, 8, 8, 8, 8, 8, 8, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:13,743 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:13,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -350232371, now seen corresponding path program 5 times [2018-11-10 06:58:13,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:13,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 151 proven. 413 refuted. 0 times theorem prover too weak. 1691 trivial. 0 not checked. [2018-11-10 06:58:13,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:13,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:13,887 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:13,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:13,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:13,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:13,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:58:13,896 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:58:13,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 06:58:13,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:13,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 451 proven. 3 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2018-11-10 06:58:13,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 348 proven. 5 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2018-11-10 06:58:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2018-11-10 06:58:14,379 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:14,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 06:58:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 06:58:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-10 06:58:14,380 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand 16 states. [2018-11-10 06:58:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:14,616 INFO L93 Difference]: Finished difference Result 267 states and 421 transitions. [2018-11-10 06:58:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:58:14,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 284 [2018-11-10 06:58:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:14,618 INFO L225 Difference]: With dead ends: 267 [2018-11-10 06:58:14,618 INFO L226 Difference]: Without dead ends: 146 [2018-11-10 06:58:14,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 555 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-11-10 06:58:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-10 06:58:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-11-10 06:58:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 06:58:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2018-11-10 06:58:14,633 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 284 [2018-11-10 06:58:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:14,634 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2018-11-10 06:58:14,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 06:58:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2018-11-10 06:58:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-10 06:58:14,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:14,641 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 25, 25, 23, 22, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 10, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:14,641 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:14,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash -980226852, now seen corresponding path program 6 times [2018-11-10 06:58:14,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:14,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:14,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4108 backedges. 235 proven. 731 refuted. 0 times theorem prover too weak. 3142 trivial. 0 not checked. [2018-11-10 06:58:14,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:14,871 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:14,871 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:14,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:14,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:14,871 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:14,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 06:58:14,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 06:58:14,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 06:58:14,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:14,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4108 backedges. 237 proven. 726 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2018-11-10 06:58:15,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4108 backedges. 238 proven. 746 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2018-11-10 06:58:16,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:16,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 24 [2018-11-10 06:58:16,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:16,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 06:58:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 06:58:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-10 06:58:16,294 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand 16 states. [2018-11-10 06:58:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:16,488 INFO L93 Difference]: Finished difference Result 245 states and 430 transitions. [2018-11-10 06:58:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 06:58:16,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 382 [2018-11-10 06:58:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:16,490 INFO L225 Difference]: With dead ends: 245 [2018-11-10 06:58:16,490 INFO L226 Difference]: Without dead ends: 151 [2018-11-10 06:58:16,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 744 SyntacticMatches, 16 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-11-10 06:58:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-10 06:58:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-11-10 06:58:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 06:58:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2018-11-10 06:58:16,505 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 382 [2018-11-10 06:58:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:16,505 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2018-11-10 06:58:16,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 06:58:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2018-11-10 06:58:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-10 06:58:16,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:16,507 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 23, 21, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 9, 8, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:16,508 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:16,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1698942908, now seen corresponding path program 7 times [2018-11-10 06:58:16,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:16,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:16,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:16,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 233 proven. 745 refuted. 0 times theorem prover too weak. 3077 trivial. 0 not checked. [2018-11-10 06:58:16,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:16,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:16,717 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:16,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:16,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:16,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:16,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:58:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:16,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 197 proven. 602 refuted. 0 times theorem prover too weak. 3256 trivial. 0 not checked. [2018-11-10 06:58:16,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 197 proven. 618 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-10 06:58:17,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:17,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 15] total 26 [2018-11-10 06:58:17,717 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:17,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 06:58:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 06:58:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-11-10 06:58:17,718 INFO L87 Difference]: Start difference. First operand 151 states and 202 transitions. Second operand 20 states. [2018-11-10 06:58:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:18,217 INFO L93 Difference]: Finished difference Result 371 states and 609 transitions. [2018-11-10 06:58:18,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 06:58:18,217 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 381 [2018-11-10 06:58:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:18,220 INFO L225 Difference]: With dead ends: 371 [2018-11-10 06:58:18,220 INFO L226 Difference]: Without dead ends: 236 [2018-11-10 06:58:18,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 739 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1882, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 06:58:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-10 06:58:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 214. [2018-11-10 06:58:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-10 06:58:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 314 transitions. [2018-11-10 06:58:18,240 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 314 transitions. Word has length 381 [2018-11-10 06:58:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:18,240 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 314 transitions. [2018-11-10 06:58:18,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 06:58:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 314 transitions. [2018-11-10 06:58:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-11-10 06:58:18,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:18,245 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 34, 34, 30, 28, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 13, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:18,246 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:18,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash -219381378, now seen corresponding path program 8 times [2018-11-10 06:58:18,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:18,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:18,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 677 proven. 425 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-11-10 06:58:18,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:18,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:18,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:18,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:18,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:18,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:58:18,490 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:58:18,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-10 06:58:18,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:18,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 890 proven. 31 refuted. 0 times theorem prover too weak. 5956 trivial. 0 not checked. [2018-11-10 06:58:18,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6877 backedges. 890 proven. 31 refuted. 0 times theorem prover too weak. 5956 trivial. 0 not checked. [2018-11-10 06:58:19,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:19,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2018-11-10 06:58:19,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:19,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 06:58:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 06:58:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-10 06:58:19,491 INFO L87 Difference]: Start difference. First operand 214 states and 314 transitions. Second operand 19 states. [2018-11-10 06:58:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:19,953 INFO L93 Difference]: Finished difference Result 453 states and 748 transitions. [2018-11-10 06:58:19,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 06:58:19,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 491 [2018-11-10 06:58:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:19,956 INFO L225 Difference]: With dead ends: 453 [2018-11-10 06:58:19,956 INFO L226 Difference]: Without dead ends: 270 [2018-11-10 06:58:19,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 964 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=1643, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 06:58:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-10 06:58:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 236. [2018-11-10 06:58:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-10 06:58:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 356 transitions. [2018-11-10 06:58:19,974 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 356 transitions. Word has length 491 [2018-11-10 06:58:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:19,975 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 356 transitions. [2018-11-10 06:58:19,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 06:58:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 356 transitions. [2018-11-10 06:58:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-11-10 06:58:19,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:19,977 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 27, 26, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 16, 16, 16, 16, 11, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:19,978 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:19,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1431910759, now seen corresponding path program 9 times [2018-11-10 06:58:19,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:19,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:19,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:19,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 336 proven. 557 refuted. 0 times theorem prover too weak. 5507 trivial. 0 not checked. [2018-11-10 06:58:20,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:20,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:20,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:20,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:20,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:20,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 06:58:20,168 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 06:58:20,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 06:58:20,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:20,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 281 proven. 743 refuted. 0 times theorem prover too weak. 5376 trivial. 0 not checked. [2018-11-10 06:58:20,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 283 proven. 757 refuted. 0 times theorem prover too weak. 5360 trivial. 0 not checked. [2018-11-10 06:58:21,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:21,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 22 [2018-11-10 06:58:21,306 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:21,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 06:58:21,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 06:58:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-11-10 06:58:21,307 INFO L87 Difference]: Start difference. First operand 236 states and 356 transitions. Second operand 16 states. [2018-11-10 06:58:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:21,530 INFO L93 Difference]: Finished difference Result 490 states and 853 transitions. [2018-11-10 06:58:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 06:58:21,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 474 [2018-11-10 06:58:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:21,534 INFO L225 Difference]: With dead ends: 490 [2018-11-10 06:58:21,534 INFO L226 Difference]: Without dead ends: 261 [2018-11-10 06:58:21,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 925 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 06:58:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-10 06:58:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 234. [2018-11-10 06:58:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-10 06:58:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2018-11-10 06:58:21,559 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 474 [2018-11-10 06:58:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:21,560 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2018-11-10 06:58:21,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 06:58:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2018-11-10 06:58:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-11-10 06:58:21,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:21,565 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 38, 38, 33, 33, 22, 22, 22, 22, 22, 22, 22, 19, 19, 19, 19, 19, 19, 19, 14, 12, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:21,565 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:21,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash 802779842, now seen corresponding path program 10 times [2018-11-10 06:58:21,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:21,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:21,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:21,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:21,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9436 backedges. 953 proven. 265 refuted. 0 times theorem prover too weak. 8218 trivial. 0 not checked. [2018-11-10 06:58:21,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:21,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:21,783 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:21,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:21,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:21,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:21,789 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:58:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:21,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9436 backedges. 487 proven. 1045 refuted. 0 times theorem prover too weak. 7904 trivial. 0 not checked. [2018-11-10 06:58:22,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9436 backedges. 486 proven. 1067 refuted. 0 times theorem prover too weak. 7883 trivial. 0 not checked. [2018-11-10 06:58:23,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:23,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 18] total 30 [2018-11-10 06:58:23,635 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:23,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 06:58:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 06:58:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-11-10 06:58:23,636 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand 22 states. [2018-11-10 06:58:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:24,168 INFO L93 Difference]: Finished difference Result 476 states and 837 transitions. [2018-11-10 06:58:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 06:58:24,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 571 [2018-11-10 06:58:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:24,170 INFO L225 Difference]: With dead ends: 476 [2018-11-10 06:58:24,170 INFO L226 Difference]: Without dead ends: 227 [2018-11-10 06:58:24,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 1109 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 06:58:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-10 06:58:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-11-10 06:58:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 06:58:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 296 transitions. [2018-11-10 06:58:24,184 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 296 transitions. Word has length 571 [2018-11-10 06:58:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:24,185 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 296 transitions. [2018-11-10 06:58:24,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 06:58:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 296 transitions. [2018-11-10 06:58:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-10 06:58:24,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:24,188 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 30, 29, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 11, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:24,188 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:24,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 589588537, now seen corresponding path program 11 times [2018-11-10 06:58:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:24,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:24,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 649 proven. 266 refuted. 0 times theorem prover too weak. 6334 trivial. 0 not checked. [2018-11-10 06:58:24,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:24,318 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:24,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:24,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:24,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:24,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:24,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:58:24,326 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:58:24,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 06:58:24,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:24,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 780 proven. 133 refuted. 0 times theorem prover too weak. 6336 trivial. 0 not checked. [2018-11-10 06:58:24,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 780 proven. 145 refuted. 0 times theorem prover too weak. 6324 trivial. 0 not checked. [2018-11-10 06:58:25,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:25,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2018-11-10 06:58:25,329 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:25,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 06:58:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 06:58:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-11-10 06:58:25,330 INFO L87 Difference]: Start difference. First operand 217 states and 296 transitions. Second operand 18 states. [2018-11-10 06:58:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:25,799 INFO L93 Difference]: Finished difference Result 486 states and 722 transitions. [2018-11-10 06:58:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 06:58:25,799 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 504 [2018-11-10 06:58:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:25,802 INFO L225 Difference]: With dead ends: 486 [2018-11-10 06:58:25,802 INFO L226 Difference]: Without dead ends: 282 [2018-11-10 06:58:25,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 988 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 06:58:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-10 06:58:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2018-11-10 06:58:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-10 06:58:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 369 transitions. [2018-11-10 06:58:25,829 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 369 transitions. Word has length 504 [2018-11-10 06:58:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:25,830 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 369 transitions. [2018-11-10 06:58:25,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 06:58:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 369 transitions. [2018-11-10 06:58:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-11-10 06:58:25,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:25,835 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 44, 44, 38, 38, 25, 25, 25, 25, 25, 25, 25, 22, 22, 22, 22, 22, 22, 22, 16, 13, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:25,835 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:25,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash -505333050, now seen corresponding path program 12 times [2018-11-10 06:58:25,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:25,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:25,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:25,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:25,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12414 backedges. 1214 proven. 566 refuted. 0 times theorem prover too weak. 10634 trivial. 0 not checked. [2018-11-10 06:58:26,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:26,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:26,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:26,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:26,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:26,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:26,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 06:58:26,181 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 06:58:26,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 06:58:26,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:26,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12414 backedges. 687 proven. 1090 refuted. 0 times theorem prover too weak. 10637 trivial. 0 not checked. [2018-11-10 06:58:26,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12414 backedges. 684 proven. 1114 refuted. 0 times theorem prover too weak. 10616 trivial. 0 not checked. [2018-11-10 06:58:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:27,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 25 [2018-11-10 06:58:27,928 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:27,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 06:58:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 06:58:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-11-10 06:58:27,929 INFO L87 Difference]: Start difference. First operand 264 states and 369 transitions. Second operand 17 states. [2018-11-10 06:58:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:28,156 INFO L93 Difference]: Finished difference Result 322 states and 470 transitions. [2018-11-10 06:58:28,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 06:58:28,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 653 [2018-11-10 06:58:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:28,160 INFO L225 Difference]: With dead ends: 322 [2018-11-10 06:58:28,160 INFO L226 Difference]: Without dead ends: 253 [2018-11-10 06:58:28,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1285 SyntacticMatches, 16 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2018-11-10 06:58:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-10 06:58:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2018-11-10 06:58:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 06:58:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 333 transitions. [2018-11-10 06:58:28,183 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 333 transitions. Word has length 653 [2018-11-10 06:58:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:28,184 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 333 transitions. [2018-11-10 06:58:28,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 06:58:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 333 transitions. [2018-11-10 06:58:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-11-10 06:58:28,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:28,189 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 28, 28, 24, 23, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 9, 9, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:28,189 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:28,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash -932305454, now seen corresponding path program 13 times [2018-11-10 06:58:28,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:28,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:28,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4685 backedges. 586 proven. 377 refuted. 0 times theorem prover too weak. 3722 trivial. 0 not checked. [2018-11-10 06:58:28,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:28,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:28,394 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:28,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:28,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:28,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:28,403 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:58:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:28,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4685 backedges. 388 proven. 338 refuted. 0 times theorem prover too weak. 3959 trivial. 0 not checked. [2018-11-10 06:58:28,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4685 backedges. 390 proven. 346 refuted. 0 times theorem prover too weak. 3949 trivial. 0 not checked. [2018-11-10 06:58:29,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:29,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 13] total 24 [2018-11-10 06:58:29,334 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:29,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 06:58:29,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 06:58:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-11-10 06:58:29,335 INFO L87 Difference]: Start difference. First operand 250 states and 333 transitions. Second operand 19 states. [2018-11-10 06:58:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:29,815 INFO L93 Difference]: Finished difference Result 438 states and 617 transitions. [2018-11-10 06:58:29,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 06:58:29,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 408 [2018-11-10 06:58:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:29,817 INFO L225 Difference]: With dead ends: 438 [2018-11-10 06:58:29,817 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 06:58:29,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 797 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 06:58:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 06:58:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-11-10 06:58:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-10 06:58:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 210 transitions. [2018-11-10 06:58:29,830 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 210 transitions. Word has length 408 [2018-11-10 06:58:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:29,831 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 210 transitions. [2018-11-10 06:58:29,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 06:58:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 210 transitions. [2018-11-10 06:58:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-10 06:58:29,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:29,833 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:29,833 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:29,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1740376526, now seen corresponding path program 14 times [2018-11-10 06:58:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:29,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:29,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1090 proven. 156 refuted. 0 times theorem prover too weak. 4123 trivial. 0 not checked. [2018-11-10 06:58:30,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:30,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:58:30,071 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:58:30,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:58:30,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:58:30,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:58:30,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:58:30,080 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:58:30,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 06:58:30,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:58:30,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 663 proven. 113 refuted. 0 times theorem prover too weak. 4593 trivial. 0 not checked. [2018-11-10 06:58:30,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:58:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 667 proven. 119 refuted. 0 times theorem prover too weak. 4583 trivial. 0 not checked. [2018-11-10 06:58:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:58:30,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 13] total 25 [2018-11-10 06:58:30,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:58:30,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 06:58:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 06:58:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-11-10 06:58:30,962 INFO L87 Difference]: Start difference. First operand 172 states and 210 transitions. Second operand 20 states. [2018-11-10 06:58:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:58:31,432 INFO L93 Difference]: Finished difference Result 218 states and 269 transitions. [2018-11-10 06:58:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 06:58:31,432 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 436 [2018-11-10 06:58:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:58:31,433 INFO L225 Difference]: With dead ends: 218 [2018-11-10 06:58:31,434 INFO L226 Difference]: Without dead ends: 197 [2018-11-10 06:58:31,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 856 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 06:58:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-10 06:58:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-11-10 06:58:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 06:58:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 230 transitions. [2018-11-10 06:58:31,447 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 230 transitions. Word has length 436 [2018-11-10 06:58:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:58:31,447 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 230 transitions. [2018-11-10 06:58:31,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 06:58:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 230 transitions. [2018-11-10 06:58:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-10 06:58:31,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:58:31,450 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:31,450 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:58:31,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 15 times [2018-11-10 06:58:31,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:58:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:31,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:31,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:58:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:31,524 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 06:58:31,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:58:31 BoogieIcfgContainer [2018-11-10 06:58:31,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:58:31,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:58:31,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:58:31,571 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:58:31,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:58:01" (3/4) ... [2018-11-10 06:58:31,573 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 06:58:31,639 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e7b6e16e-6284-4a5a-9245-4e9ca6578c13/bin-2019/utaipan/witness.graphml [2018-11-10 06:58:31,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:58:31,640 INFO L168 Benchmark]: Toolchain (without parser) took 30861.54 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 960.3 MB in the beginning and 1.6 GB in the end (delta: -610.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 06:58:31,641 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:58:31,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:58:31,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.39 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:58:31,642 INFO L168 Benchmark]: Boogie Preprocessor took 9.76 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:58:31,642 INFO L168 Benchmark]: RCFGBuilder took 163.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:58:31,642 INFO L168 Benchmark]: TraceAbstraction took 30461.34 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -492.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 06:58:31,642 INFO L168 Benchmark]: Witness Printer took 69.15 ms. Allocated memory is still 3.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:58:31,644 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.39 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.76 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30461.34 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -492.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 69.15 ms. Allocated memory is still 3.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 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 = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] 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-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] 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-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] 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-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] 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-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] 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); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] 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); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] 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-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] 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-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 30.4s OverallTime, 22 OverallIterations, 51 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 753 SDtfs, 1276 SDslu, 5789 SDs, 0 SdLazy, 6988 SolverSat, 1204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 11092 GetRequests, 10343 SyntacticMatches, 172 SemanticMatches, 577 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4190 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.959390862944163 AbsIntWeakeningRatio, 0.5685279187817259 AbsIntAvgWeakeningVarsNumRemoved, 1.6091370558375635 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 329 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 11173 NumberOfCodeBlocks, 9658 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 15900 ConstructedInterpolants, 0 QuantifiedInterpolants, 8683910 SizeOfPredicates, 95 NumberOfNonLiveVariables, 8110 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 51 InterpolantComputations, 2 PerfectInterpolantSequences, 180894/197264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...