./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:24:15,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:24:15,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:24:15,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:24:15,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:24:15,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:24:15,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:24:15,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:24:15,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:24:15,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:24:15,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:24:15,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:24:15,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:24:15,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:24:15,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:24:15,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:24:15,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:24:15,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:24:15,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:24:15,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:24:15,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:24:15,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:24:15,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:24:15,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:24:15,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:24:15,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:24:15,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:24:15,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:24:15,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:24:16,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:24:16,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:24:16,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:24:16,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:24:16,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:24:16,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:24:16,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:24:16,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:24:16,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:24:16,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:24:16,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:24:16,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:24:16,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 21:24:16,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:24:16,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:24:16,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:24:16,017 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:24:16,017 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:24:16,017 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:24:16,018 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:24:16,018 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:24:16,019 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:24:16,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 21:24:16,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 21:24:16,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:24:16,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:24:16,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:24:16,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:24:16,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:24:16,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:24:16,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:24:16,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:24:16,022 INFO L138 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/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1915ee2ae984f6ece38fc0dcbac99e0ba37faddf [2019-12-07 21:24:16,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:24:16,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:24:16,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:24:16,134 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:24:16,135 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:24:16,135 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/../../sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-12-07 21:24:16,175 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/data/52d5e17ce/adfc6f504d0145e285ce915c7d38c4d0/FLAGdfad71276 [2019-12-07 21:24:16,555 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:24:16,555 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2019-12-07 21:24:16,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/data/52d5e17ce/adfc6f504d0145e285ce915c7d38c4d0/FLAGdfad71276 [2019-12-07 21:24:16,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/data/52d5e17ce/adfc6f504d0145e285ce915c7d38c4d0 [2019-12-07 21:24:16,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:24:16,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:24:16,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:24:16,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:24:16,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:24:16,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:24:16" (1/1) ... [2019-12-07 21:24:16,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:16, skipping insertion in model container [2019-12-07 21:24:16,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:24:16" (1/1) ... [2019-12-07 21:24:16,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:24:16,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:24:17,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:24:17,172 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:24:17,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:24:17,227 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:24:17,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17 WrapperNode [2019-12-07 21:24:17,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:24:17,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:24:17,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:24:17,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:24:17,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:24:17,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:24:17,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:24:17,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:24:17,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... [2019-12-07 21:24:17,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:24:17,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:24:17,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:24:17,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:24:17,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/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 [2019-12-07 21:24:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 21:24:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:24:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:24:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:24:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2019-12-07 21:24:17,312 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2019-12-07 21:24:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:24:17,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:24:17,497 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:24:17,497 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 21:24:17,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:24:17 BoogieIcfgContainer [2019-12-07 21:24:17,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:24:17,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:24:17,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:24:17,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:24:17,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:24:16" (1/3) ... [2019-12-07 21:24:17,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dfd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:24:17, skipping insertion in model container [2019-12-07 21:24:17,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:24:17" (2/3) ... [2019-12-07 21:24:17,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dfd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:24:17, skipping insertion in model container [2019-12-07 21:24:17,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:24:17" (3/3) ... [2019-12-07 21:24:17,503 INFO L109 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2019-12-07 21:24:17,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:24:17,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-12-07 21:24:17,520 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 21:24:17,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:24:17,532 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 21:24:17,532 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:24:17,532 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:24:17,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:24:17,532 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:24:17,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:24:17,533 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:24:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-12-07 21:24:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:24:17,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:17,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:24:17,546 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 86075, now seen corresponding path program 1 times [2019-12-07 21:24:17,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:17,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474462299] [2019-12-07 21:24:17,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:17,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474462299] [2019-12-07 21:24:17,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:17,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:24:17,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217589552] [2019-12-07 21:24:17,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:24:17,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:24:17,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:24:17,666 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-12-07 21:24:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:17,697 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-12-07 21:24:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:24:17,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:24:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:17,704 INFO L225 Difference]: With dead ends: 20 [2019-12-07 21:24:17,704 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 21:24:17,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:24:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 21:24:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 21:24:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 21:24:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-12-07 21:24:17,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 3 [2019-12-07 21:24:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:17,729 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 21:24:17,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:24:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-12-07 21:24:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:24:17,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:17,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:24:17,730 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash 86076, now seen corresponding path program 1 times [2019-12-07 21:24:17,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:17,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473320452] [2019-12-07 21:24:17,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:17,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473320452] [2019-12-07 21:24:17,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:17,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:24:17,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371836917] [2019-12-07 21:24:17,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:24:17,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:24:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:24:17,771 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-12-07 21:24:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:17,805 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-12-07 21:24:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:24:17,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 21:24:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:17,806 INFO L225 Difference]: With dead ends: 18 [2019-12-07 21:24:17,806 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 21:24:17,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:24:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 21:24:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-07 21:24:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 21:24:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-12-07 21:24:17,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 3 [2019-12-07 21:24:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:17,809 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-12-07 21:24:17,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:24:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-12-07 21:24:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:24:17,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:17,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:24:17,810 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 87263, now seen corresponding path program 1 times [2019-12-07 21:24:17,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:17,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779483522] [2019-12-07 21:24:17,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:17,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779483522] [2019-12-07 21:24:17,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:17,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:24:17,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716276973] [2019-12-07 21:24:17,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:24:17,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:24:17,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:24:17,838 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-12-07 21:24:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:17,848 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-12-07 21:24:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:24:17,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:24:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:17,849 INFO L225 Difference]: With dead ends: 17 [2019-12-07 21:24:17,849 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 21:24:17,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:24:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 21:24:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 21:24:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 21:24:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-12-07 21:24:17,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 3 [2019-12-07 21:24:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:17,852 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-12-07 21:24:17,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:24:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-12-07 21:24:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:24:17,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:17,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:24:17,853 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1695328524, now seen corresponding path program 1 times [2019-12-07 21:24:17,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:17,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685157467] [2019-12-07 21:24:17,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:17,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685157467] [2019-12-07 21:24:17,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:17,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:24:17,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778538564] [2019-12-07 21:24:17,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:24:17,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:24:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:24:17,883 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2019-12-07 21:24:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:17,917 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-12-07 21:24:17,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:24:17,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 21:24:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:17,918 INFO L225 Difference]: With dead ends: 16 [2019-12-07 21:24:17,918 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 21:24:17,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:24:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 21:24:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 21:24:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 21:24:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-12-07 21:24:17,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 6 [2019-12-07 21:24:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:17,920 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-12-07 21:24:17,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:24:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-12-07 21:24:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:24:17,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:17,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:24:17,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1695328523, now seen corresponding path program 1 times [2019-12-07 21:24:17,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:17,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527840896] [2019-12-07 21:24:17,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:17,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527840896] [2019-12-07 21:24:17,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:17,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:24:17,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212177510] [2019-12-07 21:24:17,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:24:17,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:24:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:24:17,972 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2019-12-07 21:24:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:18,028 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-12-07 21:24:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:24:18,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-12-07 21:24:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:18,029 INFO L225 Difference]: With dead ends: 23 [2019-12-07 21:24:18,029 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 21:24:18,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:24:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 21:24:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 21:24:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 21:24:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-12-07 21:24:18,033 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2019-12-07 21:24:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-12-07 21:24:18,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:24:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-12-07 21:24:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:24:18,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:18,033 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:18,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1295192612, now seen corresponding path program 1 times [2019-12-07 21:24:18,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:18,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657261106] [2019-12-07 21:24:18,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:18,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657261106] [2019-12-07 21:24:18,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:18,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:24:18,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469015547] [2019-12-07 21:24:18,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:24:18,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:18,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:24:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:24:18,121 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2019-12-07 21:24:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:18,184 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-12-07 21:24:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:24:18,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 21:24:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:18,185 INFO L225 Difference]: With dead ends: 35 [2019-12-07 21:24:18,185 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 21:24:18,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:24:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 21:24:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-12-07 21:24:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:24:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 21:24:18,190 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2019-12-07 21:24:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:18,190 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 21:24:18,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:24:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 21:24:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:24:18,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:18,191 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:18,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -395615656, now seen corresponding path program 1 times [2019-12-07 21:24:18,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:18,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11696890] [2019-12-07 21:24:18,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:18,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11696890] [2019-12-07 21:24:18,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859012617] [2019-12-07 21:24:18,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:18,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 21:24:18,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:18,397 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:18,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 21:24:18,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:24:18,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:24:18,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:24:18,533 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 21:24:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:18,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [823772141] [2019-12-07 21:24:18,565 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:18,566 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:18,570 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:18,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:18,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2019-12-07 21:24:18,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507451723] [2019-12-07 21:24:18,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 21:24:18,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 21:24:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:24:18,572 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 21 states. [2019-12-07 21:24:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:18,766 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-12-07 21:24:18,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:24:18,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 12 [2019-12-07 21:24:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:18,767 INFO L225 Difference]: With dead ends: 41 [2019-12-07 21:24:18,768 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 21:24:18,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 21:24:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 21:24:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-12-07 21:24:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 21:24:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-12-07 21:24:18,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 12 [2019-12-07 21:24:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:18,775 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-12-07 21:24:18,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 21:24:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-12-07 21:24:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:24:18,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:18,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:18,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:18,977 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1497266885, now seen corresponding path program 1 times [2019-12-07 21:24:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:18,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190710151] [2019-12-07 21:24:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:19,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190710151] [2019-12-07 21:24:19,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:19,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:24:19,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097916040] [2019-12-07 21:24:19,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:24:19,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:24:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:24:19,047 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 4 states. [2019-12-07 21:24:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:19,060 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-12-07 21:24:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:24:19,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:24:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:19,061 INFO L225 Difference]: With dead ends: 37 [2019-12-07 21:24:19,061 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 21:24:19,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:24:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 21:24:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 21:24:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 21:24:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 21:24:19,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2019-12-07 21:24:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:19,063 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 21:24:19,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:24:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-12-07 21:24:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:24:19,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:19,064 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:19,064 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:19,065 INFO L82 PathProgramCache]: Analyzing trace with hash 616206271, now seen corresponding path program 2 times [2019-12-07 21:24:19,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:19,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991137635] [2019-12-07 21:24:19,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:19,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991137635] [2019-12-07 21:24:19,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708455920] [2019-12-07 21:24:19,277 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:19,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:24:19,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:19,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 21:24:19,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:19,500 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:19,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1842397328] [2019-12-07 21:24:19,656 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:19,656 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:19,657 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:19,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:19,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2019-12-07 21:24:19,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443657962] [2019-12-07 21:24:19,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 21:24:19,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:19,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 21:24:19,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2019-12-07 21:24:19,658 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 29 states. [2019-12-07 21:24:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:19,874 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-12-07 21:24:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:24:19,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 16 [2019-12-07 21:24:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:19,874 INFO L225 Difference]: With dead ends: 29 [2019-12-07 21:24:19,874 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 21:24:19,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 21:24:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 21:24:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-12-07 21:24:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 21:24:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 21:24:19,877 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-12-07 21:24:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:19,877 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 21:24:19,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 21:24:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-12-07 21:24:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:24:19,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:19,878 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 21:24:20,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:20,079 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash 506902331, now seen corresponding path program 3 times [2019-12-07 21:24:20,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:20,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666506491] [2019-12-07 21:24:20,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:20,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666506491] [2019-12-07 21:24:20,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780229483] [2019-12-07 21:24:20,199 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:20,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:20,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:20,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 21:24:20,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:20,380 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:20,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [455028174] [2019-12-07 21:24:20,588 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:20,588 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:20,588 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:20,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:20,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-12-07 21:24:20,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128265899] [2019-12-07 21:24:20,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 21:24:20,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 21:24:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2019-12-07 21:24:20,590 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 31 states. [2019-12-07 21:24:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:20,791 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-12-07 21:24:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:24:20,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 18 [2019-12-07 21:24:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:20,792 INFO L225 Difference]: With dead ends: 25 [2019-12-07 21:24:20,792 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 21:24:20,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 21:24:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 21:24:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-12-07 21:24:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 21:24:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 21:24:20,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2019-12-07 21:24:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:20,796 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 21:24:20,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 21:24:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 21:24:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:24:20,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:20,797 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 21:24:20,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:20,998 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash 691714850, now seen corresponding path program 4 times [2019-12-07 21:24:20,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:20,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694745544] [2019-12-07 21:24:20,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:21,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694745544] [2019-12-07 21:24:21,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113986531] [2019-12-07 21:24:21,159 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:21,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 21:24:21,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:21,454 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:21,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [588262967] [2019-12-07 21:24:21,821 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:21,822 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:21,822 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:21,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:21,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 35 [2019-12-07 21:24:21,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155175944] [2019-12-07 21:24:21,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 21:24:21,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 21:24:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:24:21,824 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 36 states. [2019-12-07 21:24:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:22,189 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 21:24:22,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 21:24:22,189 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 22 [2019-12-07 21:24:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:22,190 INFO L225 Difference]: With dead ends: 39 [2019-12-07 21:24:22,190 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 21:24:22,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 21:24:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 21:24:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-12-07 21:24:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 21:24:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 21:24:22,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-12-07 21:24:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:22,193 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 21:24:22,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 21:24:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-12-07 21:24:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:24:22,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:22,194 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 21:24:22,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:22,395 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:22,396 INFO L82 PathProgramCache]: Analyzing trace with hash -935176802, now seen corresponding path program 5 times [2019-12-07 21:24:22,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:22,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049713313] [2019-12-07 21:24:22,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:22,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049713313] [2019-12-07 21:24:22,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849078088] [2019-12-07 21:24:22,539 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:22,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 21:24:22,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:22,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 21:24:22,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:22,753 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:22,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897028613] [2019-12-07 21:24:22,994 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:22,994 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:22,995 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:22,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:22,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2019-12-07 21:24:22,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457537936] [2019-12-07 21:24:22,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 21:24:22,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 21:24:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 21:24:22,996 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 39 states. [2019-12-07 21:24:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:23,371 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-12-07 21:24:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 21:24:23,372 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 24 [2019-12-07 21:24:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:23,372 INFO L225 Difference]: With dead ends: 31 [2019-12-07 21:24:23,372 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:24:23,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 21:24:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:24:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-12-07 21:24:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 21:24:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 21:24:23,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2019-12-07 21:24:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:23,375 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 21:24:23,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 21:24:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 21:24:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 21:24:23,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:23,376 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 21:24:23,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:23,577 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1917161467, now seen corresponding path program 6 times [2019-12-07 21:24:23,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:23,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420405879] [2019-12-07 21:24:23,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:23,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420405879] [2019-12-07 21:24:23,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860387870] [2019-12-07 21:24:23,774 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:23,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:23,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:23,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 21:24:23,809 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:24,000 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:24,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [618732518] [2019-12-07 21:24:24,167 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:24,167 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:24,167 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:24,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:24,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2019-12-07 21:24:24,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280356835] [2019-12-07 21:24:24,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 21:24:24,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 21:24:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2019-12-07 21:24:24,169 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 32 states. [2019-12-07 21:24:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:24,560 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-12-07 21:24:24,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:24:24,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2019-12-07 21:24:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:24,561 INFO L225 Difference]: With dead ends: 49 [2019-12-07 21:24:24,561 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 21:24:24,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 21:24:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 21:24:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-12-07 21:24:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:24:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-12-07 21:24:24,564 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-12-07 21:24:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:24,564 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-12-07 21:24:24,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 21:24:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-12-07 21:24:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:24:24,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:24,565 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-12-07 21:24:24,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:24,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1431618175, now seen corresponding path program 7 times [2019-12-07 21:24:24,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98827233] [2019-12-07 21:24:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:24,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98827233] [2019-12-07 21:24:24,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721795869] [2019-12-07 21:24:24,960 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:24,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 21:24:24,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:25,116 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:25,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2016376295] [2019-12-07 21:24:25,423 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:25,423 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:25,423 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:25,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:25,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 37 [2019-12-07 21:24:25,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365562247] [2019-12-07 21:24:25,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 21:24:25,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 21:24:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1333, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 21:24:25,425 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 39 states. [2019-12-07 21:24:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:25,719 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-12-07 21:24:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 21:24:25,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-12-07 21:24:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:25,720 INFO L225 Difference]: With dead ends: 37 [2019-12-07 21:24:25,720 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 21:24:25,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=1762, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 21:24:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 21:24:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-12-07 21:24:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 21:24:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 21:24:25,723 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2019-12-07 21:24:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:25,724 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 21:24:25,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 21:24:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 21:24:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:24:25,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:25,725 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2019-12-07 21:24:25,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:25,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1076449688, now seen corresponding path program 8 times [2019-12-07 21:24:25,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:25,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787399357] [2019-12-07 21:24:25,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:26,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787399357] [2019-12-07 21:24:26,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975872948] [2019-12-07 21:24:26,170 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:26,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 21:24:26,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:26,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 21:24:26,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:26,454 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:26,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [574560470] [2019-12-07 21:24:26,656 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:26,656 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:26,657 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:26,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:26,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 35 [2019-12-07 21:24:26,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314777370] [2019-12-07 21:24:26,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 21:24:26,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 21:24:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:24:26,658 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 36 states. [2019-12-07 21:24:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:27,799 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-12-07 21:24:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 21:24:27,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2019-12-07 21:24:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:27,800 INFO L225 Difference]: With dead ends: 59 [2019-12-07 21:24:27,800 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 21:24:27,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 21:24:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 21:24:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-12-07 21:24:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 21:24:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-12-07 21:24:27,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-12-07 21:24:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:27,806 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-12-07 21:24:27,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 21:24:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-12-07 21:24:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:24:27,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:27,807 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 21:24:28,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:28,009 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1706979044, now seen corresponding path program 9 times [2019-12-07 21:24:28,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:28,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185770441] [2019-12-07 21:24:28,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:28,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185770441] [2019-12-07 21:24:28,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191046852] [2019-12-07 21:24:28,239 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:28,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:28,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:28,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 21:24:28,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:28,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:29,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1887994888] [2019-12-07 21:24:29,165 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:29,165 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:29,165 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:29,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:29,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-12-07 21:24:29,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071099625] [2019-12-07 21:24:29,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-12-07 21:24:29,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:29,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-12-07 21:24:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3004, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 21:24:29,167 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 58 states. [2019-12-07 21:24:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:29,908 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-12-07 21:24:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:24:29,908 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 36 [2019-12-07 21:24:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:29,908 INFO L225 Difference]: With dead ends: 43 [2019-12-07 21:24:29,909 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 21:24:29,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=402, Invalid=3758, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 21:24:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 21:24:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-12-07 21:24:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 21:24:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-12-07 21:24:29,912 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2019-12-07 21:24:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:29,912 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-12-07 21:24:29,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-12-07 21:24:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-12-07 21:24:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:24:29,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:29,913 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2019-12-07 21:24:30,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:30,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:30,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1901885003, now seen corresponding path program 10 times [2019-12-07 21:24:30,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:30,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429512500] [2019-12-07 21:24:30,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429512500] [2019-12-07 21:24:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347041429] [2019-12-07 21:24:30,404 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:30,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-07 21:24:30,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:30,764 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 17 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:31,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [928847215] [2019-12-07 21:24:31,002 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:31,002 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:31,002 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:31,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:31,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2019-12-07 21:24:31,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615980292] [2019-12-07 21:24:31,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 21:24:31,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 21:24:31,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 21:24:31,004 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 40 states. [2019-12-07 21:24:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:31,885 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-12-07 21:24:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 21:24:31,886 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-12-07 21:24:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:31,887 INFO L225 Difference]: With dead ends: 69 [2019-12-07 21:24:31,887 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 21:24:31,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=2667, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 21:24:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 21:24:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-12-07 21:24:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 21:24:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-12-07 21:24:31,890 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-12-07 21:24:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:31,891 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-12-07 21:24:31,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 21:24:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-12-07 21:24:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 21:24:31,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:31,892 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-12-07 21:24:32,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:32,093 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash 435743175, now seen corresponding path program 11 times [2019-12-07 21:24:32,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:32,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866992663] [2019-12-07 21:24:32,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 25 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:32,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866992663] [2019-12-07 21:24:32,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567955233] [2019-12-07 21:24:32,382 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:32,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 21:24:32,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:32,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 21:24:32,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 25 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:32,917 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:33,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798947722] [2019-12-07 21:24:33,664 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:33,664 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:33,664 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:33,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:33,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-12-07 21:24:33,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976266329] [2019-12-07 21:24:33,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-12-07 21:24:33,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-12-07 21:24:33,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=4101, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 21:24:33,667 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 68 states. [2019-12-07 21:24:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:35,092 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-12-07 21:24:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 21:24:35,093 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 42 [2019-12-07 21:24:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:35,093 INFO L225 Difference]: With dead ends: 49 [2019-12-07 21:24:35,093 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 21:24:35,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=695, Invalid=5947, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 21:24:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 21:24:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-12-07 21:24:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 21:24:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-12-07 21:24:35,100 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2019-12-07 21:24:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:35,101 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-12-07 21:24:35,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-12-07 21:24:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-12-07 21:24:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 21:24:35,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:35,102 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2019-12-07 21:24:35,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:35,303 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1011402670, now seen corresponding path program 12 times [2019-12-07 21:24:35,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:35,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42789989] [2019-12-07 21:24:35,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:35,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42789989] [2019-12-07 21:24:35,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549811619] [2019-12-07 21:24:35,645 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:35,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:35,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:35,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 21:24:35,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:36,025 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:36,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1718257695] [2019-12-07 21:24:36,312 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:36,312 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:36,313 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:36,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:36,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 43 [2019-12-07 21:24:36,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246040442] [2019-12-07 21:24:36,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 21:24:36,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 21:24:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 21:24:36,314 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2019-12-07 21:24:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:37,125 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-12-07 21:24:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 21:24:37,126 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 46 [2019-12-07 21:24:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:37,126 INFO L225 Difference]: With dead ends: 79 [2019-12-07 21:24:37,126 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 21:24:37,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=3327, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 21:24:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 21:24:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-12-07 21:24:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:24:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-12-07 21:24:37,129 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-12-07 21:24:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:37,130 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-12-07 21:24:37,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 21:24:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-12-07 21:24:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 21:24:37,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:37,130 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-12-07 21:24:37,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:37,331 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash 201829930, now seen corresponding path program 13 times [2019-12-07 21:24:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:37,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947980798] [2019-12-07 21:24:37,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:37,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947980798] [2019-12-07 21:24:37,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209500009] [2019-12-07 21:24:37,655 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:37,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-07 21:24:37,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:37,919 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:38,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [695479904] [2019-12-07 21:24:38,603 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:38,603 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:38,603 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:38,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:38,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 55 [2019-12-07 21:24:38,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148377336] [2019-12-07 21:24:38,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 21:24:38,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 21:24:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2914, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 21:24:38,605 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 57 states. [2019-12-07 21:24:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:39,591 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-12-07 21:24:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 21:24:39,592 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 48 [2019-12-07 21:24:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:39,593 INFO L225 Difference]: With dead ends: 55 [2019-12-07 21:24:39,593 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 21:24:39,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=407, Invalid=3883, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 21:24:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 21:24:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-12-07 21:24:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 21:24:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-12-07 21:24:39,600 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2019-12-07 21:24:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:39,601 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-12-07 21:24:39,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 21:24:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-12-07 21:24:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 21:24:39,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:39,603 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2019-12-07 21:24:39,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:39,804 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1187553937, now seen corresponding path program 14 times [2019-12-07 21:24:39,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:39,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650472332] [2019-12-07 21:24:39,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 23 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:40,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650472332] [2019-12-07 21:24:40,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779776686] [2019-12-07 21:24:40,210 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:40,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-07 21:24:40,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:40,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-07 21:24:40,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 23 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:41,695 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 27 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:43,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569362671] [2019-12-07 21:24:43,237 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:43,237 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:43,237 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:43,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:43,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 30] total 82 [2019-12-07 21:24:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007722531] [2019-12-07 21:24:43,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-12-07 21:24:43,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-12-07 21:24:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=6541, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 21:24:43,240 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 83 states. [2019-12-07 21:24:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:49,090 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-12-07 21:24:49,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 21:24:49,090 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 52 [2019-12-07 21:24:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:49,091 INFO L225 Difference]: With dead ends: 89 [2019-12-07 21:24:49,091 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 21:24:49,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=548, Invalid=12792, Unknown=0, NotChecked=0, Total=13340 [2019-12-07 21:24:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 21:24:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-12-07 21:24:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 21:24:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-12-07 21:24:49,093 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-12-07 21:24:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:49,093 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-12-07 21:24:49,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-12-07 21:24:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-12-07 21:24:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 21:24:49,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:49,094 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-12-07 21:24:49,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:49,295 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:49,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1221049357, now seen corresponding path program 15 times [2019-12-07 21:24:49,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:49,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972321990] [2019-12-07 21:24:49,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 49 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:49,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972321990] [2019-12-07 21:24:49,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044590639] [2019-12-07 21:24:49,682 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:49,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:49,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:49,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 89 conjunts are in the unsatisfiable core [2019-12-07 21:24:49,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 49 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:50,152 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 64 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:51,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1195910270] [2019-12-07 21:24:51,186 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:51,186 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:51,187 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:51,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:51,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 71 [2019-12-07 21:24:51,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148067345] [2019-12-07 21:24:51,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-12-07 21:24:51,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:51,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-12-07 21:24:51,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=4816, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 21:24:51,188 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 73 states. [2019-12-07 21:24:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:53,487 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-12-07 21:24:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 21:24:53,488 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 54 [2019-12-07 21:24:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:53,490 INFO L225 Difference]: With dead ends: 61 [2019-12-07 21:24:53,490 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 21:24:53,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=603, Invalid=6203, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 21:24:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 21:24:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-12-07 21:24:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 21:24:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-12-07 21:24:53,494 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2019-12-07 21:24:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:53,495 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-12-07 21:24:53,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-12-07 21:24:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-12-07 21:24:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:24:53,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:53,496 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2019-12-07 21:24:53,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:53,697 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:24:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash -415693068, now seen corresponding path program 16 times [2019-12-07 21:24:53,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:24:53,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387344290] [2019-12-07 21:24:53,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:24:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 26 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:54,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387344290] [2019-12-07 21:24:54,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397646543] [2019-12-07 21:24:54,169 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:24:54,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 96 conjunts are in the unsatisfiable core [2019-12-07 21:24:54,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 49 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:56,081 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 49 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:59,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [641333614] [2019-12-07 21:24:59,194 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:24:59,194 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:24:59,194 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:24:59,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:24:59,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 89 [2019-12-07 21:24:59,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475607164] [2019-12-07 21:24:59,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-12-07 21:24:59,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:24:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-12-07 21:24:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=7613, Unknown=0, NotChecked=0, Total=8010 [2019-12-07 21:24:59,196 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 90 states. [2019-12-07 21:25:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:09,799 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-12-07 21:25:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-07 21:25:09,799 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 58 [2019-12-07 21:25:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:09,800 INFO L225 Difference]: With dead ends: 105 [2019-12-07 21:25:09,800 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 21:25:09,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=983, Invalid=15273, Unknown=0, NotChecked=0, Total=16256 [2019-12-07 21:25:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 21:25:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-12-07 21:25:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 21:25:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-12-07 21:25:09,803 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 58 [2019-12-07 21:25:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:09,803 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-12-07 21:25:09,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-12-07 21:25:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-12-07 21:25:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 21:25:09,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:09,803 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2019-12-07 21:25:10,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:25:10,004 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2019-12-07 21:25:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1210512599, now seen corresponding path program 17 times [2019-12-07 21:25:10,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:10,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697366402] [2019-12-07 21:25:10,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 29 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:10,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697366402] [2019-12-07 21:25:10,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191978870] [2019-12-07 21:25:10,625 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:25:10,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-07 21:25:10,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:25:10,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 21:25:10,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:25:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-12-07 21:25:11,022 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:25:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-12-07 21:25:11,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472144437] [2019-12-07 21:25:11,625 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:25:11,625 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:25:11,626 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:25:11,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:25:11,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 8, 8] total 51 [2019-12-07 21:25:11,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44722985] [2019-12-07 21:25:11,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 21:25:11,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 21:25:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2536, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 21:25:11,627 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 52 states. [2019-12-07 21:25:16,419 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 21:25:17,385 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 21:25:18,341 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 21:25:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:19,240 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-12-07 21:25:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-07 21:25:19,240 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 64 [2019-12-07 21:25:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:19,240 INFO L225 Difference]: With dead ends: 108 [2019-12-07 21:25:19,240 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:25:19,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=951, Invalid=11481, Unknown=0, NotChecked=0, Total=12432 [2019-12-07 21:25:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:25:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:25:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:25:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:25:19,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-12-07 21:25:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:19,241 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:25:19,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 21:25:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:25:19,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:25:19,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:25:19,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:25:19 BoogieIcfgContainer [2019-12-07 21:25:19,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:25:19,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:25:19,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:25:19,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:25:19,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:24:17" (3/4) ... [2019-12-07 21:25:19,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:25:19,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2019-12-07 21:25:19,467 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 21:25:19,467 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 21:25:19,468 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:25:19,494 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3d025173-1d20-41b8-8510-7ca6310ac34c/bin/utaipan/witness.graphml [2019-12-07 21:25:19,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:25:19,495 INFO L168 Benchmark]: Toolchain (without parser) took 62570.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -112.9 MB). Peak memory consumption was 142.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:25:19,496 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:25:19,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:25:19,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:25:19,496 INFO L168 Benchmark]: Boogie Preprocessor took 16.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:25:19,496 INFO L168 Benchmark]: RCFGBuilder took 226.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:25:19,497 INFO L168 Benchmark]: TraceAbstraction took 61953.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.2 MB). Peak memory consumption was 149.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:25:19,497 INFO L168 Benchmark]: Witness Printer took 41.53 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:25:19,498 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 226.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61953.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 153.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.2 MB). Peak memory consumption was 149.4 MB. Max. memory is 11.5 GB. * Witness Printer took 41.53 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 515]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 7 error locations. Result: SAFE, OverallTime: 61.9s, OverallIterations: 24, TraceHistogramMax: 11, AutomataDifference: 34.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 331 SDtfs, 1394 SDslu, 2854 SDs, 0 SdLazy, 16841 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1848 GetRequests, 711 SyntacticMatches, 60 SemanticMatches, 1077 ConstructedPredicates, 0 IntricatePredicates, 17 DeprecatedPredicates, 15123 ImplicationChecksByTransitivity, 41.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 33 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 1290 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 1856 ConstructedInterpolants, 139 QuantifiedInterpolants, 908185 SizeOfPredicates, 308 NumberOfNonLiveVariables, 3054 ConjunctsInSsa, 977 ConjunctsInUnsatCore, 58 InterpolantComputations, 7 PerfectInterpolantSequences, 1397/4997 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...